Control algorithm and performance analysis model of multi-log2N switching networks

被引：0
|
作者：
机构：
[1] School of Computer Science and Engineering, University of Electronic Science and Technology of China
[2] Department of Computer Science and Technology, Tsinghua University
[3] School of Computer, China West Normal University
来源：
Liu, X.-F. (xhxfliu@163.com) | 1600年 / Chinese Academy of Sciences卷 / 24期
关键词：
Blocking; Control algorithm; MIN; Multi-log[!sub]2[!/sub]N; Self-routing; Switching network;
D O I：
10.3724/SP.J.1001.2013.04251
中图分类号：
学科分类号：
摘要：
Although high-speed multi-plane switching networks have removed their internal conflict problem, a routing control algorithm is necessary for realizing conflict-free routing. Otherwise, the conflict phenomenon cannot be totally avoided. This is because the routing plane may be chosen inappropriately by the incoming packet at the input stage. Therefore, a control algorithm based on the idea of conflict links set is presented in this paper. This algorithm controls the allocation of packets among routing planes in the multi-log2N switching networks, and hence, the conflict-free routing is totally guaranteed. Moreover, it is not only applicable for the RNB and SN B, but also suitable for unicast and multicast. On the other hand, inner link conflicts are removed in multi-log2N networks. The switching efficiency is improved, but no performance analysis models can be used to analyze the switching performance of Multi-log2N switching networks. So an analysis model based on embedded Markov chain is proposed in this paper, and is adopted to analyze the queue management and the relevant performance measures in detail, such as the mean waiting time, queue length and the probability of packets loss. All these conclusions are capable of providing well theoretical support for the design of the optical switching architecture based on multi-log2N switching networks. © Copyright 2013, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：593 / 603
页数：10
相关论文
共 22 条
  • [1] Zhang X.P., Liu Z.H., Zhao Y.J., Guan H.T., Scalable router, Ruanjian Xuebao/Journal of Software, 19, 6, pp. 1452-1464, (2008)
  • [2] Zheng S.Q., Gumaste A., Shen H., A parallel self-routing rearrangeable nonblocking multi-log<sub>2</sub>N photonic switching network, IEEE/ACM Trans. on Networking, 18, 2, pp. 529-539, (2010)
  • [3] Lea C.T., Multi-log<sub>2</sub>N networks and their applications in high-speed electronic and photonic switching systems, IEEE Trans. on Communications, 38, 10, pp. 1740-1749, (1990)
  • [4] Lea C.T., Shyy D.J., Tradeoff of horizontal decomposition versus vertical stacking in rearrangeable nonblocking networks, IEEE Trans. on Communications, 39, 6, pp. 899-904, (1991)
  • [5] Tscha Y., Lee K.H., Yet another result on multi-log<sub>2</sub>N networks, IEEE Trans. on Communications, 47, 9, pp. 1425-1431, (1999)
  • [6] Goke L.R., Lipovski G.J., Banyan networks for partitioning multiprocessor systems, Proc. of the 1st Annual Symp. on Computer Architecture, pp. 21-28, (1973)
  • [7] Patel J.H., Performance of processor-memory interconnections for multiprocessors, IEEE Trans. on Computers, C-30, 10, pp. 771-780, (1981)
  • [8] Kumar M., Jump J.R., Performance of unbuffered shuffle-exchange networks, IEEE Trans. on Computers, C-35, 6, pp. 573-577, (1986)
  • [9] Kruskal C.P., Snir M., The performance of multistage interconnection networks for multiprocessors, IEEE Trans. on Computers, C-32, 12, pp. 1091-1098, (1983)
  • [10] Theimer T.H., Rathgeb E.P., Huber M.N., Performance analysis of buffered Banyan networks, IEEE Trans. on Communications, 39, 2, pp. 269-277, (1991)
123