AnyTraffic routing algorithm for label-based forwarding
Visualitza/Obre
10.1109/GLOCOM.2009.5425402
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/10775
Tipus de documentText en actes de congrés
Data publicació2009-11-30
EditorIEEE Press and Wiley
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
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.
Citació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.
ISBN978-1-4244-4148-8
Versió de l'editorhttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5425402
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Pedroso.pdf | 311,0Kb | Visualitza/Obre |