出版社：University of Malaya * Faculty of Computer Science and Information Technology
摘要：With the emergence of new network applications and quality of service (QoS) requirements, current Internet technology that supports besteffort 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 TEQOSPFMix, is proposed to provide a better tradeoff between hopcount and bandwidth optimization. The algorithm uses welldefined 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.
