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 trade-offs 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 master- and 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Holopainen, V., Ilvesmäki, M.: A Parallel Architecture for IGP Weights Optimization. In: Proc. APNOMS (2007)
Singhal, N.K., Sahasrabuddhe, L.H., Mukherjee, B.: Provisioning of Survivable Multicast Sessions Against Single Link Failures in Optical WDM Mesh Networks. Journal of Lightwave Technology 21, 2587–2594 (2003)
Irava, V.S., Hauser, C.: Survivable Low-Cost Low-Delay Multicast Trees. In: Proc. GLOBECOM (2005)
Medard, M., Barry, R.A., Finn, S.G., Gallager, R.G.: Redundant trees for preplanned recovery in arbitrary vertex-redundant of edge-redundant graphs. IEEE/ACM Transactions on Networking 7, 641–652 (1999)
Balasubramanian, R., Ramasubramanian, S.: Minimizing Average Path Cost in Colored Trees for Disjoint Multipath Routing. In: Proc. ICCCN (2006)
Xue, G., Chen, L., Thulasiraman, K.: Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees. IEEE Journal on Selected Areas in Communications 21, 1332–1345 (2003)
Zhang, W., Xue, G., Tang, J., Thulasiraman, K.: Faster algorithms for construction of recovery trees enhancing QoP and QoS. IEEE/ACM Transactions on Networking 16, 642–655 (2008)
Frank, A.: Rooted k-connections in digraphs, Tech. Rep., Egervary Research Group on Combinatorial Optimization (2006)
Bejerano, Y., Koppol, P.: Optimal Construction of Redundant Multicast Trees in Directed Graphs. In: Proc. INFOCOM (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holopainen, V., Kantola, R. (2009). Tackling the Delay-Cost and Time-Cost Trade-Offs in Computation of Node-Protected Multicast Tree Pairs. In: Hong, C.S., Tonouchi, T., Ma, Y., Chao, CS. (eds) Management Enabling the Future Internet for Changing Business and New Computing Services. APNOMS 2009. Lecture Notes in Computer Science, vol 5787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04492-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-04492-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04491-5
Online ISBN: 978-3-642-04492-2
eBook Packages: Computer ScienceComputer Science (R0)