SIAM Journal on Computing
Internet QoS Routing Using the Bellman-Ford Algorithm
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
A QoS Network Management System for Robust and Reliable Multimedia Services
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
QoS aware path protection schemes for MPLS networks
ICCC '02 Proceedings of the 15th international conference on Computer communication
Empirical study of traffic trunking in Linux-based MPLS test-bed
International Journal of Network Management
Improving the efficiency of multipath traffic via opportunistic traffic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing framework for FTIMA: a fault tolerance infrastructure for mobile agents
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Fault tolerance in networks with an advance reservation service
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues
INFORMS Journal on Computing
On the prevalence and characteristics of MPLS deployments in the open internet
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Practical QoS network system with fault tolerance
Computer Communications
| Hi-index | 0.00 |
The paper presents approaches for fault tolerance and load balancing in QoS provisioning using multiple alternate paths. The proposed multiple QoS path computation algorithm searches for maximally disjoint (i.e., minimally overlapped) multiple paths such that the impact of link/node failures becomes significantly reduced, and the use of multiple paths renders QoS services more robust in unreliable network conditions. The algorithm is not limited to finding fully disjoint paths. It also exploits partially disjoint paths by carefully selecting and retaining common links in order to produce more options. Moreover, it offers the benefits of load balancing in normal operating conditions by deploying appropriate call allocation methods according to traffic characteristics. In all cases, all the computed paths must satisfy given multiple QoS constraints. Simulation experiments with IP Telephony service illustrate the fault tolerance and load balancing features of the proposed scheme.