Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Internet QoS: Architectures and Mechanisms for Quality of Service
Internet QoS: Architectures and Mechanisms for Quality of Service
On open shortest path first related network optimisation problems
Performance Evaluation
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
Inverse optimization in high-speed networks
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Internet Routing and Related Topology Issues
SIAM Journal on Discrete Mathematics
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study
MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
Meta-heuristic algorithms for optimized network flow wavelet-based image coding
Applied Soft Computing
| Hi-index | 0.00 |
Lately, it has been proposed to use shortest path first routing to implement Traffic Engineering in IP networks. The idea is to set the link weights so that the shortest paths, and the traffic thereof, follow the paths designated by the operator. Clearly, only certain shortest path representable path sets can be used in this setting, that is, paths which become shortest paths over some appropriately chosen positive, integer-valued link weights. Our main objective in this paper is to distill and unify the theory of shortest path representability under the umbrella of a novel flow-theoretic framework. In the first part of the paper, we introduce our framework and state a descriptive necessary and sufficient condition to characterize shortest path representable paths. Unfortunately, traditional methods to calculate the corresponding link weights usually produce a bunch of superfluous shortest paths, often leading to congestion along the unconsidered paths. Thus, the second part of the paper is devoted to reducing the number of paths in a representation to the bare minimum. To the best of our knowledge, this is the first time that an algorithm is proposed, which is not only able to find a minimal representation in polynomial time, but also assures link weight integrality. Moreover, we give a necessary and sufficient condition to the existence of a one-to-one mapping between a path set and its shortest path representation. However, as revealed by our simulation studies, this condition seems overly restrictive and instead, minimal representations prove much more beneficial