Take a look at the new version of this page: [ beta version ]. Tell us what you think.

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.

REFERENCES

• 1: T. C. Schmidt and M. Wählisch, "Multicast Mobility in MIPv6: Problem Statement and Brief Survey," MobOpts, IRTF Internet Draft, July 2007.
• 2: "Skitter Project at CAIDA," http://www.caida.org/tools/measurement/skitter.
• 3: Yuval Shavitt , Eran Shir, DIMES: let the internet measure itself, ACM SIGCOMM Computer Communication Review, v.35 n.5, October 2005 [doi>10.1145/1096536.1096546]
• 4: Damien Magoni , Jean-Jacques Pansiot, Internet Topology Modeler Based on Map Sampling, Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02), p.1021, July 01-04, 2002

INDEX TERMS

Keywords:
internet topology, measurement, multicast mobility management, shortest path trees