Multiple path routing in networks with inaccurate link state information

被引：0

作者：

Jia, YX ^{[1
]}

Nikolaidis, I ^{[1
]}

Gburzynski, P ^{[1
]}

机构：

[1] Univ Alberta, Dept Comp Sci, Edmonton, AB T6H 2E8, Canada

来源：

2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD | 2001年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We study a collection of K-shortest path routing schemes and investigate their performance under a diverse set of network topologies and traffic conditions. We subsequently demonstrate that K-shortest path routing offers a lower blocking probability and more balanced link utilization than other routing methods. With the proposed approach, it is possible to reduce the frequency of link state exchange, and the incurred bandwidth overhead, without sacrificing the overall performance of the network.

引用

页码：2583 / 2587

页数：5

共 20 条

[1]

APOSTOLOPOULOS G, 1999, IEEE NETWORK SEP

[2]

APOSTOLOPOULOS G, 1998, SIGCOMM 98

[3]

APOSTOLOPOULOS G, 1999, IEEE INFOCOM 99 NEW

[4] MODELING CALL HOLDING TIME DISTRIBUTIONS FOR CCS NETWORK DESIGN AND PERFORMANCE ANALYSIS [J].

BOLOTIN, VA .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1994, 12 (03) :433-438

[5] 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

[6]

Cidon I, 1997, IEEE INFOCOM SER, P92, DOI 10.1109/INFCOM.1997.635118

[7] Finding the k shortest paths [J].

Eppstein, D .

SIAM JOURNAL ON COMPUTING, 1998, 28 (02) :652-673

[8]

Guerin R., 1997, P 2 GLOB INT MIN JOI

[9] QoS routing in networks with inaccurate information:: Theory and algorithms [J].

Guérin, RA ;

Orda, A .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (03) :350-364

[10]

HSU C, 1994, P IEEE NY NJ REG CON

← 1 2 →