AnyTraffic Labeled Routing
Gespeichert in:
| Titel: | AnyTraffic Labeled Routing |
|---|---|
| Autoren: | Papadimitriou, Dimitri, Pedroso, Pedro, Careglio, Davide |
| Weitere Verfasser: | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors, Universitat Politècnica de Catalunya. CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla |
| Quelle: | Recercat. Dipósit de la Recerca de Catalunya instname UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) |
| Verlagsinformationen: | IEEE, 2010. |
| Publikationsjahr: | 2010 |
| Schlagwörter: | Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors [Àrees temàtiques de la UPC], Routing protocols (Computer network protocols), Clustering algorithms, 0211 other engineering and technologies, Unicast, Telecommunication -- Traffic, Peer to peer computing, 02 engineering and technology, Multicast algorithms, Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors, Multicast protocols, Bandwidth, Streaming media, Telecomunicació -- Tràfic, 0202 electrical engineering, electronic engineering, information engineering, Heuristic algorithms |
| Beschreibung: | 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. |
| Publikationsart: | Article Conference object |
| Dateibeschreibung: | application/pdf |
| DOI: | 10.1109/icc.2010.5501812 |
| Zugangs-URL: | https://upcommons.upc.edu/bitstream/2117/12829/1/Papadimitriou.pdf http://hdl.handle.net/2117/12829 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005501812 http://dblp.uni-trier.de/db/conf/icc/icc2010.html#PapadimitriouPC10 https://upcommons.upc.edu/handle/2117/12829 http://ieeexplore.ieee.org/document/5501812/ https://dblp.uni-trier.de/db/conf/icc/icc2010.html#PapadimitriouPC10 https://upcommons.upc.edu/bitstream/2117/12829/1/Papadimitriou.pdf |
| Dokumentencode: | edsair.doi.dedup.....afff91d336afbbad8d0473b8b0c6f197 |
| Datenbank: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstract: | 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. |
|---|---|
| DOI: | 10.1109/icc.2010.5501812 |