DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/14381

Arxiu Descripció MidaFormat
1569208047.pdfAnytraffic routing algorithm for label-based forwarding347,84 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Pedroso, P. [et al.]. "AnyTraffic routing algorithm for label-based forwarding". 2009.
Títol: AnyTraffic routing algorithm for label-based forwarding
Autor: Pedroso, Pedro; Pedrola Escribà, Òscar Veure Producció científica UPC; Papadimitriou, Dimitri; Careglio, Davide Veure Producció científica UPC; Klinkowski, Miroslaw Veure Producció científica UPC
Data: 11-jun-2009
Tipus de document: External research report
Citació: UPC-DAC-RR-2009-43
Resum: 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.
URI: http://hdl.handle.net/2117/14381
Versió de l'editor: http://gsi.ac.upc.edu/reports/2009/43/1569208047.pdf
Apareix a les col·leccions:Altres. Enviament des de DRAC
CBA - Sistemes de Comunicacions de Banda Ampla. Reports de recerca
Departament d'Arquitectura de Computadors. Reports de recerca
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius