Constraint-based Path selection algorithms for Minimizing Blockage in Multi Domain Networks

Fatemeh Banaie, Mohammad Hossein Yaghmaee, Nazbanoo Farzaneh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


During recent decades new routing paradigms based on policies and quality of service provisioning have been proposed. The aim of 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 in larger inter domain networks. In these cases the process of path computation is more prone to block due to the long response time of the requests. In view of this, we propose and compare an algorithm to increase the number of successful requests while minimizing the blockage in network. The proposed algorithm also considers several QoS metrics in path computation that can help to have uniform traffic load in network. In this paper we focus on restrictions of the shortest path algorithms and propose a multi constrained path selection algorithm based on PCE.

Original languageEnglish
Title of host publication2012 6th International Symposium on Telecommunications
Subtitle of host publicationIST 2012
Number of pages6
ISBN (Electronic)9781467320733, 9781467320719
ISBN (Print)9781467320726
Publication statusPublished - 21 Mar 2013
Externally publishedYes
Event6th International Symposium on Telecommunications - Tehran, Iran, Islamic Republic of
Duration: 6 Nov 20128 Nov 2012
Conference number: 6


Conference6th International Symposium on Telecommunications
Abbreviated titleIST 2012
Country/TerritoryIran, Islamic Republic of

Cite this