A Blocking Probability Reduction Method in Path Computation Schemes for Inter Domain Networks

Fatemeh Banaie, Mohammad Hossein Yaghmaee, Nazbanoo Farzaneh

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


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. Path Computation Element(PCE) architecture has been proposed for calculating end-to-end routes with computational constraints in multi domain network. In interdomain cases, path computation schemes are more prone to blocking due to the long response time of the requests. To address this issue, we propose a novel algorithm for path computation to increase the number of successful requests while minimizing the blockage in network. This will significantly improve the network utilization. The main advantage of the proposed algorithm is to reduce the overhead of message flooding, so by this method the network load could be decreased notably, which can be seen in simulation results.

Original languageEnglish
Title of host publication2012 6th International Symposium on Telecommunications
Subtitle of host publicationIST 2012
Number of pages7
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