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
fDate :
2/1/2000 12:00:00 AM
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;
Journal_Title :
Communications, IEE Proceedings-
DOI :
10.1049/ip-com:20000230