Compared performance analysis of routing algorithms for bidirectional de Bruijn graphs

Author

Borella, Andrea ; Cancellieri, Giovanni ; Luchetti, Elena

Author_Institution

Dipt. di Elettronica e Autom., Ancona Univ., Italy

Volume

2

fYear

1998

fDate

18-20 May 1998

Firstpage

1274

Abstract

De Bruijn graphs are considered as a class of logical and physical topologies for multi-hop WDM networks. They are suitable to connect a large number of nodes, using simple addressing and routing techniques. In addition, bidirectional de Bruijn graphs take advantage of the availability of bidirectional links to improve the overall network performance. Here, three algorithms of different complexity are applied as routing techniques in bidirectional de Bruijn graphs, and then compared in terms of number of hops, queueing delay and throughput

Keywords

communication complexity; graph theory; telecommunication network routing; wavelength division multiplexing; bidirectional de Bruijn graphs; bidirectional links; complexity; hops; multi-hop WDM network topology; network performance; performance analysis; queueing delay; routing algorithms; simple addressing; throughput; Availability; Communication networks; Delay; Network topology; Performance analysis; Routing; Shift registers; Spread spectrum communication; Throughput; WDM networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrotechnical Conference, 1998. MELECON 98., 9th Mediterranean

Conference_Location

Tel-Aviv

Print_ISBN

0-7803-3879-0

Type

conf

DOI

10.1109/MELCON.1998.699441

Filename

699441