Paper Info
Title
Empirical probability based QoS routing.
Abstract
We study Quality-of-Service (QoS) routing schemes that make routing decisions based on empirical resource availability prob- ability information. These empirical probability based routing schemes offer better performance than traditional schemes that make routing decisions based on resource availability informa- tion when the global network state information is imprecise. We investigate variations of empirical probability based QoS rout- ing, present a number of schemes to explicitly maintain the re- source availability probability information, and evaluate the per- formance of the routing schemes. We conclude that the perfor- mance of empirical probability based routing is insensitive to the frequency of probability information updates and that empirical probability based routing can achieve good performance without introducing excessive overheads. We consider bandwidth-constrained problems in the con- text of source routing. We will assume that a link state algo- rithm that periodically updates the state information is used to maintain the global network state information. We propose to explicitly maintain the empirical bandwidth availability prob- ability information using the link state algorithm. We investi- gate various methods to obtain empirical bandwidth availabil- ity probability information and to compute feasible paths us- ing both the probability information and the bandwidth avail- ability information, and perform extensive simulation to eval- uate the routing algorithms. The main conclusion of this study include the followings: The performance of the empirical probability routing algo- rithms is insensitive to the frequency of the probability infor- mation updates. Thus, empirical probability based QoS rout- ing is feasible and can achieve good performance without in- troducing excessive overheads although maintaining the prob- ability information requires more data to be exchanged than maintaining the availability information. Empirical probability based routing is better than traditional availability based routing only when the global state informa- tion is imprecise. When the global network state information is sufficiently accurate, availability based routing offers better performance.
Year
DOI
Venue
2003
10.1109/ICC.2003.1203893
ICC
Keywords
Field
DocType
quality of service,routing,empirical probability,bandwidth,availability,probability,probability distribution,propagation delay,computer science,network topology,frequency
Multipath routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Computer network,Destination-Sequenced Distance Vector routing,Geographic routing,Distributed computing,Routing protocol
Conference
Volume
ISBN
Citations 
3
0-7803-7802-4
4
PageRank 
References 
Authors
0.45
8
2
Name
Order
Citations
PageRank
Xin Yuan1108992.27
Guang Yang2195.90