2014 International Conference on Multimedia Computing and Systems (ICMCS) 2014
DOI: 10.1109/icmcs.2014.6911259
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of shortest path routing algorithms in wide all-optical WDM networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…For example, a traffic demand can be assigned the shortest route in order to reduce the cost. Such design principles have been used to develop many heuristic algorithms for network design [2]- [4]. Although these algorithms are computationally simple, they often yield poor performance when the problem becomes complex and consideration cannot be given to all influencing factors.…”
Section: Introductionmentioning
confidence: 99%
“…For example, a traffic demand can be assigned the shortest route in order to reduce the cost. Such design principles have been used to develop many heuristic algorithms for network design [2]- [4]. Although these algorithms are computationally simple, they often yield poor performance when the problem becomes complex and consideration cannot be given to all influencing factors.…”
Section: Introductionmentioning
confidence: 99%
“…In our MLR network model, each wavelength is assigned a di↵erent fixed line-rate (10,40, or 100 Gbps). This fact is addressed by having three sub-colonies of ants, with each sub-colony representing one line-rate.…”
Section: Mixed Line Ratesmentioning
confidence: 99%
“…Using wavelength division multiplexing (WDM) technology, spectrum usage has greatly increased by allowing multiple-line-rates and tra c grooming, which we discussed above. We have intro- to develop many heuristic algorithms for network design [38,39,40]. Although these algorithms are computationally simple, they often yield poor performance when the problem becomes complex and consideration cannot be given to all influencing factors.…”
Section: Introductionmentioning
confidence: 99%
“…First, traffic demands in Fig. 4.2a are routed for each physical topology of domain based on shortest path algorithms [26]. Fig.…”
Section: Drid's Aggregation Model To Protect Multi-domain Network Usi...mentioning
confidence: 99%
“…Through ONO Tool, we propose an approach which is inspired by paper [29] to generate a set of nodes and links with a small number of crossing points between links. When it comes to network survivability or protection in particular, path protection and link protection schemes are the main means of protecting wavelength-division multiplexed (WDM) networks from the losses caused by a link failure [26]. Since link failures are common, only link protection is considered in the scope of ONO Tool and this paper.…”
Section: A2 Ono Toolmentioning
confidence: 99%