Research and simulation of distributed QOS routing algorithm

Author

Daxin, Zhu ; Danlin, Cai

Author_Institution

Sch. of Sci., Quanzhou Normal Univ., Quanzhou, China

fYear

2009

fDate

18-20 Oct. 2009

Firstpage

24

Lastpage

27

Abstract

Base on the QOS requirements of modern broadband networking, the paper presents our recent research on QOSPF in the on-demand computing over the traditional OSPF. The disadvantage in a distributed routing protocol under the QOS requirement is firstly discussed; then a new QOSPF which supports the QOS routing scheme is proposed. The advantage of new approach is demonstrated in the simulation of OSPF and QOSPF through the NS-2. Limitation of the method and future research for improvement are also discussed.

Keywords

IP networks; Internet; broadband networks; distributed algorithms; quality of service; routing protocols; transport protocols; IP networks; NS-2 simulation; OSPF protocol; QOSPF protocol; distributed QOS routing algorithm; distributed routing protocol; modern broadband networking; next-generation Internet; on-demand computing; open shortest path first protocol; Bandwidth; Computational modeling; Computer networks; Convergence; Cost function; IP networks; Network topology; Quality of service; Routing protocols; Telecommunication traffic; Distributed Routing Algorithm; QOSPF; Quality of Service;

fLanguage

English

Publisher

ieee

Conference_Titel

Broadband Network & Multimedia Technology, 2009. IC-BNMT '09. 2nd IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-4590-5

Electronic_ISBN

978-1-4244-4591-2

Type

conf

DOI

10.1109/ICBNMT.2009.5347805

Filename

5347805