Show simple item record

dc.contributor.authorPapadimitriou, Dimitri
dc.contributor.authorPedroso, Pedro
dc.contributor.authorCareglio, Davide
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2011-12-30T12:07:50Z
dc.date.available2011-12-30T12:07:50Z
dc.date.created2009-09-25
dc.date.issued2009-09-25
dc.identifier.citationPapadimitriou, D.; Pedroso, P.; Careglio, D. "AnyTraffic labeled routing for static and dynamic traffic". 2009.
dc.identifier.urihttp://hdl.handle.net/2117/14382
dc.description.abstractThis paper investigates routing algorithms that compute paths along which combined unicast and multicast traffic can be forwarded altogether, i.e., over the same path. For this purpose, the concept of AnyTraffic group is introduced that defines a set of nodes capable to process both unicast and multicast traffic received from the same (AnyTraffic) tree. The resulting scheme is referred to as AnyTraffic routing. This paper defines a heuristic algorithm to accommodate the AnyTraffic group and to find the proper set of branch nodes of the tree. The algorithm supports dynamic changes of the leaf node set during multicast session lifetime by adapting the corresponding tree upon deterioration threshold detection. Studies are performed for both static and dynamic traffic scenarios to i) determine the dependencies of the algorithm (node degree, clustering coefficient and group size); and ii) evaluate its performance under dynamic conditions. Initial results show that the AnyTraffic algorithm can successfully handle dynamic requests while achieving considerable reduction of forwarding state consumption with small increase in bandwidth utilization compared to the Steiner Tree algorithm.
dc.format.extent6 p.
dc.language.isoeng
dc.relation.ispartofseriesUPC-DAC-RR-2009-53
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
dc.subject.lcshTelecommunication -- Traffic
dc.subject.otherRouting
dc.subject.otherAlgorithm
dc.subject.otherUnicast
dc.subject.otherMulticast
dc.subject.otherPerformance
dc.titleAnyTraffic labeled routing for static and dynamic traffic
dc.typeExternal research report
dc.subject.lemacTelecomunicació -- Tràfic
dc.contributor.groupUniversitat Politècnica de Catalunya. CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla
dc.relation.publisherversionhttp://gsi.ac.upc.edu/reports/2009/53/AnyTraffic_Labeled_Routing.pdf
dc.rights.accessOpen Access
drac.iddocument4434258
dc.description.versionPreprint
upcommons.citation.authorPapadimitriou, D.; Pedroso, P.; Careglio, D.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameAnyTraffic labeled routing for static and dynamic traffic


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain