Virtual path routing for survivable ATM networks
IEEE/ACM Transactions on Networking (TON)
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Application-aware deadlock-free oblivious routing
Proceedings of the 36th annual international symposium on Computer architecture
Static virtual channel allocation in oblivious routing
NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
| Hi-index | 0.00 |
In this paper we focus on the unsplittable flow problem (UFP): given a directed network with arc capacities and a set of connections (requests) defined by origin node, destination node and bandwidth requirement, find a subset of the connections of maximum total demand for which each connection uses only one path and the sum of demands crossing the arc does not exceed its capacity. The UFP can be applied in survivable connection-oriented network (e.g. MPLS) for assignment of backup paths of failed connections. Since the UFP is NP-complete, we propose two new effective heuristic algorithms for the UFP. We evaluate the performance of proposed schemes by making a comparison with their counterparts using various network topologies and demand patterns. Obtained results indicate that proposed heuristics provide substantial improvement comparing to existing methods.