DocumentCode
2449920
Title
Distributed QoS routing for multimedia traffic
Author
Sarangan, Venkatesh ; Ghosh, Donna ; Acharya, Raj
Author_Institution
Dept. of Comput. Sci. & Eng., State Univ. of New York, Buffalo, NY, USA
Volume
3
fYear
2000
fDate
2000
Firstpage
1631
Abstract
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algorithm can be classified into three categories: source routing; distributed routing; and hierarchical routing. The authors propose a distributed QoS routing algorithm that gives high call admission rates in a congested network for constraints on metrics like bandwidth, buffer, and CPU usage with a low message complexity
Keywords
communication complexity; distributed algorithms; multimedia communication; telecommunication congestion control; telecommunication network routing; CPU usage; QoS routing algorithm; bandwidth; call admission rates; congested network; distributed QoS routing algorithm; hierarchical routing; loopless path; message complexity; multimedia traffic; source routing; Bandwidth; Computer networks; Costs; Floods; Internet; Out of order; Probes; Routing; Switches; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on
Conference_Location
New York, NY
Print_ISBN
0-7803-6536-4
Type
conf
DOI
10.1109/ICME.2000.871083
Filename
871083
Link To Document