Open AccessQoS Routing in Diffserv MPLS Networks
Author(s) -
Phang Keat Keong,
Teck Chaw Ling,
Tan Fong Ang
Publication year - 2009
Publication title -
malaysian journal of computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.197
H-Index - 18
ISSN - 0127-9084
DOI - 10.22452/mjcs.vol22no2.5
Subject(s) - computer science , multiprotocol label switching , computer network , quality of service , dijkstra's algorithm , path protection , network packet , differentiated services , distributed computing , routing (electronic design automation) , bandwidth (computing) , the internet , equal cost multi path routing , link state routing protocol , routing protocol , shortest path problem , graph , wavelength division multiplexing , wavelength , physics , optoelectronics , theoretical computer science , world wide web
With the emergence of new network applications and quality of service (QoS) requirements, current Internet technology that supports best-effort service is clearly insufficient. This paper undertakes a detailed study of dynamic quality of service routing in Differentiated Service (DiffServ) Multiprotocol Label Switching (MPLS) networks. A polynomial time, heuristic dynamic routing algorithm, namely TE-QOSPF-Mix, is proposed to provide a better trade-off between hop-count and bandwidth optimization. The algorithm uses well-defined comparative function in path selection with computational complexity equals the original Dijkstra’s algorithm. A simulator, UMJaNetSim, is built to simulate and evaluate the proposed algorithm. The simulation results indicate that the proposed QoS routing algorithm exhibits better bandwidth acceptance and lower packet loss ratio.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom