33rd European Conference and Exhibition on Optical Communication - ECOC 2007 2007
DOI: 10.1049/ic:20070308
|View full text |Cite
|
Sign up to set email alerts
|

MINCOD-MTD: a RWA algorithm in semi-transparent optical networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…The so-called Minimum Coincidence and Distance according to the Q factor (MINCOD-Q) [6] is based on the Minimum Coincidence and Distance (MINCOD) routing algorithm [17]. MINCOD-Q uses a set of K pre-computed routes, from a source node to a destination node, having the minimum distance in terms of kilometers and the minimum number of shared links.…”
Section: A Mincod-q Ia-rwa Algorithmmentioning
confidence: 99%
“…The so-called Minimum Coincidence and Distance according to the Q factor (MINCOD-Q) [6] is based on the Minimum Coincidence and Distance (MINCOD) routing algorithm [17]. MINCOD-Q uses a set of K pre-computed routes, from a source node to a destination node, having the minimum distance in terms of kilometers and the minimum number of shared links.…”
Section: A Mincod-q Ia-rwa Algorithmmentioning
confidence: 99%