【24h】

Multi-hop all-to-all broadcast on WDM optical networks

机译:WDM光网络上的多跳全播

获取原文

摘要

It is known that the minimum number of wavelengths for realizingall-to-all broadcast (gossiping) in one-hop of optical routing on thering (resp. the 2-dimensional torus) of N nodes is [[N2/4]/2](resp. cN1+1/2,c≈1/8). These numbers can be too large evenfor moderate values of N. One approach to reduce the number ofwavelengths is to realize gossiping in multi-hops of routing. We provethat gossiping can be realized in k-hops byckN1+1k/(ck≈1/22+1k/)wavelengths on the ring, c'N1+1(2k)/(c'≈1/4) wavelengthson the 2-dimensional torus, and c'N1+1(3k)/ wavelengths onthe 3-dimensional torus on the simple model: in the (j+1)st hop eachnode just forwards each message received in the jth hop to its nextdestinations. We also give the upper bounds on the numbers ofwavelengths 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 jthhop into one and sends the merged message to its next destinations
机译:众所周知,用于实现的最小波长数 一站式光路由上的全部广播 N个节点的环(分别是二维环)为[[N 2 / 4] / 2] (分别为cN 1 + 1/2 ,c≈ 1/8)。这些数字甚至可能太大 减少N的数量的一种方法 波长是为了在多跳路由中实现闲聊。我们证明 可以通过k跳实现闲聊 c k N 1 + 1 k /(c k ≈ 1/2 2 + 1 k /) 环上的波长,c'N 1 + 1 (2k)/(c'≈ 1/4)波长 在二维圆环上,而c' N1 + 1 (3k)/波长在 简单模型上的3维环面:在第(j + 1)个跃点中 节点只是将在第j跳中接收到的每个消息转发到其下一个 目的地。我们还给出了 环的两跳和三跳闲聊的波长, 合并模型上的2维环面和3维环面: 每个节点第(j + 1)个跃点可以合并第j个接收到的不同消息 跳入一个并将合并的消息发送到其下一个目的地

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号