Loading...
Loading...

Go to the content (press return)

AnyTraffic labeled routing

Author
Papadimitriou, D.; Pedroso, P.; Careglio, D.
Type of activity
Presentation of work at congresses
Name of edition
2010 IEEE International Conference on Communications
Date of publication
2010
Presentation's date
2010
Book of congress proceedings
2010 IEEE International Conference on Communications: ICC 2010: 23-27 May, 2010: Cape Town, South Africa
First page
1
Last page
6
Publisher
IEEE Computer Society Publications
DOI
https://doi.org/10.1109/ICC.2010.5501812 Open in new window
Repository
http://hdl.handle.net/2117/12829 Open in new window
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 f...
Citation
Papadimitriou, D.; Pedroso, P.; Careglio, D. AnyTraffic labeled routing. A: IEEE International Conference on Communication (ICC). "2010 IEEE International Conference on Communications". Cape Town: IEEE Computer Society Publications, 2010, p. 1-6.
Keywords
Bandwidth, Clustering algorithms, Heuristic algorithms, Multicast algorithms, Multicast protocols, Peer to peer computing, Streaming media, Unicast
Group of research
CBA - Communications and Broadband Architectures Lab

Participants

  • Papadimitriou, Dimitri  (author and speaker )
  • Pedroso Mendonça, Pedro  (author and speaker )
  • Careglio, Davide  (author and speaker )

Attachments