Scalable expanders: exploiting hierarchical random wiring

Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they become large. This paper introduces a technique for scaling expanders that avoids this wiring complexity. Specifically, we make the following contributions:

• Type: Conference
• Year: 1994
• Where: STOC
• Authors: Eric A. Brewer, Frederic T. Chong, Tom Leighton
• Keywords: Algorithms, STOC 1994, Wired Expander-based Networks, Wiring Complexity