Dynamic Prioritization of Path for Quality-of-Service Differentiation in Multi-Priority Traffic

Fatemeh Banaie, Seyed Amin Hosseini-Seno, Mohammad Hossein Yaghmaee, Rahmat Budiarto


The emergence of value added services relying on a higher interactivity has altered the requirements of current transport network. Diverse traffic classes are processed by a large-scale optical network, imposing a more efficient utilization of their network infrastructure resources. Such services generally cross multiple domains, but inter-domain path computation algorithms still have some limitations. This paper describes a priority based path computation algorithm to meet all QoS requirements with the available capacity. The proposed algorithm increases the rate of successful replies while minimizing the blockage in network. The dynamic traffic is classified into high and low priority, so it improves emergency response in network.


Path computation; inter-domain; traffic; Priority


J.L. Roux, J.P. Vasseur, J. Boyle, “Requirements for inter-area MPLS traffic engineering,” Internet Engineering Task Force (IETF) RFC 4105, 2005.

F. Paolucci, F. Cugini, A. Giregetti, N. Sambo, P. Castoldi, “ A survey on the path computation element (PCE) architecture,” IEEE Communications Surveys & Tutorial, in press, 2013.

A. Farrel, J. P. Vasseur, and J. Ash, “A path computation element (PCE) based architecture,” Internet Engineering Task Force (IETF), RFC 4655, Aug 2006.

R. Fu, “Next Generation Network Routing and Control Plane,” Technical University of Denmark, Februuary 2011.

O. Bonaventure, S.D. Cnodder, B.Quoitin, R.White, Controlling the redistribution of BGP routes, Internet Engineering Task Force(IETF), 2003.

O. Bonaventure, B. Quoitin, Common Utilization of the BGP Community Attribute, Internet Engineering Task Force (IETF), 2003.

J. Leroux, “Path Computation Element Communication Protocol (PCECP) Specific Requirements for Inter-Area MPLS and GMPLS Traffic Engineering,” IETF, RFC4927, 2007.

J.P. Vasseur, A. Ayyangar, R. Zhang, “A per-domain path computation method for establishing inter-domain traffic engineering (TE) label switched paths (LSPs),” IETF, RFC 5152, February 2008.

J.P. Vasseur, R. Zhan, N. Bitar, J. Le Roux, “A backward recursive PCE based computation (BRPC) procedure to compute shortest constrained inter-domain traffic engineering label switched paths,” IETF, RFC 5441, April 2009.

D. King, A. Farrel, “The application of the PCE architecture to the determination of a sequence of domains in MPLS & GMPLS, “ Internet Engineering Task Force (IETF) , July 2010.

D. Siracusa, S. Grita, G. Maier, A. Pattavina, F. Paolucci. F. Cugini, P. Castoldi,” Domain sequence protocol (DSP) for PCE-based multi-domain traffic engineering,” Journal of Optical Communication and Networking, November 2012, Vol. 4, No. 11.

Sh. Shang, N. Hua, L. Wang, R. Lu, X.. Zheng, H. Zhang, “A hierarchical path computation element (PCE)-based k-random-paths routing algorithm in multi-domain WDM networks,” Optical Switching and Networking, 2011, 235-241.

L. Buzzi, M. Bardellini, D. Siracusa, G. Maier, F. Paolucci, F. Cugini, L. Valcarenghi, and P. Castoldi, “Hierarchical border gateway protocol (HBGP) for PCE-based multi-domain traffic engineering,” in Proc. of ICC Conf., May 2010.

D. King, A. Farrel, “The application of the path computation element architecture to the determination of a sequence of domains in MPLS and GMPLS,” Internet Engineering Task Force (IETF), RFC 6805, November 2012.

M. Shirazipour , S. Pierre, “ End-to-end path computation schemes for traffic engineering in next generation multi-domain networks,” Ph.D thesis, Montreal University of Canada, Juin 2010.

OPNET Technologies, Inc., Opnet Modeler, http://www.opnet.com.

Full Text: PDF


  • There are currently no refbacks.