Abstract
There has been considerable activity recently to develop monitoring and debugging tools for a multicast session (tree). With these tools in mind, we focus on the problem of how to lay out multicast sessions so as to cover a set of links of interest within a network. We define two variations of this layout (cover)problems that differ in what it means for a link to be covered. We then focus on the minimum cost problem, to determine the minimum cost set of trees that cover the links in question. We show that, with few exceptions, the minimum cost problems are NP-hard and that even finding an approximation within a certain factor is NP-hard. One exception is when the underlying network topology is a tree. For this case, we demonstrate an efficient algorithm that finds the optimal solution. We also present several computationally efficient heuristics and their evaluation through simulation. We find that two heuristics, a greedy heuristic that combines sets of trees with three or fewer receivers, and a heuristic based on our tree algorithm, both perform reasonably well. The remainder of the paper applies our techniques to the vBNS network and randomly generated networks, examining the effectiveness of the different heuristics.
This work is sponsored in part by the DARPA and Air Force Research Laboratory under agreement F30602-98-2-0238.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Adler, T. Bu, R. Sitaraman, D. Towsley. “Tree Layout for Internal Network Characterizations in Multicast Networks,” UMass CMPSCI Technical Report 00-44.
A. Adams, T. Bu, T. Friedman, J. Horowitz, D. Towsley, R. Caceres, N. Duffield, F. Lo Presti, S.B. Moon, V. Paxson. “The use of end-to-end multicast measurements for characterizing internal network behavior,” IEEE Communications Magazine, 38(5) 152–159,May 2000.
K. Almeroth, L. Wei, D. Farinacci. “Multicast Reachability Monitor (MRM)” IETF Internet Draft, Oct. 1999.
K. Almeroth. “The evolution of multicast,” IEEE Network, 14(1) 10–21, Jan. 2000.
R. Chalmers and K. Almeroth, “Modelingthe Branching Characteristics and Efficiency Gains of Global Multicast Trees”, IEEE Infocom 2001 Anchorage, Alaska, USA, April 2001.
V. Chvátal “A greedy heuristic for the set-covering problem” Mathematics of Operations Research, 4(3) 233–235, Aug. 1979.
M. Coates, R. Nowak. “Network loss inference using unicast end-to-end measurement”, Proc. ITC Conf. IP Traffic, Modeling and Management Sept. 2000.
S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C-G Liu, L. Wei, “The PIM Architecture for Wide-Area Multicast Routing,” IEEE/ACM Transactions on Networking, 4, 2, 153–162, April 1996.
C. Diot, B.N. Levine, B. Lyles, H. Kassem, D. Balensiefen. “Deployment issues for the IP multicast service and architecture,” IEEE Network, 14(1) 78–89, Jan. 2000.
N.G. Duffield, F. Lo Presti, V. Paxson, D. Towsley. “Inferring Link Loss Using triped Unicast Probes”, to appear in Proc. INFOCOM 2001.
V. Paxson, “End-to-End Routing Behavior in the Internet”. IEEE/ACM Transactions on Networking, Vol.5, No.5, pp. 601–615, October 1997.
T. Pusateri, “Distance Vector Multicast Routing Protocol”, Internet Draft, draft-ietf-idmr-dvmrp-v3-04.ps, Feb. 1997.
A. Reddy, R. Govindan, D. Estrin. “Fault isolation in multicast trees,” Proc. SIG-COMM 2000, Sept. 2000.
Y. Shavitt, X. Sun, A. Wool, B. Yener. “Computing the Unmeasured: An Algebraic Approach to Internet Mapping” to appear in Proc. INFOCOM 2001.
A. Srinivasan “Improved approximation of packingand coveringproblem” Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing 268–276, Las Vegas, Nevada, June 1995.
J. Walz, B.N. Levine. “A practical multicast monitoringscheme,” U. Massachusetts Computer cience Technical Report 30-2000, June 2000.
Ellen W. Zegura, Ken Calvert and S. Bhattacharjee “How to model an internetwork” Proceedings of IEEE Infocom’ 96, San Francisco, CA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adler, M., Bu, T., Sitaraman, R.K., Towsley, D. (2001). Tree Layout for Internal Network Characterizations in Multicast Networks. In: Crowcroft, J., Hofmann, M. (eds) Networked Group Communication. NGC 2001. Lecture Notes in Computer Science, vol 2233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45546-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-45546-9_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42824-4
Online ISBN: 978-3-540-45546-2
eBook Packages: Springer Book Archive