DC FieldValueLanguage
dc.contributor.authorWählisch, Matthias-
dc.contributor.authorSchmidt, Thomas C.-
dc.date.accessioned2020-08-26T09:16:12Z-
dc.date.available2020-08-26T09:16:12Z-
dc.date.issued2007-
dc.identifier.citationArticle number: 64en_US
dc.identifier.isbn978-1-59593-770-4en_US
dc.identifier.urihttp://hdl.handle.net/20.500.12738/1138-
dc.description.abstractProtocol 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.en
dc.language.isoenen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.subjectMulticast mobility managementen_US
dc.subjectInternet topologyen_US
dc.subjectmeasurementen_US
dc.subjectshortest path treesen_US
dc.subject.ddc004: Informatiken_US
dc.titleExploring the routing complexity of mobile multicast : a semi-empirical studyen
dc.typeinProceedingsen_US
dc.relation.conferenceInternational Conference On Emerging Networking Experiments And Technologies 2007en_US
local.contributorCorporate.otherAssociation for Computing Machinery-
local.contributorCorporate.otherACM Special Interest Group on Data Communication-
tuhh.container.endpage2en_US
tuhh.container.startpage1en_US
tuhh.oai.showtrueen_US
tuhh.publication.instituteDepartment Informatiken_US
tuhh.publication.instituteFakultät Technik und Informatiken_US
tuhh.publisher.doi10.1145/1364654.1364727-
tuhh.relation.ispartofseriesProceedings of the 2007 ACM CoNEXT conferenceen_US
tuhh.type.opusInProceedings (Aufsatz / Paper einer Konferenz etc.)-
dc.type.casraiConference Paper-
dc.type.dinicontributionToPeriodical-
dc.type.drivercontributionToPeriodical-
dc.type.statusinfo:eu-repo/semantics/publishedVersionen_US
dcterms.DCMITypeText-
item.creatorGNDWählisch, Matthias-
item.creatorGNDSchmidt, Thomas C.-
item.fulltextNo Fulltext-
item.creatorOrcidWählisch, Matthias-
item.creatorOrcidSchmidt, Thomas C.-
item.seriesrefProceedings of the 2007 ACM CoNEXT conference-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.tuhhseriesidProceedings of the 2007 ACM CoNEXT conference-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_5794-
item.openairetypeinProceedings-
crisitem.author.deptDepartment Informatik-
crisitem.author.orcid0000-0002-0956-7885-
crisitem.author.parentorgFakultät Technik und Informatik-
Appears in Collections:Publications without full text
Show simple item record

Page view(s)

102
checked on Dec 26, 2024

Google ScholarTM

Check

HAW Katalog

Check

Add Files to Item

Note about this record


Items in REPOSIT are protected by copyright, with all rights reserved, unless otherwise indicated.