Aspects of quality of service routing

被引：0

作者：

Van Mieghem, P ^{[1
]}

De Neve, H ^{[1
]}

机构：

[1] Delft Univ Technol, Fac Informat Technol & Syst, NL-2600 GA Delft, Netherlands

来源：

INTERNET ROUTING AND QUALITY OF SERVICE | 1998年 / 3529卷

关键词：

routing; quality of service; flooding dynamics; topology updates; TAMCRA;

D O I：

10.1117/12.333731

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Two pillars of QoS Routing are discussed: the QoS algorithm and the network function to provide each node a consistent view of the topology. Generally, QoS algorithms are believed to be exceedingly complex due to previous announcements that they belong to the class of NP-complete problems. However, a very efficient QoS algorithm, TAMCRA, has been designed which is slightly more complex than the well-known Dijkstra algorithm and far from hard NP-complete. The topology distribution mechanisms responsible to offer each node in the system a consistent view are complicated due to the coupling of some QoS link metrics (such as available bandwidth) with the state of the network resources. The difficulty lies in the different time scales that impact the process: the slowly flooding of topology information and the more rapid variations of the traffic flowing through the links.

引用

页码：34 / 41

页数：2

共 12 条

[1]

[Anonymous], 1998, FRAMEWORK QOS BASED

[2]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[3]

APOSTOLOPOULOS G, 1998, IN PRESS ACM SIGCOMM

[4]

*ATMF PNNI, 1996, PRIV NETW NETW INT P

[5] Modeling Internet topology [J].

Calvert, KL ;

Doar, MB ;

Zegura, EW .

IEEE COMMUNICATIONS MAGAZINE, 1997, 35 (06) :160-163

[6]

Cormen TH., 1995, INTRO ALGORITHMS

[7] A multiple quality of service routing algorithm for PNNI [J].

De Neve, H ;

Van Mieghem, P .

1998 IEEE ATM WORKSHOP PROCEEDINGS: MEETING THE CHALLENGES OF DEPLOYING THE GLOBAL BROADBAND NETWORK INFRASTRUCTURE, 1998, :324-328

[8]

DENEVE H, 1998, UNPUB IEEE T NETWORK

[9]

DENEVE H, 1998, UNPUB IEEE INFOCOM 9

[10]

NICHOLS K, 1998, 2 BIT DIFFERENTIAL S

← 1 2 →