A limited path unicast QoS routing algorithm

被引：3

作者：

Zheng, YX ^{[1
]}

Tian, J ^{[1
]}

Liu, ZF ^{[1
]}

Dou, WH ^{[1
]}

机构：

[1] Natl Univ Def Technol, Sch Comp, Changsha 410073, Peoples R China

来源：

ISCC2004: NINTH INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS | 2004年

关键词：

D O I：

10.1109/ISCC.2004.1358650

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this paper, We propose a novel limited path algorithm called LPUA to deal with two constrained unicast QoS routing problems, which is known as NP-complete. By combining two weights linearly into a single one, Dijkstra algorithm based on the single weight can be used directly to return a least cost path between the source node and the destination node. When a routing request comes, LPUA only needs to compute a limited number of paths. If any of these paths cannot meet the routing constraints, the routing request will be refused. Extensive simulations have show that LPUA is very efficient.

引用

页码：870 / 875

页数：6

共 14 条

[1]

CUI Y, 2003, PRECOMPUTATION MULTI

[2] TAMCRA: a tunable accuracy multiple constraints routing algorithm [J].

De Neve, H ;

Van Mieghem, P .

COMPUTER COMMUNICATIONS, 2000, 23 (07) :667-679

[3]

Iwata A, 1996, IEICE T COMMUN, VE79B, P999

[4]

Jüttner A, 2001, IEEE INFOCOM SER, P859, DOI 10.1109/INFCOM.2001.916277

[5]

Korkmaz T, 2001, IEEE INFOCOM SER, P834, DOI 10.1109/INFCOM.2001.916274

[6]

KUIPERS F, 2002, IEEE COMMUNICATI DEC, V40

[7] Efficient QoS partition and routing of unicast and multicast [J].

Lorenz, DH ;

Orda, A ;

Raz, D ;

Shavitt, Y .

IEEE 2000 EIGHTH INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, 2000, :75-83

[8] Routing with end-to-end QoS guarantees in broadband networks [J].

Orda, A .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (03) :365-374

[9] A distributed algorithm for delay-constrained unicast routing [J].

Reeves, DS ;

Salama, HF .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (02) :239-250

[10] Hop-by-hop quality of service routing [J].

Van Mieghem, P ;

De Neve, H ;

Kuipers, F .

COMPUTER NETWORKS, 2001, 37 (3-4) :407-423

← 1 2 →