An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
On-line routing for permanent virtual circuits
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
IEEE Journal on Selected Areas in Communications
A link weight assignment algorithm for traffic-engineered networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Computers
Design and implementation of a scalable constraint-based routing module for QoS path computation
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
DeSiNe: a flow-level QoS simulator of networks
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Research challenges in QoS routing
Computer Communications
Autonomic interference avoidance with extended shortest path algorithm
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
On-line algorithms are essential for service providers to quickly set up bandwidth-guaranteed paths in their backbone or transport networks. A minimum-interference routing algorithm uses the information regarding the ingress-egress node pairs for selecting a path in the case of on-line connection requests. According to the notion of minimum interference, the path selected should have a minimum interference with paths considered to be critical for satisfying future requests. Here we introduce a new class of minimum-interference routing algorithms, called "simple minimum-interference routing algorithms" (SMIRA), that employ an efficient procedure. These algorithms use static network information comprising the topology and the information about ingress-egress node pairs, as well as the link residual bandwidth. Two typical algorithms belonging to this class are introduced, and their performance is evaluated by means of simulation. The numerical results obtained illustrate their efficiency, expressed in terms of throughput, and fairness.