Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2003
DOI: 10.1109/tnet.2003.810310
|View full text |Cite
|
Sign up to set email alerts
|

A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

Abstract: Abstract-As the operation of our fiber-optic backbone networks migrates from interconnected SONET rings to arbitrary mesh topology, traffic grooming on wavelength-division multiplexing (WDM) mesh networks becomes an extremely important research problem. To address this problem, we propose a new generic graph model for traffic grooming in heterogeneous WDM mesh networks. The novelty of our model is that, by only manipulating the edges of the auxiliary graph created by our model and the weights of these edges, o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
2
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 274 publications
(9 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…They formulated this problem into an ILP and proposed a heuristic to obtain near optimal solution. Zhu et al in [9], presented an auxiliary graph model and proposed an integrated grooming algorithm based on auxiliary graph model to solve the traffic grooming problem. They proposed several grooming policies and traffic selection methods based on this model and evaluated their performance for different network topologies.…”
Section: Previous Workmentioning
confidence: 99%
“…They formulated this problem into an ILP and proposed a heuristic to obtain near optimal solution. Zhu et al in [9], presented an auxiliary graph model and proposed an integrated grooming algorithm based on auxiliary graph model to solve the traffic grooming problem. They proposed several grooming policies and traffic selection methods based on this model and evaluated their performance for different network topologies.…”
Section: Previous Workmentioning
confidence: 99%
“…In [8], traffic grooming in an IP-over-optical with TE and bifurcated grooming was considered (see also Section 3.3). A model for traffic grooming using TE and bifurcated flows, taking various constraints into account, is presented in [9].…”
Section: A Note About This Optimization Problemmentioning
confidence: 99%
“…• Common Vector [94] • Constrained Breadth First Search (C-BFS) [96] • Channel Graph-based solution [94,95] • Label-Layer Graph-based solution [96] • Auxiliary Graphs [104,105] • Dynamic Virtual Network Topology (VNT) Configuration Algorithm [93] Table 2.1: Multi-layer Path Computation Algorithms.…”
Section: Path Computation Element (Pce)mentioning
confidence: 99%