Routing algorithms in the bidirectional de Bruijn graph metropolitan area networks

Author

Feng, Zhi ; Yang, Oliver W W

Author_Institution

Dept. of Electr. Eng., Ottawa Univ., Ont., Canada

fYear

1994

fDate

2-5 Oct 1994

Firstpage

957

Abstract

This paper studies routing algorithms of the multihop lightwave systems based on the bidirectional de Bruijn graph. Three different routing methods are proposed and performance results are obtained in terms of the mean path lengths, network throughput and delay performance. The study shows that the performance of this type of topology is desirable and comparable to other types of multihop systems. It may be considered as a candidate for metropolitan area networks

Keywords

delays; directed graphs; metropolitan area networks; network topology; optical fibre networks; performance evaluation; telecommunication network routing; MAN; bidirectional de Bruijn graph; mean path lengths; metropolitan area networks; multihop lightwave systems; network delay performance; network throughput performance; network topology; performance results; routing algorithms; Algorithm design and analysis; Communications technology; Intelligent networks; Metropolitan area networks; Network topology; Optical fiber communication; Routing; Spread spectrum communication; Throughput; Transceivers;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 1994. MILCOM '94. Conference Record, 1994 IEEE

Conference_Location

Fort Monmouth, NJ

Print_ISBN

0-7803-1828-5

Type

conf

DOI

10.1109/MILCOM.1994.473973

Filename

473973