z-logo
open-access-imgOpen Access
Minimum Cost Multicast Routing Based on High Utilization MC Nodes Suited to Sparse-Splitting Optical Networks
Author(s) -
Sang-Hun Cho,
TaeJin Lee,
Min Young Chung,
Hyunseung Choo
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-34072-6
DOI - 10.1007/11751588_31
Subject(s) - multicast , protocol independent multicast , computer network , xcast , source specific multicast , computer science , distance vector multicast routing protocol , pragmatic general multicast , distributed computing , heuristic , ip multicast , multiplexing , telecommunications , artificial intelligence
As the Internet traffic continues to grow exponentially, Wavelength Division Multiplexing (WDM) networks with tera bps bandwidth per fiber naturally emerge as backbone for next generation optical Internet. In particular, much research regarding multicast services has progressed for connecting source to destination nodes efficiently because multicast demands are increasing. However, sparse-splitting networks are more realistic than fully-splitting ones, since multicast-capable cross-connectors are expensive. In this paper, a heuristic method to minimize the cost of a multicast tree based mainly on Multicast-Capable nodes in sparse-splitting networks is proposed. According to the results of comprehensive simulations and compared to the previous algorithms, the proposed algorithm provides performance improvement up to about 16% in terms of wavelength channel cost.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom