Anytraffic routing algorithm for label-based forwarding

Authors:
Pedro Pedroso;Oscar Pedrola;Dimitri Papadimitriou;Miroslaw Klinkowski;Davide Careglio
Affiliations:
Universitat Politécnica de Catalunya, Barcelona, Spain;Universitat Politécnica de Catalunya, Barcelona, Spain;Alcatel-Lucent Bell NV, Antwerpen, Belgium;Universitat Politécnica de Catalunya, Barcelona, Spain and National Institute of Telecommunications, Warsaw, Poland;Universitat Politécnica de Catalunya, Barcelona, Spain
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 3
Cited 0

Scheduling combined unicast and multicast traffic in WDM

PICS '98 Proceedings of the IFIP TC6/WG6.3 Seventh International Conference on Performance of Information and Communication Systems
An analysis of multicast forwarding state scalability

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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.