{"title":"Randomized routing with shorter paths","authors":"E. Upfal, S. A. Felperin, M. Snir","doi":"10.1145/165231.166106","DOIUrl":null,"url":null,"abstract":"Studies the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to break \"spatial locality\", within each permutation, only log log N additional randomizing stages are needed to break \"temporal locality\" among successive permutations. Thus, log N bits of initial randomization per input, followed by log log N bits of randomization per packet are sufficient to ensure that t permutations are delivered in time t+log N. We present simulation results that validate this analysis.","PeriodicalId":13128,"journal":{"name":"IEEE Trans. Parallel Distributed Syst.","volume":"53 1","pages":"356-362"},"PeriodicalIF":0.0000,"publicationDate":"1993-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Parallel Distributed Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/165231.166106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Studies the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to break "spatial locality", within each permutation, only log log N additional randomizing stages are needed to break "temporal locality" among successive permutations. Thus, log N bits of initial randomization per input, followed by log log N bits of randomization per packet are sufficient to ensure that t permutations are delivered in time t+log N. We present simulation results that validate this analysis.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
