超立方体中有界距离分配的路由问题

专用汽车 Pub Date : 1994-05-02 DOI:10.1109/MPCS.1994.367085

N. Bagherzadeh, M. Dowd

{"title":"超立方体中有界距离分配的路由问题","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":"{\"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}","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

摘要

考虑了源到目的的距离有界的超立方体H/sub / n/中的分配能否以最小距离和有界拥塞进行路由的问题。如果给定“类型”的赋值可以如此路由，则证明了这一点。特别感兴趣的是，对于距离3和固定类型，是否可以获得最小距离和拥塞1。这显示在n/spl /6;另一方面，该方法提出了可能的反例。此外，还显示了H/sub /中的距离2排列具有拥塞1路由。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Problems on routing bounded distance assignments in hypercubes

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

专用汽车

自引率

0.00%

发文量

8000