期刊名称：International Journal of Information and Network Security (IJINS)
印刷版ISSN：2089-3299
出版年度：2013
卷号：2
期号：6
页码：451-461
DOI：10.11591/ijins.v2i6.4878
语种：English
出版社：Institute of Advanced Engineering and Science
摘要：During recent decades new routing paradigms based on policies and quality of service provisioning have been proposed. The aim of these constraint-based path selection algorithms is to satisfy a set of quality of service constraints. This can help to reduce costs and balance network load. Path computation algorithms pose new challenges when extending them to larger inter-domain networks. The process of path computation in these complex cases could be delivered to the external nodes like PCEs. In inter-domain cases, path computation schemes are more prone to blocking due to the long response time of the requests. To address this issue, we propose an algorithm to find the domain sequences in computing the end-to-end path from the source to the destination. The proposed algorithm also increases the number of successful requests while minimizing the blockage in network. The main advantage of the algorithm is to improve the overall network utilization, which can be seen in simulation results.
