Tree layout for internal network characterizations in multicast networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2233 LNCS, Issue , 2001, Pages 189-204

  Adler, Micah ^a   Bu, Tian ^a   Sitaraman, Ramesh K ^a   Towsley, Don ^a  

^a University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; MULTICASTING; PROGRAM DEBUGGING; ALGORITHMS; COSTS;

COMPUTATIONALLY EFFICIENT; DEBUGGING TOOLS; GREEDY HEURISTICS; INTERNAL NETWORK; MULTICAST NETWORK; MULTICAST SESSIONS; OPTIMAL SOLUTIONS; TREE ALGORITHMS;

TREES (MATHEMATICS);

EID: 23044529228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45546-9_14     Document Type: Conference Paper

References (19)

1. M. Adler, T. Bu, R. Sitaraman, D. Towsley. "Tree Layout for Internal Network Characterizations in Multicast Networks," UMass CMPSCI Technical Report 00-44.
2. 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 characterizingin ternal network behavior," IEEE Communications Magazine, 38(5)152-159, May 2000.
3. K. Almeroth, L.Wei, D. Farinacci. "Multicast ReachabilityMonitor (MRM)" IETF Internet Draft, Oct. 1999.
4. K. Almeroth. "The evolution of multicast," IEEE Network, 14(1)10-21, Jan. 2000.
5. R. Chalmers and K. Almeroth, "Modelingt he Branching Characteristics and Efficiency Gains of Global Multicast Trees", IEEE Infocom 2001 Anchorage, Alaska, USA, April 2001.
6. V. Chvátal "A greedy heuristic for the set-covering problem" Mathematics of Operations Research, 4(3)233-235, Aug. 1979.
7. M. Coates, R. Nowak. "Network loss inference usinguni cast end-to-end measurement", Proc. ITC Conf. IP Traffic, Modeling and Management, Sept. 2000.
8. 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.
9. 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.
10. N.G. Duffield, F. Lo Presti, V. Paxson, D. Towsley. "InferringLink Loss Using Striped Unicast Probes", to appear in Proc. INFOCOM 2001.
11. V. Paxson, "End-to-End RoutingB ehavior in the Internet". IEEE/ACM Transactions on Networking, Vol.5, No.5, pp. 601-615, October 1997.
12. T. Pusateri, "Distance Vector Multicast RoutingProt ocol", Internet Draft, draft-ietf-idmr-dvmrp-v3-04.ps, Feb. 1997.
13. A. Reddy, R. Govindan, D. Estrin. "Fault isolation in multicast trees," Proc. SIGCOMM 2000, Sept. 2000.
14. Y. Shavitt, X. Sun, A.Wool, B. Yener. "Computingthe Unmeasured: An Algebraic Approach to Internet Mapping" to appear in Proc. INFOCOM 2001.
15. A. Srinivasan "Improved approximation of packingan d covering problem " Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing 268-276, Las Vegas, Nevada, June 1995.
16. J.Walz, B.N. Levine. "A practical multicast monitorings cheme," U. Massachusetts Computer Science Technical Report 30-2000, June 2000.
17. Ellen W. Zegura, Ken Calvert and S. Bhattacharjee " How to model an internetwork" Proceedings of IEEE Infocom '96, San Francisco, CA.
18. http://www.vbns.net/netmaps/multicast.html.
19. http://www.abilene.iu.edu/images/ab-mcast.pdf.