Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Approximating the single source unsplittable min-cost flow problem
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
QoS based routing algorithm in integrated services packet networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Efficient distributed restoration path selection for shared mesh restoration
IEEE/ACM Transactions on Networking (TON)
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Dynamic Routing of Restorable QoS Connections in MPLS Networks
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Building reliable MPLS networks using a path protection mechanism
IEEE Communications Magazine
Restorable dynamic quality of service routing
IEEE Communications Magazine
Lightpath restoration in WDM optical networks
IEEE Network: The Magazine of Global Internetworking
How Would Ants Implement an Intelligent Route Control System?
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Hi-index | 0.24 |
This paper investigates the problem of on-line routing of bandwidth guaranteed paths with end-to-end restoration. We first present the characteristic of bandwidth sharing on backup paths for varying degrees of network state information. We also propose a new Partial Information Scenario (PIS) in which the propagated state information is judiciously selected, such that the protocol overhead remains identical to that of the original PIS. Then, an iterative variant of two-step routing approach is used to compute link-disjoint active and backup paths. In order to implement this restorable routing, we consider a new class of weight function as the choice of cost metric. Generally, there are two schools of thought regarding the choice of link cost: resource conserving and load distributing. This paper suggests the use of both approaches for calculating active and backup link costs, to simultaneously achieve an economical usage of resources and efficient distribution of traffic load on the network. Comparing with the existing best-known algorithms, we show that our method outperforms the others with respect to the number of rejected requests as well as the total bandwidth consumption. Moreover, it has a much shorter running time, which makes it more attractive for on-line routing.