Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(11)
Approximate Solution
Communication Cost
Delay Bound
Heuristic Algorithm
Integer Linear Program
Large Scale
Multicast Routing
Wavelength Assignment
Wavelength Division Multiplex
Wdm Network
Shortest Path
Subscribe
Academic
Publications
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities,10.1016/j.jnca.2006.07.002,Journal
Edit
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities
(
Citations: 5
)
BibTex

RIS

RefWorks
Download
Mingtsung Chen
,
Bertrand M. T. Lin
,
Shianshyong Tseng
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 applications. This paper studies an extended
multicast routing
and
wavelength assignment
(RWA) problem called
multicast routing
and
wavelength assignment
with delay constraint (MRWADC) that incorporates delay constraints in WDM networks having heterogeneous light splitting capabilities. The objective is to find a lightforest whose multicast cost, defined as a weighted combination of
communication cost
and wavelength consumption, is minimum. An integer linear programming (ILP) model is proposed to formulate and solve the problem. Experimental results show that using CPLEX to solve the ILP formulation can optimally deal with smallscale networks. Therefore, we develop a heuristic, nearkshortestpath heuristic (NKSPH), to solve the problem in largescale networks. Numerical results indicate that the proposed
heuristic algorithm
can produce approximate solutions of good quality in an acceptable time.
Journal:
Journal of Network and Computer Applications  JNCA
, vol. 31, no. 1, pp. 4765, 2008
DOI:
10.1016/j.jnca.2006.07.002
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
(
linkinghub.elsevier.com
)
More »
Citation Context
(4)
...With only the lighttree structure constraints developed above [19,
20
], one cannot guarantee that each lighttree of the resultant lightforest should be connected and loop free...
Fen Zhou
,
et al.
Cost Bounds and Approximation Ratios of Multicast LightTrees in WDM N...
...Similar to [10], an efficient nearkshortestpath heuristic (NKSPH) was proposed to produce approximate solutions in polynomial time in [
11
]...
Qiwu Wu
,
et al.
Multicast routing and wavelength assignment with delay constraint in W...
...To compute multicast routes, most of the multicast algorithms propose to use ''lighttrees'' or a set of trees called ''lightforest'' [3, 4, 7, 11,
12
]...
Bernard Cousin
,
et al.
Lighthierarchies: Optimal multicast routes under optical constraints
...With the developments in the multimedia and other realtime applications, how to establish a lightpath satisfying Quality of Service (QoS) requirements is becoming a very important problem [
2
]...
Qiwu Wu
,
et al.
A LowCost DelayConstrained Routing and Wavelength Assignment Algorit...
References
(10)
Efficient routing and wavelength assignment for multicast in WDM networks
(
Citations: 60
)
Biao Chen
,
Jianping Wang
Journal:
IEEE Journal on Selected Areas in Communications  JSAC
, vol. 20, no. 1, pp. 97109, 2002
Finding the k Shortest Paths
(
Citations: 546
)
David Eppstein
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, pp. 154165, 1994
Integrated algorithm for delay bounded multicast routing and wavelength assignment in all optical networks
(
Citations: 9
)
X. H. Jia
,
D. Z. Du
,
X. D. Hu
Journal:
Computer Communications  COMCOM
, 2001
IP Multicasting: The Complete Guide to Interactive Corporate Networks
(
Citations: 40
)
Dave Kosiur
Published in 1998.
Static lightpath establishment in WDM networks  New ILP formulations and heuristic algorithms
(
Citations: 12
)
M. Shiva Kumar
,
P. Sreenivasa Kumar
Journal:
Computer Communications  COMCOM
, vol. 25, no. 1, pp. 109114, 2002
Sort by:
Citations
(5)
Cost Bounds and Approximation Ratios of Multicast LightTrees in WDM Networks
Fen Zhou
,
Miklós Molnár
,
Bernard Cousin
,
Chunming Qiao
Journal:
Journal of Optical Communications and Networking  J OPT COMMUN NETW
, vol. 3, no. 4, pp. 323334, 2011
Multicast routing and wavelength assignment with delay constraint in WDM networks with sparse wavelength conversions
(
Citations: 2
)
Qiwu Wu
,
Xianwei Zhou
,
Jianping Wang
,
Zhizhong Yin
,
Lin Lin
Journal:
Photonic Network Communications  PHOTONIC NETW COMMUN
, vol. 19, no. 2, pp. 144154, 2010
QoS multicast tree construction in IP/DWDM optical internet by bioinspired algorithms
(
Citations: 1
)
Hui Cheng
,
Xingwei Wang
,
Shengxiang Yang
,
Min Huang
,
Jiannong Cao
Journal:
Journal of Network and Computer Applications  JNCA
, vol. 33, no. 4, pp. 512522, 2010
Lighthierarchies: Optimal multicast routes under optical constraints
Bernard Cousin
,
Miklos Molnar
,
Fen Zhou
Conference:
IEEE PhotonicsGlobal@Singapore  IPGC
, 2010
A LowCost DelayConstrained Routing and Wavelength Assignment Algorithm in WDM Networks with Sparse Wavelength Conversions
Qiwu Wu
,
Xianwei Zhou
,
Jianping Wang
,
Zhizhong Yin
,
Lingzhi Jiang
Conference:
Symposium on Photonics and Optoelectronics  SOPO
, 2009