Disjoint multipath routing using colored trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Linear time distributed construction of colored trees for disjoint multipath routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Faster algorithms for construction of recovery trees enhancing QoP and QoS
IEEE/ACM Transactions on Networking (TON)
Maintaining colored trees for disjoint multipath routing under node failures
IEEE/ACM Transactions on Networking (TON)
Probing multiple node-disjoint paths using multi-labelled tree traversing
International Journal of Autonomous and Adaptive Communications Systems
Heuristic algorithms for designing self-repairing protection trees in mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Comparative Study of Multicast Protection Algorithms Using Shared Links in 100GET Transport Network
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
ILP-based design of survivable broadcast trees
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Fast recovery from dual-link or single-node failures in IP networks using tunneling
IEEE/ACM Transactions on Networking (TON)
An Interdisciplinary Perspective on IT Services Management and Service Science
Journal of Management Information Systems
Distributed linear time construction of colored trees for disjoint multipath routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Independent directed acyclic graphs for resilient multipath routing
IEEE/ACM Transactions on Networking (TON)
Reliable collective communications with weighted SRLGs in optical networks
IEEE/ACM Transactions on Networking (TON)
On identifying additive link metrics using linearly independent cycles and paths
IEEE/ACM Transactions on Networking (TON)
Differentiated quality-of-protection in survivable WDM mesh networks using p-structures
Computer Communications
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.07 |
We study quality-of-service (QoS) and quality-of-protection (QoP) issues in redundant tree based preplanned recovery schemes for a single-link failure in two-edge connected graphs and for a single-node failure in two-connected graphs. We present schemes (to be called G-MFBG schemes) that generalize the schemes (to be called MFBG schemes) developed by Me´dard et al. (1997) to construct a pair of redundant trees, called red and blue trees, which guarantees fast recovery from any single-link/node failure, as long as the failed node is not the root node. Using the G-MFBG schemes, we study QoS issues relating to red/blue trees. We present effective heuristics for computing a pair of redundant trees with low average delay or small total cost. We develop an optimal algorithm for computing a pair of red/blue trees with maximum bandwidth. Furthermore, a pair of red/blue trees guarantees fast recovery from simultaneous multiple failures if it satisfies certain properties. This leads us to define the concept of QoP of a pair of red/blue trees. We present an effective heuristic to construct a pair of red/blue trees with high QoP. The paper concludes with a discussion of computational results that demonstrate the effectiveness of the different algorithms presented.