A distributed algorithm for unicast QoS-routing using path feasibility prediction

被引：0

作者：

Shariff, A. R. A. ^{[1
]}

Woodward, M. E. ^{[1
]}

机构：

[1] Univ Bradford, Dept Comp, Bradford BD7 1DP, W Yorkshire, England

来源：

HPSR: 2006 WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING | 2006年

关键词：

distributed algorithms; quality-of-service; routing; path feasibility predictor;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

we propose a new delay-constrained distributed algorithm (DCDRA) for unicast-routing. DCDRA uses a novel path feasibility predictor (PFP) inequality model that is able to predict the feasibility of a tentative routing path, and employs a crankhack facility. It is a hybrid distributed algorithm where it uniquely integrates the use of local-link state and the global binary connectivity information maintained at each node to compute routing paths. Simulation results show that average message overhead is modest with good connection success rates.

引用

页码：235 / +

页数：2

共 8 条

[1]

APOSTOLOPOULOS G, 1998, COMPUT COMMUN REV, V28, P17

[2] An overview of quality of service routing for next-generation high-speed networks: Problems and solutions [J].

Chen, SG ;

Nahrstedt, K .

IEEE NETWORK, 1998, 12 (06) :64-79

[3] A new distributed QoS routing algorithm based on Fano's method [J].

Deb, SS ;

Woodward, ME .

COMPUTER NETWORKS, 2005, 48 (02) :155-174

[4]

DOAR M, 1993, IEEE INFOCM

[5]

FANO RM, 1962, IEEE T INFO THEO APR

[6]

Lin S., 1983, ERROR CONTROL CODING

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

Reeves, DS ;

Salama, HF .

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

[8]

SHAIKH A, 2001, IEEE ACM T NET, V9

← 1 →