A New Distributed QoS Routing Algorithm for Supporting Real-Time Communication in High-speed Networks

Chotipat PORNAVALAI; Goutam CHAKRABORTY; Norio SHIRATORI

A New Distributed QoS Routing Algorithm for Supporting Real-Time Communication in High-speed Networks

Chotipat PORNAVALAI, Goutam CHAKRABORTY, Norio SHIRATORI

Full Text Views

0

Share
Cite this

Summary :

Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|²), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).

Publication: IEICE TRANSACTIONS on Communications Vol.E80-B No.10 pp.1493-1501

Publication Date: 1997/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Network Interworking)

Category: Communication protocol

Cite this

Copy

Chotipat PORNAVALAI, Goutam CHAKRABORTY, Norio SHIRATORI, "A New Distributed QoS Routing Algorithm for Supporting Real-Time Communication in High-speed Networks" in IEICE TRANSACTIONS on Communications, vol. E80-B, no. 10, pp. 1493-1501, October 1997, doi: .
Abstract: Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|²), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e80-b_10_1493/_p

Copy

@ARTICLE{e80-b_10_1493,
author={Chotipat PORNAVALAI, Goutam CHAKRABORTY, Norio SHIRATORI, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Distributed QoS Routing Algorithm for Supporting Real-Time Communication in High-speed Networks},
year={1997},
volume={E80-B},
number={10},
pages={1493-1501},
abstract={Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|²), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - A New Distributed QoS Routing Algorithm for Supporting Real-Time Communication in High-speed Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1493
EP - 1501
AU - Chotipat PORNAVALAI
AU - Goutam CHAKRABORTY
AU - Norio SHIRATORI
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1997
AB - Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|²), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).
ER -