Extending Optimal Oblivious Reconfigurable Networks to all N .

Previous chapter Next chapter Full AccessProceedings Symposium on Algorithmic Principles of Computer Systems (APOCS)Extending Optimal Oblivious Reconfigurable Networks to all NTegan Wilson, Daniel Amir, Vishal Shrivastav, Hakim Weatherspoon, and Robert KleinbergTegan Wilson, Daniel Amir, Vishal Shrivastav, Hakim Weatherspoon, and Robert Kleinbergpp.1 - 16Chapter DOI:https://doi.org/10.1137/1.9781611977578.ch1PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Reconfigurable networks have traditionally suffered from long reconfiguration times due to hardware limitations. With the emergence of new technologies that can reconfigure on the order of nanoseconds, the Oblivious Reconfigurable Network (ORN) design paradigm has been proposed to take advantage of this new capability. Two of the most important performance metrics for network operators considering ORNs are latency and throughput, which are inherently opposed and thus lead to a tradeoff. Previously, we constructed two families of ORN designs, called EBS and VBS, and proved that together they achieve optimal maximum latency (up to a constant factor) for any given throughput value r. Unfortunately, both families are defined only for very restrictive network sizes, N. This poses a challenge for implementing networks based on these designs in practice, as it is unlikely that a given system will have a suitable size. In this work, we extend both EBS and VBS to any network size while minimizing the impact on maximum latency and throughput. We prove that the extended versions achieve optimal maximum latency for all sufficiently large N, except when the throughput r exactly equals the reciprocal of an even integer. Previous chapter Next chapter RelatedDetails Published:2023eISBN:978-1-61197-757-8 https://doi.org/10.1137/1.9781611977578Book Series Name:ProceedingsBook Code:APOSC23Book Pages:ii + 63