Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks

This thesis presents a new routing and admission control algorithm for dynamic routing of bandwidth-guaranteed Label Switched Paths ( LSPs) in Multi_Protocol Label Switching (MPLS) networks. The bandwidth-guaranteed LSPs are useful for traffic engineering applications, delivery of multimedia traffic...

Full description

Saved in:

Bibliographic Details
Main Author:	Tan, Su Wei
Format:	Thesis
Published:	2002
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-mmu-ep.19
record_format	uketd_dc
spelling	my-mmu-ep.192009-12-02T09:34:50Z Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks 2002-06-14 Tan, Su Wei This thesis presents a new routing and admission control algorithm for dynamic routing of bandwidth-guaranteed Label Switched Paths ( LSPs) in Multi_Protocol Label Switching (MPLS) networks. The bandwidth-guaranteed LSPs are useful for traffic engineering applications, delivery of multimedia traffic that required service assurance, and implementation of Virtual Private Networks (VPNs). Our proposed algorithm works online I.e. handle requests arriving one-by-one without the knowledge of future traffic arrival. It is designed based on two previously developed routing concepts: minimal interference routing and non-greedy admission control scheme. The minimal interference routing concepts considers the knowledge of ingress-egress points to defer loading on certain critical links. These critical links are defined as links that, if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs. On the other hand, the non-greedy framework suggests the use of exponential function to convert utilisation into link cost, and performs admission control based on the computed path cost. Our new algorithm is derived from the observations of the success and failure of both strategies. In particular , we develop a new weight assignment scheme, which is based on the objectives to minimise interference under low network loading , and resource usage under high network loading. We also propose a new admission control strategy that can achieve fair acceptance rate for ingress-egress pairs with diffent hop distances. The performance evaluation is carried out through an extensive set of simulation experiments. A flow-level event-driven routing simulator was developed specifically for the evaluation. We compare the performance of the algorithm with several previously proposed algorithms under a wide range of operating conditions. The simulation results show that our algorithm out -performs other strategies on several metrics, like the bandwidth blocking probability, fairness, and successful rerouting of demands upon link failure. In addition, the algorithm is capable of protecting LSP setup requests for certain ingress-egress pairs that have higher priority level. 2002-06 Thesis http://shdl.mmu.edu.my/19/ http://vlib.mmu.edu.my/diglib/login/dlusr/login.php masters Multimedia University Research Library
institution	Multimedia University
collection	MMU Institutional Repository
description	This thesis presents a new routing and admission control algorithm for dynamic routing of bandwidth-guaranteed Label Switched Paths ( LSPs) in Multi_Protocol Label Switching (MPLS) networks. The bandwidth-guaranteed LSPs are useful for traffic engineering applications, delivery of multimedia traffic that required service assurance, and implementation of Virtual Private Networks (VPNs). Our proposed algorithm works online I.e. handle requests arriving one-by-one without the knowledge of future traffic arrival. It is designed based on two previously developed routing concepts: minimal interference routing and non-greedy admission control scheme. The minimal interference routing concepts considers the knowledge of ingress-egress points to defer loading on certain critical links. These critical links are defined as links that, if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs. On the other hand, the non-greedy framework suggests the use of exponential function to convert utilisation into link cost, and performs admission control based on the computed path cost. Our new algorithm is derived from the observations of the success and failure of both strategies. In particular , we develop a new weight assignment scheme, which is based on the objectives to minimise interference under low network loading , and resource usage under high network loading. We also propose a new admission control strategy that can achieve fair acceptance rate for ingress-egress pairs with diffent hop distances. The performance evaluation is carried out through an extensive set of simulation experiments. A flow-level event-driven routing simulator was developed specifically for the evaluation. We compare the performance of the algorithm with several previously proposed algorithms under a wide range of operating conditions. The simulation results show that our algorithm out -performs other strategies on several metrics, like the bandwidth blocking probability, fairness, and successful rerouting of demands upon link failure. In addition, the algorithm is capable of protecting LSP setup requests for certain ingress-egress pairs that have higher priority level.
format	Thesis
qualification_level	Master's degree
author	Tan, Su Wei
spellingShingle	Tan, Su Wei Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks
author_facet	Tan, Su Wei
author_sort	Tan, Su Wei
title	Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks
title_short	Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks
title_full	Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks
title_fullStr	Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks
title_full_unstemmed	Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks
title_sort	non-greedy routing and admission control algorithm for traffic engineering in mpls networks
granting_institution	Multimedia University
granting_department	Research Library
publishDate	2002
_version_	1747829067659345920

Non-Greedy Routing And Admission Control Algorithm For Traffic Engineering In MPLS Networks

Similar Items