Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Fiber Network Service Survivability
Fiber Network Service Survivability
IEEE Communications Magazine
Threshold based Selective Survivability for Optical WDM Mesh Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Techniques for available bandwidth measurement in IP networks: a performance comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survivable virtual concatenation for data over SONET/SDH in optical transport networks
IEEE/ACM Transactions on Networking (TON)
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reliability as an interdomain service
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Fast and efficient routing algorithms for delay-bounded and dependable channels
Computer Communications
IEEE/ACM Transactions on Networking (TON)
Intelligent shared-segment protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
IEEE/ACM Transactions on Networking (TON)
Rerouting in advance for preempted IR calls in QoS-enabled networks
Computer Communications
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
Computers and Operations Research
PLR-based heuristic for backup path computation in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An open source traffic engineering toolbox
Computer Communications
Techniques for available bandwidth measurement in IP networks: A performance comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking
An on-line routing algorithm of locally protected paths with exact reservations
CSN '07 Proceedings of the Sixth IASTED International Conference on Communication Systems and Networks
A novel distributed resilience matrix for arbitrary failures in spare capacity allocation problem
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Priority-based allocation of network resources in multi-class MPLS networks
Proceedings of the 7th International Conference on Frontiers of Information Technology
R3: resilient routing reconfiguration
Proceedings of the ACM SIGCOMM 2010 conference
EA'09 Proceedings of the 9th international conference on Artificial evolution
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Restoration of virtual private networks with qos guarantees in the pipe model
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
An efficient backup path selection algorithm in MPLS networks
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Fast restoring gigabit wireless networks using a directional mesh architecture
Computer Communications
Achieving high robustness and performance in QoS-aware route planning for IPTV networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper presents new algorithms for dynamic routing of restorable bandwidth-guaranteed paths. We assume that connection requests one-by-one and have to be routed with no a priori knowledge of future arrivals. In order to guarantee restorability, in addition to determining an active path to route each request, an alternate link (node) disjoint backup (restoration) path has to be determined for the request at the time of connection initiation. This joint on-line routing problem is becoming particularly important in optical networks and in multiprotocol label switching (MPLS)-based networks due to the trend in backbone networks toward dynamic provisioning of bandwidth-guaranteed or wavelength paths. A straightforward solution for the restoration problem is to find two disjoint paths. However, this results in excessive resource usage. Given a restoration objective, such as protection against single-link failures, backup path bandwidth usage can be reduced by judicious sharing of backup paths amongst certain active paths while still maintaining restorability. The best sharing performance is achieved if the routing of every path in progress in the network is known to the routing algorithm at the time of a new path setup. We give an integer programming formulation for this problem which is new. Complete path routing knowledge is a reasonable assumption for a centralized routing algorithm. However, it is not often desirable, particularly when distributed routing is preferred. We show that an aggregate information scenario which uses only aggregated and not per-path information provides sufficient information for a suitably developed algorithm to be able to perform almost as well as the complete information scenario. Disseminating this aggregate information is feasible using proposed traffic engineering extensions to routing protocols. We formulate the dynamic restorable bandwidth routing problem in this aggregate information scenario and develop efficient routing algorithms. We show that the performance of our aggregate information-based algorithm is close to the complete information bound.