2015
DOI: 10.1007/978-3-319-24584-3_1
|View full text |Cite
|
Sign up to set email alerts
|

RWA: Novel Heuristic Algorithm for Optical Networks with Dynamic Traffic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…The novelty of this algorithm lies in a path construction method based on tabu-table technique for formulating achievable paths commencing the source to every single receiver. [5] utilized the movement of the snake for cost matrix formulation so as to optimize the optical network. Pavani, et al [22] Analyzed the uncertain problems in the implementation of ACO algorithms in optical networks in three categories of byzantine failure such like misdirection of onward ants, plummeting of forward ants and plummeting of backward ants.…”
Section: B Restoration Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The novelty of this algorithm lies in a path construction method based on tabu-table technique for formulating achievable paths commencing the source to every single receiver. [5] utilized the movement of the snake for cost matrix formulation so as to optimize the optical network. Pavani, et al [22] Analyzed the uncertain problems in the implementation of ACO algorithms in optical networks in three categories of byzantine failure such like misdirection of onward ants, plummeting of forward ants and plummeting of backward ants.…”
Section: B Restoration Methodsmentioning
confidence: 99%
“…The delay factor can be acalculated using the formula (4) for each 𝑗 in light path 𝑙𝑝. Then the determined delay factor value is Substituted in the equation (5). we can get Delay covariance between two routers 𝑟 𝑖 , 𝑟 𝑗 .…”
Section: F Delay Factormentioning
confidence: 99%