Complexity of network synchronization
Journal of the ACM (JACM)
Introduction to algorithms
Routing in the Internet
Introduction to distributed algorithms
Introduction to distributed algorithms
A new distributed route selection approach for channel establishment in real-time networks
IEEE/ACM Transactions on Networking (TON)
Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks
IEEE Transactions on Computers
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols
Distributed Algorithms
Fast Algorithms for Digital Signal Processing
Fast Algorithms for Digital Signal Processing
Principles of Digital Communication and Coding
Principles of Digital Communication and Coding
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Mobile ad hoc networking and the IETF
ACM SIGMOBILE Mobile Computing and Communications Review
A distributed route-selection scheme for establishing real-time channels
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
Distributed Quality-of-Service Routing in High-Speed Networks Based on Selective Probing
LCN '98 Proceedings of the 23rd Annual IEEE Conference on Local Computer Networks
Multi-Path Routing combined with Resource Reservation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Multi-Constrained Distributed QoS Routing Algorithm
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Evaluating the Overheads of Source-Directed Quality-of-Service Routing
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Providing a guaranteed quality-of-service (QoS) is essential to many real-time applications. The existing distributed QoS routing algorithms are based on either shortest path or flooding and both tend to have high message overhead. A new distributed unicast QoS routing algorithm based on Fano's decoding method is studied. Fano's decoding method is a technique used in error control coding and it attempts to trace an optimal path probabilistically. The similarity of various aspects of Fano's decoding method to a QoS routing algorithm and the benefits it can provide encourages us to investigate the possibility of using it in QoS routing. This is the first known attempt to modify an error control technique using Fano's decoding method for the purpose of QoS routing in fixed wired networks. Simulation results demonstrate the effectiveness of the proposed algorithm in terms of message overhead and success ratio (% of paths obtained that satisfy lhe given QoS constraints). It is shown that the message overhead in the proposed algorithm is reduced compared to flooding based algorithms while maintaining a similar success ratio. Message overhead is also reduced compared to distance vector based algorithms for all but very sparsely connected networks, while success ratio is not compromised. Nodal storage is also considerably lower than for most other contemporary QoS routing algorithms.