Tackling the delay-cost and time-cost trade-offs in computation of node-protected multicast tree pairs

Authors:
Visa Holopainen;Raimo Kantola
Affiliations:
TKK Helsinki University of Technology, Department of Communications and Networking, TKK, Finland;TKK Helsinki University of Technology, Department of Communications and Networking, TKK, Finland
Venue:
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
Year:
2009

Citing 4
Cited 1

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Faster algorithms for construction of recovery trees enhancing QoP and QoS

IEEE/ACM Transactions on Networking (TON)
A Parallel Architecture for IGP Weights Optimization

APNOMS '07 Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees

IEEE Journal on Selected Areas in Communications

Reliable collective communications with weighted SRLGs in optical networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

While there are many algorithms for finding a node-protected pair of multicast trees in a graph, all of the existing algorithms suffer from two flaws: Firstly, existing algorithms either have a long running time or produce high-cost tree pairs (Time-Cost Trade-Off). Secondly, existing algorithms aim to produce a low-cost tree pair, but do not take delay constraints into account (Delay-Cost Trade-Off). We tackle these tradeoffs by introducing an iterative algorithm, which finds a low-delay tree pair very quickly and then iteratively seeks lower-cost pairs. We present a sequential version of our algorithm; as well as an architecture for implementing it in a computing cluster, along with the corresponding masterand slave-algorithms. It turns out that the success percentage of our algorithm drops as the average node degree decreases, and as the share of multicast destination nodes increases. Fortunately, in these cases performance of the existing algorithms improves, which means that our algorithm complements the existing algorithms. Two additional benefits or our algorithm are: (1) it can be used in multi-homing scenarios with almost no modifications, and (2) it can be used in both directed and undirected graphs.