loading...
A Delay-Constrained QoS Routing Algorithm Based on Fano?s Method
Morne, Mauritius April 23-April 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNICONSMCL.2006.10International Conference on Networkin ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Swati Sinha Deb, University of Bristol, BS8 1UB, U.K
M.E. Woodward, University of Bradford, BD7 1DP, U.K
An upcoming real-time multimedia application requires diverse quality-of-service (QoS) requirements. Providing guaranteed QoS is essential to these applications. The current distributed routing algorithms are based on either flooding or shortest path algorithms and both tend to have high message overhead. A novel unicast distributed QoS routing algorithm based on Fano?s decoding method is investigated. This is the first known attempt to enhance an error control technique using Fano?s decoding algorithm for the purpose of QoS routing in wireline networks and which require relatively small amounts of storage for their implementation. Simulation results illustrate the efficiency of the proposed algorithm with respect to message overhead and the success ratio. It is shown that the message overhead in the proposed algorithm is lower compared to flooding and distance vector based algorithms while maintaining a similar success ratio.
Citation:
Swati Sinha Deb, M.E. Woodward, "A Delay-Constrained QoS Routing Algorithm Based on Fano?s Method," icniconsmcl, pp.91, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.