Exploring the routing complexity of mobile multicast : a semi-empirical study

Wählisch, Matthias; Schmidt, Thomas C.

doi:10.1145/1364654.1364727

Publisher DOI:	10.1145/1364654.1364727
Title:	Exploring the routing complexity of mobile multicast : a semi-empirical study
Language:	English
Authors:	Wählisch, Matthias Schmidt, Thomas C.
metadata.local.contributorCorporate.other:	Association for Computing Machinery ACM Special Interest Group on Data Communication
Keywords:	Multicast mobility management; Internet topology; measurement; shortest path trees
Issue Date:	2007
Publisher:	Association for Computing Machinery (ACM)
Source:	Article number: 64
Part of Series:	Proceedings of the 2007 ACM CoNEXT conference
Startpage:	1
Endpage:	2
Conference:	International Conference On Emerging Networking Experiments And Technologies 2007
Abstract:	Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its distribution trees to moving listeners or senders, needs to newly established forwarding states. In this paper we quantize the number of states minimally required for servicing listener or sender mobility. Independent of the actual routing protocol in use, these results serve as an inherent measure of complexity for multicast mobility management. Results are based on current Internet measurements and a topological analysis from network simulations. They show a surprisingly low mobility overhead as compared to general multicast forwarding state management.
URI:	http://hdl.handle.net/20.500.12738/1138
ISBN:	978-1-59593-770-4
Institute:	Department Informatik Fakultät Technik und Informatik
Type:	Chapter/Article (Proceedings)
Appears in Collections:	Publications without full text