Edge Loading Algorithms for De Bruijn and Modified De Bruijn Graphs and their Performance Analysis in Lightwave Netrworks

This paper proposes edge-loading algorithms for the De Bruijn graphs [4,5,8,11] and Modified De Bruijn graphs [10], which are logical topologies for multihop light wave networks. For a given in-degree, out-degree and average number of hops between nodes in a network, the edge loading algorithms for Modified De Bruijn graphs has shown smaller average edge loading, better network utilization than that of De Bruijn graphs. Results for De Bruijn and Modified De Bruijn graphs are computed for different values of 'A' (degree) and 'd' (diameter) are presented.