A general packet replication scheme for multicasting in interconnection networks

A general packet replication scheme for multicasting in interconnection networks
复制标题

互连网络中多播的通用数据包复制方案

DOI:
10.1109/infcom.1995.515900
复制
发表时间:
1995
期刊:
Proceedings of INFOCOM'95
影响因子:
--
通讯作者:
S. Liew
S. Liew
中科院分区:
--
文献类型:
--
作者:
S. Liew

文献摘要

被引文献

相似文献

宽带分组交换机和城域网中的多播可以通过首先复制分组,然后将它们路由到它们的目的地来实现。本文研究了一种非常简单但通用的复制方案,可应用于任意互连网络拓扑结构。数据包的复制过程会根据网络拓扑和流量状况进行自我调整。通过该方案,复制活动的热点被扩散,该方案自动地将部分复制工作移动到不太活跃的网络区域。该方案可以潜在地用于网络(例如,Manhattan-street网络),其中多播被认为是固有困难。基本问题和关键问题领域的布局,并提出解决这些问题的解决方案。详细研究了该复制算法在混洗交换复制网络中的性能及其实现(逻辑图级)。实验结果表明,该算法的性能随着网络维数的增加而提高。
Multicasting in broadband packet switches and metropolitan networks can be achieved by first replicating the packets and then routing them to their destinations. This paper studies a very simple but general replication scheme that can be applied to arbitrary interconnection-network topologies. The replication process of a packet adapts itself according to the network topology and the traffic condition. Hot spots of replication activities are diffused by this scheme which automatically moves part of the replication efforts to less active network regions. The scheme can potentially be used in networks (e.g., the Manhattan-street network) in which multicasting were thought to be inherently difficult. Fundamental issues and critical problem areas are laid out, and solutions addressing them are proposed. The performance of the replication algorithm and its implementation (logic diagram level) in the shuffle-exchange copy network are investigated in detail. It is found that the performance of the algorithm improves with the increase of network dimensions.