Abstract
This paper deals with the analysis of the throughput performance of various logical topologies for Multihop Networks. In particular, ShuffleNets, De Bruijn graphs and Kautz graphs are analyzed. For the comparison, routing algorithms adopting minimum path length are considered. A hot-spot traffic scenario is adopted, modeling the presence of a centralized network resource to which a quota of the internal traffic is directed or originated from. The analysis is carried out by varying the traffic unbalance degree, from a uniform traffic distribution to a completely unbalanced one (all the traffic is concentrated in the hot-spot node).
For ShuffleNets, simple analytical expressions of the actual throughput limits are utilized. In the case of De Bruijn and Kautz graphs, instead, a lower bound of the throughput is utilized, which coincides with the actual throughput in a wide range of values of the network size.
The results obtained show that Shuffle and Kautz graphs always outperform De Bruijn topologies. Moreover, ShuffleNets present a further advantage on the other topologies; in fact, since the nodes are topologically equivalent, the placement of the hot-spot node does not affect the throughput performance.
Chapter PDF
Similar content being viewed by others
References
A. S. Acampora: βA Multichannel Multihop Local Lightwave Networkβ. Globecomβ87, Tokyo (Japan), November 1987, paper 37.5.
A. S. Acampora, M. J. Karol: βAn Overview of Lightwave Packet Networksβ. IEEE Network, January 1989, pp. 29β41.
M. Eisenberg, N. Mehravari: βPerformance of the Multichannel Multihop Lightwave Network under non uniform trafficβ. IEEE JSAC, Vol. 6, No 7, August 1988.
M. J. Karol, S. Z. Shaikh: βA simple adaptive routing scheme for congestion control in ShuffleNet Multihop Lightwave Networksβ, IEEE JSAC, Vol. 9, No 7, September 1991, pp. 1040β1051.
A. S. Acampora, S. I. A. Shah: βMultihop lightwave networks: a comparison of store-and-forward and hot-potato routingβ, IEEE Transactions on Communications, Vol. 40, No 6, June 1992, pp. 1082β1090.
M. Kadoch, A. K. Elhakeem: βAdaptive Routing for Lightwave Shufflenet Under Unbalanced Loadsβ. Globecomβ91, San Diego (USA), November 1991, paper 52.7.
F. Bernabei, L. Gratta, M. Listanti: βThroughput Analysis of Multihop ShuffleNets in a Hot-Spot Traffic Scenario: Impact of Routing Strategiesβ. Computer Networks and ISDN Systems, Vol. 28, NΒ° 6, April 1996.
K. N. Sivarajan, R. Ramaswami: βLightwave Networks Based on De Bruijn Graphsβ. IEEE/ACM Transactions on Networking, Vol. 2, No 1, February 1994, pp. 70β79.
G. Panchapakesan, A. Sengupta: βOn Multihop Optical Network Topology Using Kautz Digraphsβ. Infocom 95, Toronto (Canada), April 1995, paper 6a.1.1, pp. 675β682.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Β© 1996 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Bernabei, F., De Simone, V., Gratta, L., Listanti, M. (1996). Shuffle vs. Kautz/De Bruijn Logical Topologies for Multihop Networks: a Throughput Comparison. In: Mason, L., Casaca, A. (eds) Broadband Communications. BC 1996. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34987-9_23
Download citation
DOI: https://doi.org/10.1007/978-0-387-34987-9_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2960-2
Online ISBN: 978-0-387-34987-9
eBook Packages: Springer Book Archive