Mostra el registre d'ítem simple
AnyTraffic routing algorithm for label-based forwarding
dc.contributor.author | Pedroso, Pedro |
dc.contributor.author | Pedrola Escribà, Òscar |
dc.contributor.author | Papadimitriou, Dimitri |
dc.contributor.author | Klinkowski, Miroslaw |
dc.contributor.author | Careglio, Davide |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.date.accessioned | 2010-12-28T10:30:56Z |
dc.date.available | 2010-12-28T10:30:56Z |
dc.date.created | 2009-11-30 |
dc.date.issued | 2009-11-30 |
dc.identifier.citation | Pedroso, P. [et al.]. AnyTraffic routing algorithm for label-based forwarding. A: IEEE Global Communications Conference. "2009 IEEE Global Communications Conference". Honolulu: IEEE Press and Wiley, 2009, p. 1-8. |
dc.identifier.isbn | 978-1-4244-4148-8 |
dc.identifier.uri | http://hdl.handle.net/2117/10775 |
dc.description.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. |
dc.format.extent | 8 p. |
dc.language.iso | eng |
dc.publisher | IEEE Press and Wiley |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors::Trànsit de dades |
dc.subject.lcsh | Packet switching (Data transmission) |
dc.subject.lcsh | Routing (Computer network management) |
dc.subject.other | Telecommunication network routing |
dc.title | AnyTraffic routing algorithm for label-based forwarding |
dc.type | Conference report |
dc.subject.lemac | Commutació de paquets (Transmissió de dades) |
dc.subject.lemac | Encaminadors (Xarxes d'ordinadors) |
dc.contributor.group | Universitat Politècnica de Catalunya. CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla |
dc.identifier.doi | 10.1109/GLOCOM.2009.5425402 |
dc.relation.publisherversion | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5425402 |
dc.rights.access | Open Access |
local.identifier.drac | 2564795 |
dc.description.version | Postprint (published version) |
local.citation.author | Pedroso, P.; Pedrola, O.; Papadimitriou, D.; Klinkowski, M.; Careglio, D. |
local.citation.contributor | IEEE Global Communications Conference |
local.citation.pubplace | Honolulu |
local.citation.publicationName | 2009 IEEE Global Communications Conference |
local.citation.startingPage | 1 |
local.citation.endingPage | 8 |