WDM光网络中的多跳全对全广播

Q. Gu, S. Peng
{"title":"WDM光网络中的多跳全对全广播","authors":"Q. Gu, S. Peng","doi":"10.1109/ICPPW.2001.951964","DOIUrl":null,"url":null,"abstract":"It is known that the minimum number of wavelengths for realizing all-to-all broadcast (gossiping) in one-hop of optical routing on the ring (resp. the 2-dimensional torus) of N nodes is [[N/sup 2//4]/2] (resp. cN/sup 1+1/2/,c/spl ap/1/8). These numbers can be too large even for moderate values of N. One approach to reduce the number of wavelengths is to realize gossiping in multi-hops of routing. We prove that gossiping can be realized in k-hops by c/sub k/N/sup 1+1/k/(c/sub k//spl ap/1/2/sup 2+1/k/) wavelengths on the ring, c'N/sup 1+1/(2k)/(c'/spl ap/1/4) wavelengths on the 2-dimensional torus, and c'/sup N1+1/(3k)/ wavelengths on the 3-dimensional torus on the simple model: in the (j+1)st hop each node just forwards each message received in the jth hop to its next destinations. We also give the upper bounds on the numbers of wavelengths for gossiping in two-hops and three-hops for the ring, 2-dimensional torus, and 3-dimensional torus on the merge model: in the (j+1)st hop each node can merge different messages received in the jth hop into one and sends the merged message to its next destinations.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"52 1","pages":"291-296"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-hop all-to-all broadcast on WDM optical networks\",\"authors\":\"Q. Gu, S. Peng\",\"doi\":\"10.1109/ICPPW.2001.951964\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is known that the minimum number of wavelengths for realizing all-to-all broadcast (gossiping) in one-hop of optical routing on the ring (resp. the 2-dimensional torus) of N nodes is [[N/sup 2//4]/2] (resp. cN/sup 1+1/2/,c/spl ap/1/8). These numbers can be too large even for moderate values of N. One approach to reduce the number of wavelengths is to realize gossiping in multi-hops of routing. We prove that gossiping can be realized in k-hops by c/sub k/N/sup 1+1/k/(c/sub k//spl ap/1/2/sup 2+1/k/) wavelengths on the ring, c'N/sup 1+1/(2k)/(c'/spl ap/1/4) wavelengths on the 2-dimensional torus, and c'/sup N1+1/(3k)/ wavelengths on the 3-dimensional torus on the simple model: in the (j+1)st hop each node just forwards each message received in the jth hop to its next destinations. We also give the upper bounds on the numbers of wavelengths for gossiping in two-hops and three-hops for the ring, 2-dimensional torus, and 3-dimensional torus on the merge model: in the (j+1)st hop each node can merge different messages received in the jth hop into one and sends the merged message to its next destinations.\",\"PeriodicalId\":93355,\"journal\":{\"name\":\"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops\",\"volume\":\"52 1\",\"pages\":\"291-296\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPPW.2001.951964\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2001.951964","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

已知环上单跳光路由中实现全对全广播(八卦)的最小波长数。N个节点的二维环面)为[[N/sup 2//4]/2]。cN/sup 1+1/2/,c/spl ap/1/8)。即使对于中等的n值,这些数字也可能太大。减少波长数量的一种方法是在路由的多跳中实现八卦。在简单模型上,我们证明了k跳中的八卦可以通过环上的c/sub k/N/sup 1+1/k/(c/sub k//spl ap/1/2/sup 2+1/k/)波长、二维环面上的c'N/sup 1+1/(2k)/(c'/spl ap/1/4)波长和三维环面上的c'/sup N1+1/(3k)/波长来实现:在(j+1)st跳中,每个节点只是将第j跳接收到的每个消息转发到下一个目的地。我们还给出了合并模型上环、二维环面和三维环面的两跳和三跳八卦的波长数的上界:在(j+1)st跳中,每个节点可以将第j跳接收到的不同消息合并为一个,并将合并后的消息发送到下一个目的地。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-hop all-to-all broadcast on WDM optical networks
It is known that the minimum number of wavelengths for realizing all-to-all broadcast (gossiping) in one-hop of optical routing on the ring (resp. the 2-dimensional torus) of N nodes is [[N/sup 2//4]/2] (resp. cN/sup 1+1/2/,c/spl ap/1/8). These numbers can be too large even for moderate values of N. One approach to reduce the number of wavelengths is to realize gossiping in multi-hops of routing. We prove that gossiping can be realized in k-hops by c/sub k/N/sup 1+1/k/(c/sub k//spl ap/1/2/sup 2+1/k/) wavelengths on the ring, c'N/sup 1+1/(2k)/(c'/spl ap/1/4) wavelengths on the 2-dimensional torus, and c'/sup N1+1/(3k)/ wavelengths on the 3-dimensional torus on the simple model: in the (j+1)st hop each node just forwards each message received in the jth hop to its next destinations. We also give the upper bounds on the numbers of wavelengths for gossiping in two-hops and three-hops for the ring, 2-dimensional torus, and 3-dimensional torus on the merge model: in the (j+1)st hop each node can merge different messages received in the jth hop into one and sends the merged message to its next destinations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信