Data networks
Introduction to algorithms
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Quantitative Study of Differentiated Service Model Using UltraSAN
Quantitative Study of Differentiated Service Model Using UltraSAN
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Type-of-service routing in datagram delivery systems
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Edge-based traffic engineering for OSPF networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
Improving service differentiation in IP networks through dual topology routing
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Edge-based traffic engineering for OSPF networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant impact not only on the premium class traffic itself, but on all other classes of traffic as well. The shortest hop-count routing scheme, used in current Internet, turns out to be no longer sufficient in DiffServ networks. This paper studies the problem of finding optimal routes for the premium-class traffic in a DiffServ domain, such that (1) no forwarding loop exists in the entire network in the context of hop-by-hop routing; and (2) the residual bandwidth on bottleneck links is maximized. This problem is called the Optimal Premium-class Routing (OPR) problem. We prove in this paper that the OPR problem is NP-hard.To handle the OPR problem, first, we analyze the strength and weaknesses of two existing algorithms (Widest-Shortest-Path algorithm and Bandwidth-inversion Shortest-Path algorithm). Second, we propose a novel heuristic algorithm, called the Enhanced Bandwidth-inversion Shortest-Path (EBSP) algorithm. We prove theoretically the correctness of the EBSP algorithm, i.e., we show that it is consistent and loop-free. Our extensive simulations in different network environments show clearly that the EBSP algorithm performs better when routing the premium traffic in complex, heterogeneous networks.