Document Type : Review Article

Authors

Abstract

The application Layer Multicast (ALM) is an alternative and deployable approach to IP multicasting. Topology awareness link stress and delay stretch considerably, therefore it is a very important metric for ALM. This work describes a novel, highly stable and low overhead ALM approach using a binning technique to cluster nearby receivers, referred to as Bincast. Bincast uses a constant number of landmarks to cluster nearby nodes. Then, it constructs a k-ary tree between cluster members. The most stable node is selected as the head of each cluster. Cluster heads are connected to the source through a higher level tree. Detailed performance evaluation revealed that Bincast has a lower delay stretch than similar methods with approximately the same stress. Besides, it is more stable due to the selection of stable nodes as cluster heads.

Keywords

[1] Y. H. Chu, S. G. Rao, H. Zhang; “A Case for
End System Multicast”, In Proceeding of
ACM SIGMETRICS, June 2000.
[2] S .Banerjee, B. Bhattachariee, C.Kommaredy;
“Scalable Application Layer Multicast”, In
Proceeding of ACM Sigcomm, August 2002.
[3] B. Zhang, S. Jamin, L. Zhang; “Host
Multicast:A Framwork for Delivering
Multicast to End User”, Proc of IEEE
INFOCOM'02, June 2002.
[4] P. Francis, “Yoid:_Extending the Internet
Multicast Architecture”, ACIRI April,2002.
[5] S. Savage, A. Collins, E. Ho_man, J. Snell, T.
Anderson; “The End-to-End Effects of
Internet Path Selection”, SIGCOMM
Computer Communication Review, Vol. 29,
No. 4, pp. 289–299, 1999.
[6] M. Castro, P. Druschel, A-m. Kermarree, A.
Rowstron, “SCRIBE: A Large Scale and
Decentralized Application Level Multicast
Infrastructure”, IEEE Journal on Selected
Areas in communications (JSAC), Vol. 20,
No.8. 2002, pp. 1489-1499.
[7] M. kwon, S. Fahmy; “Topology-Aware
Overlay Network for Group
Communication”, Miami Florida USA,
NOSSDAV'02 May 12-13, 2002.
[8] C. Kommareddy, N. Shankar, B.
Bhattacharjee, “Finding Close Friends on
the Internet”, ICNP, November 2001.
[9] S. Horng, L. Chun, C. Yang, H-L Hsu, “A
DNS-aided Application Layer Multicast
Protocol”, LAENG international Conference
on Communication System and Application
IMECS , Hong Kong, Vol. 2, March, 2008 pp.
1076-1082.
[10] B. Y. Zhao, J. Kubiatowicz, A. D. Joseph;
“Tapestry:An Infrastructure for Fault-
Tolerant Wide-area Location and
Routing”, Tech. Rep. UCB/CSD-01-1141,
University of California at Berkeley,
Computer Science Division, April 2001.
[11] A. Rowstron, P. Druschel; “Pastry:Scalable,
Distributed Object Location and Routing
for Large-Scale Peer-to-Peer Systems”, In
IFIP ACM International Conference on
Distributed System Platform (Middleware),
November 2001.
[12] S. Ratnasamy, M. Handly, R. Karp, S.
Shenker; “Topologically-Aware Overlay
Construction and Server Selection”, In
Proceedings of INFOCOM, June 2002.
[13] B. Y. Zhao, Y. Duan, L. Huang, A. Joseph,
and J. Kubiatowicz; “Brocade: Landmark
Routing on Overlay Networks”, in 1st
International Workshop on Peer-to-Peer
Systems (IPTPS’02), 2002
[14] Z. Xu, M. Mahalingam, M. Karlsson;
“Turning Heterogeneity into an Advantage
in Overlay Routing”, IEEE INFOCOM, Vol.
2, pp. 1499-1509, San Francisco, CA, 2003.
[15] C. Wu1, D. Liu and R. Hwang; “A Location-
Aware Peer-to-Peer Overlay Network”, Int.
J. Communication Systems, No. 20, pp.83–
102, 2007;
[16] K. Yusung, C. Kilnam; “Scalable and
Topologically-Aware Application Layer
Multicast”, IEEE GLOBECOM, Vol. 2,
pp.1266 – 1270, 2004.
[17] S. Banerjee, B. Bhattacharjee; “Comparative
Study of Application Multicast Protocols”,
Available from:http://www.cs.umd.edu
/users/suman/pubs/compare.ps
[18] K. Calvert, E. Zegura, S. Bhattacharjee; How
to Model an Internetwork, In Proceeding of
IEEE Infocom, 1996.
[19] S. Banerjee, myns Simulator, Available from:
http://www.cs.umd.edu/~suman/research/myn
s/index.html.