PERFORMANCE COMPARISON OF H* MESH AND HYPERCUBE INTERCONNECTION OF LANs

Abstract

Computer Networks is an area that focuses on the study of the communication interface, connecting strategy,, access, routing etc. In implementing a network, it Is necessary first to determine whether the network will function properly in the specific environment and then to predict the performance of the network and compare it to the system requirements. Simulation modelling is presently the most effective means of performing a detailed analysis of a network. During the past few years H-mesh (Hexagonal mesh) and Hypercube structures had emerged as most widely used interconnection networks because both are capable of interconnecting a large number of LANs with heavy traffic. This thesis comprises of the study of performance of H-mesh and Hypercube structures when subjected to both uniform and non-uniform traffic. Network parameters, such as offered load, packet size, buffer size and transmission rate have been varied to demonstrate their effects on the performance. A new elegant and totally' distributed algorithm is proposed to further improve the H-mesh performance. finally the simulation results and program listing are presented.