Show simple item record

dc.contributor.authorPedroso, Pedro
dc.contributor.authorPedrola Escribà, Òscar
dc.contributor.authorPapadimitriou, Dimitri
dc.contributor.authorCareglio, Davide
dc.contributor.authorKlinkowski, Miroslaw
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2011-12-30T11:54:39Z
dc.date.available2011-12-30T11:54:39Z
dc.date.created2009-06-11
dc.date.issued2009-06-11
dc.identifier.citationPedroso, P. [et al.]. "AnyTraffic routing algorithm for label-based forwarding". 2009.
dc.identifier.urihttp://hdl.handle.net/2117/14381
dc.description.abstractThe high capacity provided by packet-switched networks is supporting the proliferation of bandwidth intensive multimedia applications which require multicasting capability. As a consequence a mixed traffic scenario where both unicast and multicast demands compete for the same shared resources, is the one more likely to be found within the current transport networks. On today’s traffic-engineered networks such traffic travels through logical data paths setting up by constrained-based routing schemes provided by a control plane. In this paper we have devised a novel constraint-based routing scheme to forward unicast and multicast traffic envisioning a system resource consumption outstanding performance. We introduce the concept of AnyTraffic data group which consists of a group of egress nodes receiving unicast and multicast traffic over the same single minimum-cost tree. A novel Steiner tree-based heuristic algorithm is specifically defined to accommodate such data group and has been compared with the standard shortest path (SP) algorithm - the optimal case for unicast routing - and a classical Steiner tree (ST) heuristic algorithm - the optimal case for multicast routing. Exhaustive experiments have been done to validate the results.
dc.format.extent8 p.
dc.language.isoeng
dc.relation.ispartofseriesUPC-DAC-RR-2009-43
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.titleAnyTraffic routing algorithm for label-based forwarding
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/43/1569208047.pdf
dc.rights.accessOpen Access
drac.iddocument4434249
dc.description.versionPreprint
upcommons.citation.authorPedroso, P.; Pedrola, O.; Papadimitriou, D.; Careglio, D.; Klinkowski, M.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameAnyTraffic routing algorithm for label-based forwarding


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