|
Título:
|
AnyTraffic routing algorithm for label-based forwarding
|
|
Autor/a:
|
Pedroso, Pedro; Pedrola Escribà, Òscar; Papadimitriou, Dimitri; Klinkowski, Miroslaw; Careglio, Davide
|
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors; Universitat Politècnica de Catalunya. CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla |
|
Abstract:
|
The high capacity provided by packet-switched
networks is supporting the proliferation of bandwidth intensive multimedia applications which require multicasting capability. As
a consequence on today’s networks, unicast and multicast traffic compete for shared resources where a router must maintain both
unicast and multicast forwarding states. Pursuing a forwarding state reduction, in this paper we introduce the novel concept
of AnyTraffic data group which consists of a group of nodes receiving both unicast and multicast traffic over the same single
minimum-cost network entity. A novel 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 performed to validate
the proposed algorithm. |
|
Materia(s):
|
-Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors::Trànsit de dades
-Packet switching (Data transmission)
-Routing (Computer network management)
-Telecommunication network routing
-Commutació de paquets (Transmissió de dades)
-Encaminadors (Xarxes d'ordinadors) |
|
Derechos:
|
|
|
Tipo de documento:
|
Artículo - Versión publicada
Objeto de conferencia |
|
Editor:
|
IEEE Press and Wiley
|
|
Compartir:
|
|
