Maximum delivery time and hot spots in ServerNetTM topologies

Abstract This paper will center on analysis of the performance characteristics of ServerNet topologies, concentrating on the prediction, through simulation and statistical analysis, of the maximum two-way delivery time, the identification of congested links (hot spots) and tree saturation. ServerNet TM , developed by Tandem Computers Inc., is a wormhole-routed, packet-switched, point-to-point network, with special attention paid to reducing latency and to assuring reliability. ServerNet uses multiple high-speed, low-cost routers to rapidly switch data directly between data sources and destinations. The maximum two-way delivery time is necessary for determining the values of timeout counters, which are relevant to the fault-tolerant aspect of the system, and the QoS guarantees. Hot spots may cause the occurrence of tree saturation in the network i.e., where an individual tree will become congested (tree saturation) while all other trees are mostly idle, which leads to significant performance degradation. Our study is based on data generated by a simulation tool. Statistical analysis and inference methods were used to process the samples generated by the simulator and to obtain estimates for the maximum two-way packet delivery time. These methods were also used to determine the number of the samples that were required to produce estimates of the desired accuracy. Both the degree of confidence and the percentage of packets are determined by the number of samples generated by the simulator. This allows us to control the quality and accuracy of the estimate to suit our needs. Link usage statistics were recorded by the simulator for the purpose of performing a detailed investigation of congestion effects and hot spots. The study of the static and dynamic link usage statistics revealed that the extreme values of the two-way maximum delivery time were caused by links operating under heavy traffic loads and that under certain traffic patterns a tree saturation effect occurs.

[1]  William Joel Watson,et al.  Performance Modeling of ServerNetTM Topologies , 1996 .

[2]  C.M. Cunningham,et al.  Fault-tolerant adaptive routing for two-dimensional meshes , 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

[3]  S. L. Scott,et al.  Using feedback to control tree saturation in multistage interconnection networks , 1989, ISCA '89.

[4]  H. Li,et al.  Meeting delay requirements in computer networks with wormhole routing , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[5]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[6]  P. J. Green,et al.  Probability and Statistical Inference , 1978 .

[7]  Suresh Chalasani,et al.  A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

[8]  Robert W. Horst,et al.  A flexible ServerNet-based fault-tolerant architecture , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[9]  G.D. Pifarre,et al.  Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations , 1994, IEEE Trans. Parallel Distributed Syst..

[10]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[11]  Robert W. Horst.  TNet: A Reliable System Area Network , 1995, IEEE Micro.

[12]  Richard M. Fujimoto,et al.  Multicomputer Networks: Message-Based Parallel Processing , 1987 .

[13]  Howard Jay Siegel,et al.  Using a Multipath Network for Reducing the Effects of Hot Spots , 2022 .

[14]  Mary K. Vernon,et al.  Performance Analysis of Mesh Interconnection Networks with Deterministic Routing , 1994, IEEE Trans. Parallel Distributed Syst..

[15]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[16]  Robert W. Horst,et al.  ServerNet deadlock avoidance and fractahedral topologies , 1996, Proceedings of International Conference on Parallel Processing.

[17]  Rene L. Cruz,et al.  Bounds on Maximum Delay in Networks with Deflection Routing , 1995, IEEE Trans. Parallel Distributed Syst..

[18]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[19]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[20]  R. Lyman Ott.,et al.  An introduction to statistical methods and data analysis , 1977 .

[21]  Sumit Ghosh,et al.  Modeling and distributed simulation of a broadband-ISDN network , 1993, Computer.

[22]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.