Performance Evaluation of Preemption Algorithms in MPLS Networks

• Autorzy: Kaczmarek S. , Nowak K.
• Języki publikacji: EN

Abstrakty

EN

Preemption is a traffic engineering technique in Multiprotocol Switching Network that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discusses the dilemmas in implementing preemption methods are presented the simulation studyof well known existing algorithms. Based on the results, we provide recommendations for deployment of preemption for the two most common evaluation criteria: number of preemption and preempted bandwidth.

Słowa kluczowe

EN

MPLS; preemption; algorithms; traffic engineering

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2011
• Tom: Vol. 57, No. 2
• Strony: 169--175
• Opis fizyczny: Bibliogr. 11 poz., wykr.

Twórcy

autor

Kaczmarek S.

autor

Nowak K.

• Gdansk University of Technology, Faculty ETI,

Bibliografia

• [1] E. Rosen, A. Viswanathan, and R. Callon, “Multiprotocol Label Switching Architecture,” RFC 3031, January 2001.
• [2] B. S. Davie and Y. Rekhter, MPLS: Technology and Applications. Morgan Kaufmann Publishers, 2000.
• [3] M. Kolon and J. Doyle, Juniper Networks Routers: The Complete Reference. Osborne/McGraw-Hill, 2002.
• [4] D. Adwuche, J. Malcolm, J. Agogbua, M. O’Dell, and J. McManus, “Requirements for Traffic Engineering Over MPLS,” RFC 2702, September 1999.
• [5] J. A. Garay and I. S. Gopal, “Call Preemption in Cmmunication Networks,” in Proceedings of INFOCOM ’92, Florence, 1992, pp. 1043–1050.
• [6] M. Peyravian, “Providing Different Levels of Network Availability in High-speed Net-works,” in Proceedings of GLOBECOM ’94, 1994, pp. 941–945.
• [7] J. de Oliveira, C. Scoglio, I. F. Akyildiz, and G. Uhl, “A New Preemption Policy for Diffserv-Aware Traffic Engineering to Minimize Rerouting,” in Proceedings of IEEE INFOCOM 2002, vol. 2, June 2002, pp. 695–704.
• [8] J. de Oliveira, J. P. Vasseur, L. Chen, and C. Scoglio, “Label Switched Path (LSP) Preemption Policies for MPLS Traffic Engineering,” RFC 4829, April 2007.
• [9] F. Blanchy, L. Melon, and G. Leduc, “Routing in a MPLS Network Featuring Preemption Mchanisms,” in Proceedings of ICT 2003, 2003.
• [10] S. Kaczmarek and K. Nowak, “A New Heuristic Algorithm for Effective Preemption in MPLS Networks,” Workshop on High Performance Switching and Routing, pp. 337–342, 2006.
• [11] S. Kaczmarek and K. Nowak, “A Simulation Tool for Traffic Engineering Methods and QoS Evaluation of MPLS Networks,” in Proceedings of SIMUTools 2009, Rome, 2009, art. no. 54.