@inproceedings{e5a27da758804535906cfa92f926bc68,
title = "Generalized ϒ networks",
abstract = "The ϒ topology[4] suggests many avenues of interesting network formulation due to its irregular distribution of node degree, namely its ability to provide (formula presented) average cost networks[2] with maximum degree Θ (log2 n) and modular scalability[3]. The ϒ network has proven difficult to transform into a regular network though. We present a general form of ϒ network based on powers of r ≥ 2 with diameter (formula presented) and average cost (formula presented) where n = rt ∈ ℝ and t ∈ ℕ with the tradeoff being increased maximum degree from 2t – 1 to 2rt – 2t – r + 1. For applications requiring bounded degree we provide a modified general ϒ construction with maximum degree 2r and diameter (formula presented) while maintaining the order of average cost at (formula presented). This results in a maximum cost of Θ (rt).",
author = "Aaron Harwood and Hong Shen",
note = "Publisher Copyright: {\textcopyright} 1999, Springer-Verlag. All rights reserved.; 2nd International Symposium on High Performance Computing, ISHPC 1999 ; Conference date: 26-05-1999 Through 28-05-1999",
year = "1999",
doi = "10.1007/BFb0094931",
language = "English",
isbn = "3540659692",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "304--311",
editor = "Kazuki Joe and Akira Fukuda and Constantine Polychronopoulos and Shinji Tomita",
booktitle = "High Performance Computing - 2nd International Symposium, ISHPC 1999, Proceedings",
address = "Germany",
}