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
(8)
Decomposition Method
Internet Service Provider
Layered Architecture
Mesh Network
Network Optimization
Optimal Solution
Optimization Problem
Utility Function
Subscribe
Academic
Publications
Two-layer mesh network optimization based on inter-layer decomposition
Two-layer mesh network optimization based on inter-layer decomposition,10.1007/s11107-010-0301-z,Photonic Network Communications,Xiaoning Zhang,Feng S
Edit
Two-layer mesh network optimization based on inter-layer decomposition
(
Citations: 1
)
BibTex
|
RIS
|
RefWorks
Download
Xiaoning Zhang
,
Feng Shen
,
Li Wang
,
Sheng Wang
,
Lemin Li
,
Hongbin Luo
Presently, backbone data networks are converging toward a typical two-layer architecture of an IP/MPLS layer over an optical layer. In this paper, we study the problem of maximizing a
utility function
for an
Internet service provider
(ISP) of a two-layer mesh networks and propose an efficient
decomposition method
based on Lagrange relaxation. Differing from previous works on two-layer mesh networks, our proposed
decomposition method
decomposes an original two-layer mathematic optimization problem, respectively, into an IP/MPLS-layer and an optical-layer
optimization problem
by slacking the constraints between the two layers. This
decomposition method
enables to control the trade-off between running time and quality of the feasible solution. Numerical results for a variety of networks indicate that our proposed
decomposition method
is attractive to quickly find near optimal solutions.
Journal:
Photonic Network Communications - PHOTONIC NETW COMMUN
, vol. 21, no. 3, pp. 310-320, 2011
DOI:
10.1007/s11107-010-0301-z
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.springerlink.com
)
(
www.springerlink.com
)
Citation Context
(1)
...The authors in [
8
] present an ILP formulation to maximize a utility function for the network operator (i.e., the difference between revenues and costs), but failures are not considered...
...The SIMULTANEO problem can be considered NP-hard since simpler multilayer network planning problems without survivability have been proved to be NP-hard (e.g., [
8
])...
M. Ruiz
,
et al.
Survivable IP/MPLS-Over-WSON Multilayer Network Optimization
References
(16)
Traffic grooming in WDM networks
(
Citations: 212
)
Eytan Modiano
,
Philip J. Lin
Journal:
IEEE Communications Magazine - IEEE Commun. Mag.
, vol. 39, no. 7, pp. 124-129, 2001
Traffic grooming in WDM networks: past and future
(
Citations: 232
)
R. Dutta
,
G. N. Rouskas
Journal:
IEEE Network - NETWORK
, vol. 16, no. 6, pp. 46-56, 2002
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
(
Citations: 37
)
Rudra Dutta
,
Shu Huang
,
George N. Rouskas
Conference:
Measurement and Modeling of Computer Systems - SIGMETRICS
, pp. 298-299, 2003
New Techniques for Efficient Traffic Grooming in WDM Mesh Networks
(
Citations: 12
)
Arunita Jaekel
,
Ataul Bari
,
Ying Chen
,
Subir Bandyopadhyay
Conference:
International Conference on Computer Communications and Networks - ICCCN
, pp. 303-308, 2007
Traffic grooming in an optical WDM mesh network
(
Citations: 312
)
Keyao Zhu
,
Biswanath Mukherjee
Journal:
IEEE Journal on Selected Areas in Communications - JSAC
, vol. 20, no. 1, pp. 122-133, 2002
Sort by:
Citations
(1)
Survivable IP/MPLS-Over-WSON Multilayer Network Optimization
M. Ruiz
,
O. Pedrola
,
L. Velasco
,
D. Careglio
,
J. Fernández-Palacios
,
G. Junyent
Journal:
Journal of Optical Communications and Networking - J OPT COMMUN NETW
, vol. 3, no. 8, pp. 629-640, 2011