Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Analysis of shortest-path routing algorithms in a dynamic network environment
ACM SIGCOMM Computer Communication Review
Performance comparison of routing protocols under dynamic and static file transfer connections
ACM SIGCOMM Computer Communication Review
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Randomized distance-vector routing protocol
Proceedings of the 1999 ACM symposium on Applied computing
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
IEEE Transactions on Parallel and Distributed Systems
On the impact of alternate path routing for load balancing in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
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
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Alternate path routing for multicast
IEEE/ACM Transactions on Networking (TON)
An integrated platform for quality-of-service support in mobile multimedia clustered ad hoc networks
The handbook of ad hoc wireless networks
A Local Coefficient Based Load Sensitive Routing Protocol for Providing QoS
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
On the computational complexity and effectiveness of N-hub shortest-path routing
IEEE/ACM Transactions on Networking (TON)
Intra-Domain Delay-Based Quality of Service Using Differentiated Routing
MMNS '08 Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services
BGP rerouting solutions for transient routing failures and loops
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Enhancing DSR maintenance with power awareness
Computer Standards & Interfaces
| Hi-index | 0.00 |
Under heavy and dynamic traffic, the SPF routing algorithm often suffers from wild oscillation and severe congestion, and results in degradation of the network performance. In this paper, we present a new routing algorithm (SPF-EE) which attempts to eliminate the problems associated with the SPF algorithm by providing alternate paths as emergency exits. With the SPF-EE algorithm, traffic is routed along the shortest-paths under normal condition. However, in the presence of congestion and resource failures, the traffic can be dispersed temporarily to alternate paths without route re-computation. Simulation experiments show that the SPF-EE algorithm achieves grater throughput, higher responsiveness, better congestion control and fault tolerance, and substantially improves the performance of routing in a dynamic environment.