Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Partial Path Protection for WDM Networks: End-to-End Recovery Using Local Failure Information
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Optimal design of survivable mesh networks based on line switched WDM self-healing rings
IEEE/ACM Transactions on Networking (TON)
Routing bandwidth-guaranteed paths with restoration in label-switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reliability constrained routing in QoS networks
IEEE/ACM Transactions on Networking (TON)
On Partial Protection in Groomed Optical WDM Mesh Networks
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Survivable virtual concatenation for data over SONET/SDH in optical transport networks
IEEE/ACM Transactions on Networking (TON)
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
A new path protection algorithm for meshed survivable wavelength-division-multiplexing networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
A highly efficient path-restoration protocol for management of optical network transport integrity
IEEE Journal on Selected Areas in Communications
Differentiated quality-of-protection in survivable WDM mesh networks using p-structures
Computer Communications
| Hi-index | 0.00 |
We study the problem of reliably provisioning traffic using multipath routing in a mesh network. Traditional approaches handled reliability requirements using full-protection schemes. Although full-protection approaches offer high assurance, this assurance can be costly. We take a less expensive approach to maintain reliability by offering partial-protection. Specifically, our approach guarantees part of the requested bandwidth, rather than the full amount, in the event of a link failure. We first show that the amount of partial-protection that can be guaranteed is limited by the topology of the network and the bandwidth requirement of a connection request. We then propose an effective multipath algorithm that attempts to provision bandwidth requests while guaranteeing the maximum partial-protection possible. Results show that by effectively selecting paths that limit edge overuse, our algorithm achieves very low bandwidth blocking probability. Our algorithm also serves significantly more requested bandwidth than the protection approach.