• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Throughput Region of Finite-Buffered Networks
【24h】

Throughput Region of Finite-Buffered Networks

机译：有限缓冲网络的吞吐量区域

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Most of the current communication networks, including the Internet, are packet switched networks. One of the main reasons behind the success of packet switched networks is the possibility of performance gain due to multiplexing of network bandwidth. The multiplexing gain crucially depends on the size of the buffers available at the nodes of the network to store packets at the congested links. However, most of the previous work assumes the availability of infinite buffer-size. In this paper, we study the effect of finite buffer-size on the performance of networks of interacting queues. In particular, we study the throughput of flow-controlled loss-less networks with finite buffers. The main result of this paper is the characterization of a dynamic scheduling policy that achieves the maximal throughput with a minimal finite buffer at the internal nodes of the network under memory-less (e.g., Bernoulli IID) exogenous arrival process. However, this ideal performance policy is rather complex and, hence, difficult to implement. This leads us to the design of a simpler and possibly implementable policy. We obtain a natural trade-off between throughput and buffer-size for such implementable policy. Finally, we apply our results to packet switches with buffered crossbar architecture
机译：当前的大多数通信网络，包括Internet，都是分组交换网络。分组交换网络成功的主要原因之一是由于网络带宽的多路复用而可能提高性能。多路复用增益主要取决于网络节点上可用于在拥塞链路上存储数据包的缓冲区的大小。但是，大多数以前的工作都假定可用的缓冲区大小是无限的。在本文中，我们研究了有限缓冲区大小对交互队列网络性能的影响。特别是，我们研究了具有有限缓冲区的流控制无损网络的吞吐量。本文的主要结果是表征动态调度策略，该策略在无内存（例如Bernoulli IID）外生到达过程下以最小的有限缓冲区在网络内部节点上实现了最大吞吐量。但是，这种理想的性能策略相当复杂，因此难以实施。这导致我们设计了一个更简单且可能实现的策略。对于这种可实施的策略，我们在吞吐量和缓冲区大小之间获得了自然的平衡。最后，我们将结果应用于具有缓冲交叉开关架构的数据包交换机

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号