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/14382

Arxiu Descripció MidaFormat
AnyTraffic_Labeled_Routing.pdfAnyTraffic labeled routing for static and dynamic traffic221,36 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Papadimitriou, D.; Pedroso, P.; Careglio, D. "AnyTraffic labeled routing for static and dynamic traffic". 2009.
Títol: AnyTraffic labeled routing for static and dynamic traffic
Autor: Papadimitriou, Dimitri; Pedroso, Pedro; Careglio, Davide Veure Producció científica UPC
Data: 25-set-2009
Tipus de document: External research report
Citació: UPC-DAC-RR-2009-53
Resum: This 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.
URI: http://hdl.handle.net/2117/14382
Versió de l'editor: http://gsi.ac.upc.edu/reports/2009/53/AnyTraffic_Labeled_Routing.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