Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)
DOI: 10.1109/icccn.2003.1284201
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives

Abstract: -This paper studies a traffic grooming in wavelength-division multiplexing (WDM) mesh networks for the SONET/SDH streams requested between node pairs. The traffic could be groomed at the access node before converting to an optical signal carried in the All-Optical network. We design a virtual topology with a given physical topology to satisfy multiple objectives and constraints. The grooming problem of a static demand is considered as an optimization problem. The algorithms found in the literatures focus on a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
23
0

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 17 publications
(24 citation statements)
references
References 10 publications
0
23
0
Order By: Relevance
“…Several grooming policies and traffic selection methods are also presented. These grooming policies are the following: Minimizing the Number of Traffic Hops In [14], the aim of the authors is to design a virtual topology that optimizes performance and cost. Their objective functions include a maximization of throughput (as found in [22,24], and [11]), a minimization of transceivers (as found in [10] and [8]), and a minimization of the average propagation delay of the lightpaths.…”
Section: Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Several grooming policies and traffic selection methods are also presented. These grooming policies are the following: Minimizing the Number of Traffic Hops In [14], the aim of the authors is to design a virtual topology that optimizes performance and cost. Their objective functions include a maximization of throughput (as found in [22,24], and [11]), a minimization of transceivers (as found in [10] and [8]), and a minimization of the average propagation delay of the lightpaths.…”
Section: Previous Workmentioning
confidence: 99%
“…Then, we update the best and the worst value of MOFitness, and the Gravitational constant (G) (lines [13][14][15][16]. After that, we calculate the mass and acceleration of each agent of P (lines 17-33).…”
Section: Multiobjective Gravitational Search Algorithmmentioning
confidence: 99%
“…Moreover, the bandwidth request of a DC traffic stream can be much lower than the capacity of the lightpath. Efficient grooming of DC's connections onto high-capacity lightpath will improve the network throughput and reduce network management cost [11,12].…”
Section: Introductionmentioning
confidence: 99%
“…One of these algorithms is minimum-delay logical topology design algorithm (MLDA), which aims at designing logical topologies with low end-to-end delay considering both the physical network and the traffic demand. In Reference [11], a multi-objective evolutionary algorithm is proposed by Prathombutr et al to simultaneously maximise the throughput and minimise the number of transceivers and the propagation delay, but it does not take into account the transmission and routing delays. Finally, Ghose et al [12] propose two algorithms (one heuristic and one genetic) to design logical topologies minimising the end-to-end delay, and they also solve the RWA problem.…”
Section: Introductionmentioning
confidence: 99%