首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Circuit switching with input queuing: an analysis for the d-dimensional wraparound mesh and the hypercube
【24h】

Circuit switching with input queuing: an analysis for the d-dimensional wraparound mesh and the hypercube

机译:具有输入排队的电路切换:d维环绕式网格和超立方体的分析

获取原文
获取原文并翻译 | 示例

摘要

We analyze circuit switching in a multiprocessor network, where connection requests (or sessions) arrive at each node of the network according to a Poisson process with rate /spl lambda/. Each session joins the appropriate input-queue at its source node, and, upon advancing to the head of the queue, transmits a setup packet to establish a connection. If the setup packet is successful, it reserves the links on the path for the duration of the session, and the session is served without interruptions. Otherwise, the connection request remains queued at the source, and subsequent attempts are made to establish the circuit. We analyze the queue of connection requests at the input-buffer of a network link, and obtain analytic expressions for the stability region, the average queuing delay, the average connection time, the average waiting time, and the average total delay, which show how these parameters depend on system variables, such as network dimension and session arrival rate. The queuing analysis focuses on the input-queue of a particular link, and accounts for the interactions with queues of other links through the retrial attempts and the associated probability of success. The queuing analysis is independent of the particular network topology under consideration, as long as the probability that a session arriving at a random time successfully establishes a connection can be calculated for that network. Simulations demonstrate the close agreement between the observed network behavior and that predicted by the analysis.
机译:我们分析多处理器网络中的电路交换,其中连接请求(或会话)根据泊松过程(速率为/ spl lambda /)到达网络的每个节点。每个会话在其源节点处加入适当的输入队列,并在前进到队列的开头时,发送建立数据包以建立连接。如果建立数据包成功,它将在会话持续时间内将路径上的链接保留下来,并为会话提供服务而不会中断。否则,连接请求将在源处保持排队状态,并随后尝试建立电路。我们分析了网络链接的输入缓冲区中的连接请求队列,并获得了稳定区域,平均排队延迟,平均连接时间,平均等待时间和平均总延迟的解析表达式,它们显示了如何这些参数取决于系统变量,例如网络规模和会话到达率。排队分析的重点是特定链接的输入队列,并通过重试尝试和相关的成功概率说明与其他链接的队列的交互。排队分析独立于所考虑的特定网络拓扑,只要可以为该网络计算到达随机时间的会话成功建立连接的概率即可。仿真表明观察到的网络行为与分析预测的行为之间的紧密一致性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号