SIMULATION STUDY OF INTERCONNECTION NETWORKS WITH VIRTUAL CUT-THROUGH ROUTING

被引:0
|
作者
Rykalova, Yelena [1 ]
Levitin, Lev B. [2 ]
机构
[1] UMass Lowell, Dept Comp Sci, 220 Pawtucket St, Lowell, MA 01854 USA
[2] Boston Univ, ECE Dept, 8 St Marys St, Boston, MA 02215 USA
关键词
computer interconnection networks; network torus topology; virtual cut-through routing; latency; saturation in networks;
D O I
10.23919/springsim.2019.8732919
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A simple network model with torus topology and the virtual cut-through routing has been considered in order to find out and analyze certain relationships between network parameters, load and performance. Simulation experiments for various values of network parameters (mesh size, message path length, and message length) have been performed. It is found that if the mesh linear dimension is at least twice as large as the message path length (the distance from source to destination) the network behavior (latency and saturation point) does not depend on the mesh size. Both theoretical and empirical results show that the saturation point is inversely proportional to the message length. If the network is in the steady state, a good agreement with Little's theorem has been observed.
引用
收藏
页数:12
相关论文
共 50 条
  • [21] Optimized broadcasting and multicasting protocols in cut-through routed networks
    Cohen, J
    Fraigniaud, P
    Konig, JC
    Raspaud, A
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (08) : 788 - 802
  • [22] THE EFFECT OF CUT-THROUGH SWITCHING ON THE PERFORMANCE OF BUFFERED BANYAN NETWORKS
    WIDJAJA, I
    LEONGARCIA, A
    MOUFTAH, HT
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1993, 26 (01): : 139 - 159
  • [23] Global Round Robin: Efficient Routing With Cut-Through Switching in Fat-Tree Data Center Networks
    Qian, Zhemin
    Fan, Fujie
    Hu, Bing
    Yeung, Kwan L.
    Li, Liyan
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (05) : 2230 - 2241
  • [24] Optimal MAC packet size in networks without cut-through routing (vol, 2, pg 902, 2003)
    Mitlin, V
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2003, 2 (06) : 1275 - 1275
  • [25] VIRTUAL CUT-THROUGH - NEW COMPUTER-COMMUNICATION SWITCHING TECHNIQUE
    KERMANI, P
    KLEINROCK, L
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1979, 3 (04): : 267 - 286
  • [26] Cut-through connections of graphs
    Matisova, Daniela
    Valiska, Juraj
    CARPATHIAN JOURNAL OF MATHEMATICS, 2025, 41 (02) : 455 - 464
  • [27] TOWARDS PERFORMANCE IMPROVEMENT OF CUT-THROUGH SWITCHING IN COMPUTER-NETWORKS
    ILYAS, M
    MOUFTAH, HT
    PERFORMANCE EVALUATION, 1986, 6 (02) : 125 - 133
  • [28] A comparison of router architectures for virtual cut-through and wormhole switching in a NOW environment
    Duato, J
    Robles, A
    Silla, F
    Beivide, R
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (02) : 224 - 253
  • [29] PERFORMANCE ANALYSIS OF VIRTUAL CUT-THROUGH SWITCHING IN HARTS - A HEXAGONAL MESH MULTICOMPUTER
    DOLTER, JW
    RAMANATHAN, P
    SHIN, KG
    IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (06) : 669 - 680
  • [30] Uniform Traffic Patterns using Virtual Cut-Through Flow Control on VMMN
    Hag, Ala Ahmed Yahya
    Rahman, M. M. Hafizur
    Nor, Rizal Mohd
    Sembok, Tengku Mohd Tengku
    Miura, Yasuyuki
    Inoguchi, Yasushi
    INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND COMPUTATIONAL INTELLIGENCE (ICCSCI 2015), 2015, 59 : 400 - 409