Multihop lightwave networks based on de Bruijn graphs

Abstract

de Bruijn graphs are proposed as logical topologies for multihop lightwave networks. The throughput and delay performance of networks based on de Bruijn graphs are compared with those of shufflenets. It is shown that for a given maximum nodal in- and out-degree and average number of hops between stations, a network based on a de Bruijn graph can support a much larger number of stations than a shufflenet. This increase in the number of stations is obtained at the expense of some nonuniformity in edge loading when the traffic distribution over the source-destination pairs is uniform. In the 1024-node example, this results in a slightly lower throughput for the network based on the de Bruijn graph compared to the shufflenet, but the former has lower delay at low offered loads.