A Repository of Compound Graphs for use in Large Network Design.pdfVIP

CDMTCS Research Report Series A Repository of Compound Graphs for use in Large Network Design Yun-Bum (Tim) Kim and Michael J. Dinneen Department of Computer Science, University of Auckland, Auckland, New Zealand CDMTCS-313 November 2007 Centre for Discrete Mathematics and Theoretical Computer Science A Repository of Compound Graphs for use in Large Network Design Yun-Bum (Tim) Kim and Michael J. Dinneen Department of Computer Science Univeristy of Auckland Auckland, New Zealand November 11, 2007 Abstract In a field of network design, engineers desire better ways to design efficient communication network. While designing such network, we are restricted with engineering constraints such as communication delays and hardware costs. Many construction techniques have been proposed. In this paper we focus on compound- ing techniques and provide (∆,D) tables that contain the largest compound graphs for given degree ∆ and diameter D. We also empirically verify a few of the recently discovered large compound graphs. 1 Introduction In the design of interconnection networks, we are restricted by engineering limitations and hardware costs of adding communication links. That is, nodes of a network are restricted to have at most a fixed number of communication links. Due to this restriction in most cases transmitting data between two nodes require data to be traversed between several nodes before reaching its destination node. When data is traversed between any two nodes communication delays must happen, and it is a cost measure to minimize the number of