AnyTraffic routing algorithm for label-based forwarding

The 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 th...

Descripción completa

Detalles Bibliográficos
Autores: Pedroso, Pedro, Pedrola Escribà, Òscar, Papadimitriou, Dimitri, Careglio, Davide|||0000-0002-7931-8147, Klinkowski, Miroslaw
Tipo de recurso: informe técnico
Fecha de publicación:2009
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/14381
Acceso en línea:https://hdl.handle.net/2117/14381
Access Level:acceso abierto
Palabra clave:Telecommunication -- Traffic
Telecomunicació -- Tràfic
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
id ES_2c2d7e9e2eae1d3e4a8659e918761837
oai_identifier_str oai:upcommons.upc.edu:2117/14381
network_acronym_str ES
network_name_str España
repository_id_str
spelling AnyTraffic routing algorithm for label-based forwardingPedroso, PedroPedrola Escribà, ÒscarPapadimitriou, DimitriCareglio, Davide|||0000-0002-7931-8147Klinkowski, MiroslawTelecommunication -- TrafficTelecomunicació -- TràficÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadorsThe 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.20092009-06-1120112011-12-30reporthttp://purl.org/coar/resource_type/c_93fcAOhttp://purl.org/coar/version/c_b1a7d7d4d402bcceinfo:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/14381reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/143812026-05-27T15:37:01Z
dc.title.none.fl_str_mv AnyTraffic routing algorithm for label-based forwarding
title AnyTraffic routing algorithm for label-based forwarding
spellingShingle AnyTraffic routing algorithm for label-based forwarding
Pedroso, Pedro
Telecommunication -- Traffic
Telecomunicació -- Tràfic
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
title_short AnyTraffic routing algorithm for label-based forwarding
title_full AnyTraffic routing algorithm for label-based forwarding
title_fullStr AnyTraffic routing algorithm for label-based forwarding
title_full_unstemmed AnyTraffic routing algorithm for label-based forwarding
title_sort AnyTraffic routing algorithm for label-based forwarding
dc.creator.none.fl_str_mv Pedroso, Pedro
Pedrola Escribà, Òscar
Papadimitriou, Dimitri
Careglio, Davide|||0000-0002-7931-8147
Klinkowski, Miroslaw
author Pedroso, Pedro
author_facet Pedroso, Pedro
Pedrola Escribà, Òscar
Papadimitriou, Dimitri
Careglio, Davide|||0000-0002-7931-8147
Klinkowski, Miroslaw
author_role author
author2 Pedrola Escribà, Òscar
Papadimitriou, Dimitri
Careglio, Davide|||0000-0002-7931-8147
Klinkowski, Miroslaw
author2_role author
author
author
author
dc.subject.none.fl_str_mv Telecommunication -- Traffic
Telecomunicació -- Tràfic
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
topic Telecommunication -- Traffic
Telecomunicació -- Tràfic
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
description The 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.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-06-11
2011
2011-12-30
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
AO
http://purl.org/coar/version/c_b1a7d7d4d402bcce
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/14381
url https://hdl.handle.net/2117/14381
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405210529497088
score 15,300719

Similares en LA Referencia