2008
DOI: 10.1109/jlt.2008.926913
|View full text |Cite
|
Sign up to set email alerts
|

On the Use of Clustering Algorithms for Message Scheduling in WDM Star Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0
7

Year Published

2010
2010
2021
2021

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(15 citation statements)
references
References 32 publications
0
8
0
7
Order By: Relevance
“…Another example of the use of AI in resource allocation is the work by Petridou et al [75]. They propose a message scheduling algorithm, based on the k-means clustering algorithm, which addresses both message sequencing and channel Survivable optical networks Genetic algorithms [69]: designs the physical topology of the network ensuring survivability.…”
Section: Optical Network Planningmentioning
confidence: 99%
“…Another example of the use of AI in resource allocation is the work by Petridou et al [75]. They propose a message scheduling algorithm, based on the k-means clustering algorithm, which addresses both message sequencing and channel Survivable optical networks Genetic algorithms [69]: designs the physical topology of the network ensuring survivability.…”
Section: Optical Network Planningmentioning
confidence: 99%
“…In the adopted WDM star network, a set of N nodes are interconnecting to a passive star coupler via two-way optical fibers [13]- [15]. Each node is equipped with a tunable transmitter and a fixed receiver in order to send data packets on any available channel and to accept data on a specific channel, known as home channel.…”
Section: Network Modelmentioning
confidence: 99%
“…Existing MAC schemes for PSC networks, including preallocationbased [8,9] and reservation-based [10][11][12][13][14][15][16][17] schemes, exhibit various performance merits and weaknesses. Preallocation-based schemes predetermine channel resources for each source-destination pair (S-D pair).…”
Section: Introductionmentioning
confidence: 99%
“…Most previous studies have focused on the first concern by avoiding unnecessary receiver-tuning time, for example, by using a contiguous destination scheduling technique. Specifically, most works have focused on determining algorithms optimized for packing variablelength packets into available bandwidth resources [10][11][12][13][14][15]; however, no optimized algorithm can fill all idle slots, resulting in limited network utilization (which is at most approximately 80%).…”
Section: Introductionmentioning
confidence: 99%