Performance analysis of multicast routing algorithms

Inicio | ¿Qué es? | Contacto

English | Català

Consultar RECERCAT

Por comunidades y
colecciones Por fecha Por autores Por títulos Por temas (CDU)

Consultar departamento

Por fecha Por autores Por títulos Por temas (CDU)

Estadisticas

Del documento Todo RECERCAT

Mi RECERCAT

Entrar Alertas por correo-e

Directorio de otros repositorios

RECERCAT Principal > Universitat Politècnica de Catalunya > Documents de recerca > Visualizar documento

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/24094

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.contributor	Universitat Politècnica de Catalunya. CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla
dc.contributor.author	Papadimitriou, Dimitri
dc.contributor.author	Careglio, Davide
dc.contributor.author	Demeester, Piet M.A.
dc.date	2014
dc.identifier.citation	Papadimitriou, D.; Careglio, D.; Demeester, P. Performance analysis of multicast routing algorithms. A: International Conference on Computing, Networking and Communications. "2014 International Conference on Computing, Networking and Communications (ICNC)". Honolulu, Hawaii: Institute of Electrical and Electronics Engineers (IEEE), 2014, p. 455-461.
dc.identifier.citation	978-1-4799-2358-8
dc.identifier.citation	10.1109/ICCNC.2014.6785378
dc.identifier.uri	http://hdl.handle.net/2117/24094
dc.language.iso	eng
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE)
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
dc.subject	Routing (Computer network management)
dc.subject	Telecommunication -- Traffic -- Management
dc.subject	Algorithm
dc.subject	Multicast
dc.subject	Performance
dc.subject	Routing
dc.subject	Encaminadors (Xarxes d'ordinadors)
dc.subject	Telecomunicació -- Tràfic -- Gestió
dc.title	Performance analysis of multicast routing algorithms
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	This paper provides a theoretical performance analysis of different classes of multicast routing algorithms, namely the Shortest Path Tree, the Steiner Tree, compact routing and greedy routing. Our motivation is to determine the routing scheme which would yield the best trade-off between the stretch of the multicast routing paths, the memory space required to store the routing information and routing table as well as the communication cost. For this purpose, we also confront these results to those obtained by simulation on the CAIDA map of the Internet topology comprising 32k nodes.

Mostrar el registro sencillo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Iterative research method applied to the design and evaluation of a dynamic multicast routing scheme

Papadimitriou, Dimitri; Coras, Florin-Tudorel; Rodríguez Natal, Alberto; Carela Español, Valentín; Careglio, Davide; Fàbrega, Lluís; Vila, Pere; Demeester, Piet M.A.

Measurement-based experimental research methodology

Papadimitriou, Dimitri; Fàbrega Soler, LLuís; Vilà Talleda, Pere; Careglio, Davide; Demeester, Piet M.A.

Routing at large scale: advances and challenges for complex networks

Sahhaf, Sahel; Tavernier, Wouter; Papadimitriou, Dimitri; Careglio, Davide; Kumar, Alok; Glacet, Christian; Coudert, David; Nisse, Nicolas; Fàbrega Soler, LLuís; Vila, Pere; Camelo, Miguel; Audenaert, Pieter; Colle, Didier; Demeester, Piet M.A.

AnyTraffic routing algorithm for label-based forwarding

Pedroso, Pedro; Pedrola Escribà, Òscar; Papadimitriou, Dimitri; Klinkowski, Miroslaw; Careglio, Davide

Dynamic compact multicast routing on power-law graphs

Pedroso, Pedro; Papadimitriou, Dimitri; Careglio, Davide

Accesibilidad | Aviso legal | Política de Cookies | Documentos de uso interno

Coordinación

Patrocinio