Filters








232 Hits in 3.8 sec

Cost Bounds of Multicast Light-Trees in WDM Networks [chapter]

Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao
2010 Lecture Notes in Computer Science  
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks.  ...  And particularly in WDM rings, the optimal multicast light-tree has a cost inferior to N − N K+1 .  ...  Literature [12] also gives a cost upper bound of N 2 4 for the multicast light-trees in sparse splitting WDM networks, where N denotes the number of nodes in the network.  ... 
doi:10.1007/978-3-642-12963-6_27 fatcat:yjoku5qqvnesvksn3kezekwlpy

Cost Bounds and Approximation Ratios of Multicast Light-Trees in WDM Networks

Fen Zhou, Miklós Molnár, Bernard Cousin, Chunming Qiao
2011 Journal of Optical Communications and Networking  
However, the computation of the cost-optimal multicast light-trees is NPhard. In this paper, first we study the cost bounds of the lighttrees built for a multicast session in unweighted WDM networks.  ...  The cost bounds and approximation ratios of R2S and MO algorithms in some candidate WDM backbone networks are examined through simulations.  ...  COST BOUNDS OF MULTICAST LIGHT-TREES IN WDM MESH NETWORKS In this section, we will study the cost bounds of light-trees in unweighted WDM networks with two different light splitting configurations: full  ... 
doi:10.1364/jocn.3.000323 fatcat:m77oob4gi5flxh7pzhnsx3nz7y

Approximation Ratios of Multicast Light-Trees in WDM Networks

Fen Zhou, Miklos Molnar, Bernard Cousin, Chunming Qiao
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks.  ...  Let K be the number of destinations in a multicast session, it is proved that Reroute- to-Source (R2S) algorithm [4] achieves a tight approximation ratio equal to K in the non-equally-weighted WDM network  ...  However, only full light splitting is taken into account in [12] . In sparse splitting WDM networks, the cost bounds of multicast lighttrees are investigated by [16] .  ... 
doi:10.1109/glocom.2010.5684179 dblp:conf/globecom/ZhouMCQ10 fatcat:ncmyjvi6yzcwpcxbg6cr4mn46q

Constructing multiple light multicast trees in WDM optical networks

Weifa Liang
2004 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.  
Multicast routing is a fundamental problem in any telecommunication network. We address the multicast issue in a WDM optical network without wavelength conversion capability.  ...  To realize a multicast request in such network, it is required to establish multiple light multicast trees (MLMT) sometimes due to the fact that the requested network resources are being occupied by other  ...  solution for the MLMT in consisting of the collection of light multicast trees and be the cost sum of the light multicast trees in .  ... 
doi:10.1109/ispan.2004.1300525 dblp:conf/ispan/Liang04 fatcat:oxz5p7mbije4lnm4sifketeemm

Power Optimal Design of Multicast Light-Trees in WDM Networks

Fen Zhou, Miklos Molnar, Bernard Cousin, Gwendal Simon
2011 IEEE Communications Letters  
Given a multicast session in Wavelength Division Multiplexing (WDM) networks, we try to find the multicast lighttrees with the minimum power budget while taking into account the optical power loss as light  ...  The distribution of power loss is analyzed by simulations, which suggests to bound the combined power loss ratio of the node tapping loss and the light attenuation in each source-destination path, and  ...  A light-tree or a light-forest (a set of light-trees rooted at the same source) is generally used for multicasting in WDM networks.  ... 
doi:10.1109/lcomm.2011.090611.111529 fatcat:dkkrhrxsazdn7citqih3mhv6ly

Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities

Ming-Tsung Chen, Shian-Shyong Tseng, B.M.T. Lin
2006 Computer Communications  
for routing a multicast request that arrives in random with a given delay bound in a WDM network with heterogeneous light splitting capabilities, where a light-forest is a set of lighttrees used to set  ...  Because optical WDM networks will be realized as network backbone in the near future, multicasting in WDM networks needs to be supported for various network applications.  ...  Acknowledgements The authors are grateful to the Editor and the anonymous referees for their constructive comments that have improved the presentation of an earlier version of this paper.  ... 
doi:10.1016/j.comcom.2005.09.004 fatcat:5kfobdscavbu3orc4smxrw4fxu

Low-cost, delay-bounded point-to-multipoint communication to support multicasting over WDM networks

Taieb F. Znati, Tawfig Alrabiah, Rami Melhem
2002 Computer Networks  
In this paper, we present a new class of low-cost, bounded-delay m ulticast heuristics for WDM networks.  ...  Multicasting in WDM networks supporting multimedia applications can be viewed as the process of taking a group communication request and selecting a multicast tree that satis es the quality of service  ...  More speci cally, w e propose a set of heuristics that can be used to build minimum-cost, delay-bounded multicast trees in WDM networks.  ... 
doi:10.1016/s1389-1286(01)00260-2 fatcat:bgoplxzoujhrfeiyecyzyuyp6y

Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities

Ming-Tsung Chen, B.M.T. Lin, Shian-Shyong Tseng
2008 Journal of Network and Computer Applications  
in WDM networks having heterogeneous light splitting capabilities.  ...  Because optical wavelength division multiplexing (WDM) networks are expected to be realized for building up backbone in the near future, multicasting in WDM networks needs to be addressed for various network  ...  light-forest for routing a request under a given delay bound in a WDM-He network.  ... 
doi:10.1016/j.jnca.2006.07.002 fatcat:verkcqdfu5acxnlljxjmmw5oh4

Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks

Fen Zhou, Miklós Molnár, Bernard Cousin
2010 Photonic network communications  
The upper bound cost of the light-trees built by HSLT is given as N(N -1)/2, where N is the number of nodes in the network.  ...  In sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require.  ...  Since it is NP-Hard to compute the light-trees with the minimum cost, the cost bound is an important quality of the light-tress. Next, we give the cost bound of the HSLT light-tress.  ... 
doi:10.1007/s11107-010-0243-5 fatcat:4fiijhakvbb6pdoar752vzrvhe

Online broadcasting and multicasting in WDM networks with shared light splitter bank

Weifa Liang, Yuzhen Liu
2007 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)  
In this paper we deal with online broadcasting and multicasting in a WDM optical network with shared light splitter bank. Our objective is to maximize the network throughput.  ...  Since light splitting and wavelength conversion switching in WDM optical networks is cost expensive and fabrication difficult, we assume that only a fraction of network nodes are equipped with limited  ...  First, we can see that the weight w(v) of each node v is used to bound its degree d (v) in the multicast tree.  ... 
doi:10.1109/broadnets.2007.4550475 dblp:conf/broadnets/LiangL07 fatcat:ilcfyyt7ijdglcl4jj4v7g3xua

Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks

Der-Rong Din
2008 Artificial Intelligence Review  
Given the WDM network and the multicast request, the goal is to find a minimal cost light-forest to route the multicast request.  ...  In this paper, two new models (MWDCRP and MCRP) of multicast routing on WDM networks are studied.  ...  The cost of a light-tree T k (s, D k ) on the kth wavelength network is defined as the sum of the cost of all edges in the light-tree T k (s, D k ).  ... 
doi:10.1007/s10462-009-9146-1 fatcat:k44lzkx4crcjvketoq3g7oxpqy

Optimization of wavelength assignment for QoS multicast in WDM networks

Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, Jun Gu
2001 IEEE Transactions on Communications  
This paper discusses quality-of-service (QoS) multicast in wavelength-division multiplexing (WDM) networks.  ...  Given a set of QoS multicast requests, we are to find a set of cost suboptimal QoS routing trees and assign wavelengths to them. The objective is to minimize the number of wavelengths in the system.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous referees for their valuable and constructive comments, which helped greatly in improving the quality and presentation of this paper.  ... 
doi:10.1109/26.905896 fatcat:mtd74nbw3rgebaef4npizo6zz4

Multicast Traffic Grooming based Light-tree in WDM Mesh Networks

Ashok Kumar Pradhan, Tanmay De
2013 Procedia Technology - Elsevier  
SLTMTG algorithm is based on grooming of multicast traffic to constrained light-trees in which traffic is groomed for better resource utilizations.  ...  As higher layer electronic ports such as transmitters and receivers are dominant cost factors in a WDM mesh networks, it is critical to reduce their number when grooming multicast traffic into high bandwidth  ...  In this paper, we aim to design cost-effective WDM networks with multicast traffic grooming by reducing both number of transmitters and receivers as well as the number of required wavelengths.  ... 
doi:10.1016/j.protcy.2013.12.436 fatcat:tdqw3egl3bdv5joh2qhlf2kdue

A distributed routing and wavelength assignment algorithm for real-time multicast in WDM networks

Chuanhe Huang, Xiaohua Jia, Yongbing Zhang
2002 Computer Communications  
delay in wavelength division multiplexing (WDM) networks.  ...  The proposed routing method is based on the Prim's minimum spanning tree (MST) algorithm and the K-restricted breadth-first search method, which can produce a subminimal cost tree under a given delay bound  ...  This work is supported in partial by CityU SRG grant 7001121, JSPS, and Cheung Kong Scholars scheme at WuHan University, China.  ... 
doi:10.1016/s0140-3664(02)00087-7 fatcat:xbchtdoqrrbkpavoxktyndftdi

Genetic Algorithm for Finding Minimal Cost Light Forest of Multicast Routing on WDM Networks

Der-Rong Din
2008 Journal of Artificial Evolution and Applications  
Given a multicast request in a WDM network, the goal is to find a set of light trees, the assigned wavelengths of light trees, and construct alight forest.  ...  In this paper,the minimal cost multicast routing problem (MCMRP)on WDM networks withtap-and-continue(TaC) nodes is defined and studied.  ...  The cost of a light tree T k (s, D k ) on the kth wavelength network is defined as the sum of the cost of all edges in the light tree T k (s, D k ) as shown in (2) : c T k s, D k = ∀e∈Tk s,Dk c(e). (2  ... 
doi:10.1155/2008/536913 fatcat:tircyt6skrekhfmpiuoyx7u2z4
« Previous Showing results 1 — 15 out of 232 results