zbMATH — the first resource for mathematics

GMAC: an overlay multicast network for mobile agent platforms. (English) Zbl 1243.68039
Summary: The lack of proper support for multicast services in the Internet has hindered the widespread use of applications that rely on group communication services such as mobile software agents. Although they do not require high bandwidth or heavy traffic, these types of applications need to cooperate in a scalable, fair and decentralized way. This paper presents GMAC, an overlay network that implements all multicast related functionality – including membership management and packet forwarding – in the end systems. GMAC introduces a new approach for providing multicast services for mobile agent platforms in a decentralized way, where group members cooperate in a fair way, minimize the protocol overhead, thus achieving great scalability. Simulations comparing GMAC with other approaches, in aspects such as end-to-end group propagation delay, group latency, group bandwidth, protocol overhead, resource utilization and failure recovery, show that GMAC is a scalable and robust solution to provide multicast services in a decentralized way to mobile software agent platforms with requirements similar to MoviLog.
68M11 Internet topics
68M10 Network design and communication in computer systems
BRITE; Chord; GMAC; Pastry; SCRIBE
Full Text: DOI
[1] Amir, Y.; Danilov, C.: Reliable communication in overlay networks, , 511-520 (2003)
[2] Androutsellis-Theotokis, S.; Spinellis, D.: A survey of peer-to-peer content distribution technologies, ACM comput. Surv. 36, No. 4, 335-371 (2004)
[3] Banerjee, S.; Bhattacharjee, B.; Kommareddy, C.: Scalable application layer multicast, , 205-217 (2002)
[4] Castro, M.; Druschel, P.; Kermarrec, A. -M.; Rowstron, A. I. T.: Scribe: A large-scale and decentralized application-level multicast infrastructure, IEEE journal on selected areas in communications 20, No. 8, 1489-1499 (2002)
[5] Chawathe, Y.: Scattercast: an adaptable broadcast distribution framework, Multimedia systems 9, No. 1, 104-118 (2003)
[6] Y.-H. Chu, S.G. Rao, H. Zhang, A case for end system multicast, IEEE Journal on Selected Areas in Communication (JSAC), Networking Support for Multicast 20 (8) (special issue)
[7] Diot, C.; Levine, B. N.; Lyles, B.; Kassem, H.; Balensiefen, D.: Deployment issues for the IP multicast service and architecture, IEEE network 14, No. 1, 78-88 (2000)
[8] Eriksson, H.: MBONE: the multicast backbone, Communications of the ACM 37, No. 8, 54-60 (1994)
[9] B. Ford, P. Srisuresh, D. Kegel, Peer-to-peer communication across network address translators, in: USENIX Annual Technical Conference, General Track, USENIX, 2005, pp. 179–192
[10] Francis, P.: Is the Internet going NUTSS?, IEEE Internet computing 7, No. 6, 94-96 (2003)
[11] P. Francis, Yoid: Extending the internet multicast architecture, Tech. rep., AT&T Center for Internet Research at ICSI (ACIRI), 2000
[12] Fuggetta, A.; Picco, G. P.; Vigna, G.: Understanding code mobility, IEEE transactions on software engineering 24, No. 5, 362-375 (1998)
[13] Gkantsidis, C.; Mihail, M.; Saberi, A.: Random walks in peer-to-peer networks: algorithms and evaluation, P2P computing systems 63, 241-263 (2006)
[14] P. Gotthelf, M. Mendoza, A. Zunino, C. Mateos, GMAC: An overlay multicast network for mobile agents, in: Proc. of the VI Argentine Symposium on Computing Technology, AST 2005 - 34 JAIIO, 2005, pp. 20–24
[15] J. Jannotti, D.K. Gifford, K.L. Johnson, M.F. Kaashoek, J.W. O’Toole Jr., Overcast: reliable multicasting with an overlay network, in: Proceedings of the Fourth USENIX Symposium on Operating Systems Design and Implementation, OSDI 2000, USENIX Assoc, Berkeley, CA, USA, 2000, pp. 197–212
[16] Jin, S.; Bestavros, A.: Small-world Internet topologies: possible causes and implications on scalability of end-system multicast, Computer networks 50, No. 6, 648-666 (2006) · Zbl 1095.68513
[17] Kandula, S.; Lee, J. -K.; Hou, J. C.: LARK: A light-weight, resilient application-level multicast protocol, , 201-209 (2003)
[18] Lange, D. B.; Oshima, M.: Seven good reasons for mobile agents, Communications of the ACM 42, No. 3, 88-89 (1999)
[19] Liu, Xiao, Ni, Zhang, Location-aware topology matching in P2P systems, in: INFOCOM: The Conference on Computer Communications, in: Joint Conference of the IEEE Computer and Communications Societies, vol. 4, 2004, pp. 2220–2230
[20] Mateos, C.; Zunino, A.; Campo, M.: Extending movilog for supporting web services, Computer languages, systems structures 31, No. 1, 11-31 (2007) · Zbl 1103.68344
[21] Medina, A.; Lakhina, A.; Matta, I.; Byers, J.: Brite: an approach to universal topology generation, , 346 (2001)
[22] Medina, A.; Matta, I.; Byers, J.: On the origin of power laws in Internet topologies, SIGCOMM comput. Commun. rev. 30, No. 2, 18-28 (2000)
[23] Monson-Haefel, R.: Enterprise javabeans, (1999)
[24] D. Pendarakis, S. Shi, D. Verma, M. Waldvogel, ALMI: An application level multicast infrastructure, in: Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, USITS ’01, USENIX, San Francisco, CA, USA, 2001, pp. 49–60
[25] S. Ratnasamy, A scalable content-addressable network, Ph.D. Thesis, University of California at Berkeley, 2002
[26] Ratnasamy, S.; Handley, M.; Karp, R. M.; Shenker, S.: Topologically-aware overlay construction and server selection, Proceedings IEEE INFOCOM 2002 3, 1190-1199 (2002)
[27] S. Ren, L. Guo, S. Jiang, X. Zhang, Sat-match: A self-adaptive topology matching method to achieve low lookup latency in structured p2p overlay networks, ipdps 01 (2004) 83a
[28] Ripeanu, M.; Iamnitchi, A.; Foster, I.: Mapping the Gnutella network, IEEE Internet computing 6, No. 1, 50-57 (2002) · Zbl 1014.68937
[29] J. Rosenberg, J. Weinberger, C. Huitema, R. Mahy, STUN–Simple traversal of User Datagram Protocol (UDP) through Network Address Translators (NATs), Internet Engineering Task Force: RFC 3489, March 2003
[30] Rowstron, A.; Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems, Lecture notes in computer science 2218, 329-350 (2001) · Zbl 1051.68788 · link.springer.de
[31] , Lecture notes in computer science 3485 (2005)
[32] Stoica, I.; Morris, R.; Liben-Nowell, D.; Karger, D. R.; Kaashoek, M. F.; Dabek, F.; Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications, IEEE/ACM transactions on networking 11, No. 1, 17-32 (2003)
[33] Stoica, I.; Ng, T. S. E.; Zhang, H.: REUNITE: A recursive unicast approach to multicast, , 1644-1653 (2000)
[34] W. Wang, H. Chang, A. Zeitoun, S. Jamin, Characterizing guarded hosts in peer-to-peer file sharing systems, in: In Proceedings of IEEE Global Communications Conference, Global Internet and Next Generation Networks, 2004, pp. 1539–1543
[35] Zeinalipour-Yazti, D.; Kalogeraki, V.: Structuring topologically aware overlay networks using domain names, Computer networks 50, No. 16, 3064-3082 (2006) · Zbl 1102.68406 · doi:10.1016/j.comnet.2005.12.003
[36] Zhang, B.; Wang, W.; Jamin, S.; Massey, D.; Zhang, L.: Universal IP multicast delivery, Computer networks 50, No. 6, 781-806 (2006)
[37] Zhao, B. Y.; Huang, L.; Stribling, J.; Rhea, S. C.; Joseph, A. D.; Kubiatowicz, J. D.: Tapestry: A resilient global-scale overlay for service deployment, IEEE journal on selected areas in communications 22, No. 1, 41-53 (2004)
[38] Zhuang, S. Q.; Zhao, B. Y.; Joseph, A. D.; Katz, R. H.; Kubiatowicz, J. D.: Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination, , 11-20 (2001)
[39] Zunino, A.; Campo, M.; Mateos, C.: Simplifying mobile agent development through reactive mobility by failure, Lecture notes in computer science 2507, 163-174 (2002) · Zbl 1031.68614 · link.springer.de
[40] Zunino, A.; Mateos, C.; Campo, M.: Reactive mobility by failure: when fail means move, information systems frontiers, Special issue on mobile computing and communications 7, No. 2, 141-154 (2005)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.