Shortest path first with emergency exits
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Sensitivity analysis via likelihood ratios
WSC '86 Proceedings of the 18th conference on Winter simulation
Scalable Link-State Internet Routing
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Distributed, scalable routing based on vectors of link states
IEEE Journal on Selected Areas in Communications
Dynamic multi-path routing: asymptotic approximation and simulations
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Flow-oriented protocols for scalable wireless networks
MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Stabilization of general loop-free routing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Stabilization of Routing in Directed Networks
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Stability and Scalability Issues in Hop-by-Hop Class-Based Routing
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Load-Balanced Anycast Routing in Computer Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A new approach to on-demand loop-free routing in ad hoc networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
BANANAS: an evolutionary framework for explicit and multipath routing in the internet
FDNA '03 Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Using labeled paths for loop-free on-demand routing in ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A global stability result for primal-dual congestion control algorithms with routing
ACM SIGCOMM Computer Communication Review
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Transactions on Mobile Computing
A new approach to on-demand loop-free routing in networks using sequence numbers
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Nature-inspired applications and systems
Improving the efficiency of multipath traffic via opportunistic traffic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hello again: Stabilization of the Hello protocol in OSPF
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
EURASIP Journal on Wireless Communications and Networking
On the computational complexity and effectiveness of N-hub shortest-path routing
IEEE/ACM Transactions on Networking (TON)
A resequencing model for high-speed packet-switching networks
Computer Communications
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Distributed path computation without transient loops: an intermediate variables approach
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Delay minimization in multipath routing
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Always acyclic distributed path computation
IEEE/ACM Transactions on Networking (TON)
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
A TDM slot allocation flow based on multipath routing in NoCs
Microprocessors & Microsystems
Multi-service routing: a routing proposal for the next generation internet
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Parameter evolution for quality of service in multimedia networking
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Hi-index | 0.01 |
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, single-path routing exhibits oscillatory behavior and becomes unstable as traffic loads increase. On the other hand, minimum-delay routing approaches can minimize delays only when traffic is stationary or very slowly changing.We present a "near-optimal" routing framework that offers delays comparable to those of optimal routing and that is as flexible and responsive as single-path routing protocols proposed to date. First, an approximation to the Gallager's minimum-delay routing problem is derived, and then algorithms that implement the approximation scheme are presented and verified. We introduce the first routing algorithm based on link-state information that provides multiple paths of unequal cost to each destination that are loop-free at every instant. We show through simulations that the delays obtained in our framework are comparable to those obtained using the Gallager's minimum-delay routing. Also, we show that our framework renders far smaller delays and makes better use of resources than traditional single-path routing.