{"title":"Problems on routing bounded distance assignments in hypercubes","authors":"N. Bagherzadeh, M. Dowd","doi":"10.1109/MPCS.1994.367085","DOIUrl":null,"url":null,"abstract":"The problem of whether an assignment in the hypercube H/sub n/, where the distance from the source to the destination is bounded, can be routed with minimum distance and bounded congestion is considered. It is shown that this is so, if assignments of given \"type\" can be so routed. Of particular interest is whether for distance 3 and fixed type, minimum distance and congestion 1 can be obtained. This is shown for n/spl les/6; on the other hand the method suggests possible counter examples. Also, it is shown that distance 2 permutations in H/sub 4/ have congestion 1 routings.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"20 1","pages":"126-131"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"专用汽车","FirstCategoryId":"1087","ListUrlMain":"https://doi.org/10.1109/MPCS.1994.367085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The problem of whether an assignment in the hypercube H/sub n/, where the distance from the source to the destination is bounded, can be routed with minimum distance and bounded congestion is considered. It is shown that this is so, if assignments of given "type" can be so routed. Of particular interest is whether for distance 3 and fixed type, minimum distance and congestion 1 can be obtained. This is shown for n/spl les/6; on the other hand the method suggests possible counter examples. Also, it is shown that distance 2 permutations in H/sub 4/ have congestion 1 routings.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
