DocumentCode :
1325219
Title :
DBG MANs and their routing performance
Author :
Yang, O.W.W. ; Feng, Z.
Author_Institution :
Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada
Volume :
147
Issue :
1
fYear :
2000
fDate :
2/1/2000 12:00:00 AM
Firstpage :
32
Lastpage :
40
Abstract :
The authors propose the de Bruijn graph (dBG) as a topology for multi-hop lightwave networks and their hierarchical structures. Three routing algorithms that would progressively improve on the mean path length and network throughput-delay performance are studied under various topological variations and locality factors. The study shows that the performance of the bidirectional dBG networks and their hierarchical derivatives are desirable and are comparable to other types of multi-hop systems. Therefore, they are candidates for metropolitan area networks
Keywords :
graph theory; metropolitan area networks; network topology; optical fibre networks; telecommunication network routing; DBG MAN; bidirectional dBG networks; de Bruijn graph; hierarchical derivatives; hierarchical structures; locality factors; mean path length; metropolitan area networks; multi-hop lightwave networks; network throughput-delay performance; routing performance; topology;
fLanguage :
English
Journal_Title :
Communications, IEE Proceedings-
Publisher :
iet
ISSN :
1350-2425
Type :
jour
DOI :
10.1049/ip-com:20000230
Filename :
838086
Link To Document :
بازگشت