An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
ICNP '02 Proceedings of the 10th IEEE 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)
A framework for service-guaranteed shared protection in WDM mesh networks
IEEE Communications Magazine
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
A novel recursive shared segment protection algorithm in survivable WDM networks
Journal of Network and Computer Applications
Dynamic survivable algorithm for meshed WDM optical networks
Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved quasi-path restoration in mesh networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient distributed bandwidth management for MPLS fast reroute
IEEE/ACM Transactions on Networking (TON)
New insights on survivability in multi-domain optical networks
Information Sciences: an International Journal
Routing connections with differentiated reliability requirements in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Rule-based topology advertisement supporting generalized protection
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
Spare capacity reprovisioning for high availability shared backup path protection connections
Computer Communications
A survey of survivability in multi-domain optical networks
Computer Communications
Availability-aware multiple working-paths capacity provisioning in GMPLS networks
IPOM'07 Proceedings of the 7th IEEE international conference on IP operations and management
Near optimal routing and capacity management for PWCE-based survivable WDM networks
Photonic Network Communications
Local restoration with multiple spanning trees in metro ethernet networks
IEEE/ACM Transactions on Networking (TON)
Application-aware protection in DWDM optical networks
Photonic Network Communications
Dynamic path shared protection for survivable differentiated reliable WDM optical networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Priority-Enabled optimization of resource utilization in fault-tolerant optical transport networks
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Capacity efficient shared protection and fast restoration scheme in self-configured optical networks
SelfMan'06 Proceedings of the Second IEEE international conference on Self-Managed Networks, Systems, and Services
Efficient distributed solution for MPLS fast reroute
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Switching/merging node placement in survivable optical networks with SSP
Computer Communications
A novel multi-link fault-tolerant algorithm for survivability in multi-domain optical networks
Photonic Network Communications
An efficient critical protection scheme for intra-domain routing using link characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
This paper focuses on the problem of dynamic survivable routing for segment shared protection (SSP) in mesh communication networks provisioning bandwidth guaranteed tunnels. With SSP, a connection is settled by concatenating a series of protection domains, each of which contains a working and protection segment pair behaving as a self-healing unit for performing local restoration whenever the working segment is subject to any unexpected interruption. We first discuss the advantages of using SSP--the ability to shorten the restoration time as well as achieve a higher throughput by saving spare capacity required for 100% restorability; then the survivable routing problem is formulated into an Integer Linear Programming (ILP), where the switching/merging node pair of each protection domain along with the corresponding least-cost working and protection segment pair can be jointly determined for a dynamically arrived connection request. A novel approach of arc-reversal transformation is devised to deal with the situation that the working segments of two neighbor protection domains may overlap with each other by more than a single node. Due to a very high computation complexity induced in solving the ILP, a novel heuristic algorithm is proposed, named Cascaded Diverse Routing (CDR), to allocate protection domains for a connection request by performing diverse routing across a set of predefined candidate switching/merging node pairs. Experiments are conducted on five two-connected network topologies to verify the ILP and the CDR algorithm. We first determine the best diameter of protection domains for the CDR scheme in each network topology. Using the results of best diameters, CDR is compared with two reported schemes, namely PROMISE and OPDA. We demonstrate in the simulation results that the path-shared protection schemes are outperformed by the SSP schemes in terms of blocking probability under all possible arrangements in the experiment and that CDR yields better performance than PROMISE and OPDA due to the extra efforts in manipulating the location of working segments at the expense of longer computation time.