QoS based routing algorithm in integrated services packet networks

Chotipat Pornavalai; Goutam Chakraborty; Norio Shiratori

QoS based routing algorithm in integrated services packet networks

Chotipat Pornavalai^*, Goutam Chakraborty, Norio Shiratori

^*この研究の対応する著者

研究成果: Conference contribution

48 被引用数 (Scopus)

抄録

In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSR_BF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSR_BF has better performance compared to the existing QoS routing algorithms.

本文言語	English
ホスト出版物のタイトル	International Conference on Network Protocols
Place of Publication	Los Alamitos, CA, United States
出版社	IEEE Comp Soc
ページ	167-174
ページ数	8
出版ステータス	Published - 1997
イベント	Proceedings of the 1997 International Conference on Network Protocols - Atlanta, GA, USA 継続期間: 1997 10月 28 → 1997 10月 31

Other

Other	Proceedings of the 1997 International Conference on Network Protocols
City	Atlanta, GA, USA
Period	97/10/28 → 97/10/31

ASJC Scopus subject areas

ソフトウェア

他のファイルとリンク

引用スタイル

@inproceedings{c1137ececd314826a52d01db2daed157,

title = "QoS based routing algorithm in integrated services packet networks",

abstract = "In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSRBF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSRBF has better performance compared to the existing QoS routing algorithms.",

author = "Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",

year = "1997",

language = "English",

pages = "167--174",

booktitle = "International Conference on Network Protocols",

publisher = "IEEE Comp Soc",

note = "Proceedings of the 1997 International Conference on Network Protocols ; Conference date: 28-10-1997 Through 31-10-1997",

}

TY - GEN

T1 - QoS based routing algorithm in integrated services packet networks

AU - Pornavalai, Chotipat

AU - Chakraborty, Goutam

AU - Shiratori, Norio

PY - 1997

Y1 - 1997

N2 - In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSRBF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSRBF has better performance compared to the existing QoS routing algorithms.

AB - In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called 'QoSRBF'), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSRBF has better performance compared to the existing QoS routing algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0031382704&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031382704&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0031382704

SP - 167

EP - 174

BT - International Conference on Network Protocols

PB - IEEE Comp Soc

CY - Los Alamitos, CA, United States

T2 - Proceedings of the 1997 International Conference on Network Protocols

Y2 - 28 October 1997 through 31 October 1997

ER -

QoS based routing algorithm in integrated services packet networks

抄録

Other

ASJC Scopus subject areas

他のファイルとリンク

フィンガープリント

引用スタイル