Performance Analysis of Hierarchical-Ring Network

• Main Authors: Kin-Tong Yuen, 袁建東
• Other Authors: Ling-Yang Kung
• Format: Others
• Language: zh-TW
• Published: 1996
• Online Access: http://ndltd.ncl.edu.tw/handle/22627116320815280491

碩士 === 國立成功大學 === 電機工程研究所 === 84 === A new Hierarchical Ring (H-Ring) architecture for high-speed asynchronous packet-switched telecommunications networks is proposed and the design of H-Ring networks is considered. We investigate the topological properties of the H-Ring, including the diameter, cost, average distance, etc. Also, an analysis of the performance, in terms of average message delay and aggregate throughput, is presented. The basic H-Ring architecture is an interconnected-ring system with several levels. A higher level ring connects a number of lower level rings through bridges while each ring obeys the buffer- insertion access and flow control mechanism with destination removal policy. Buffer inserting rings (BIRs) are attractive because their simple interfaces allow for spatial bandwidth reuse. Hierarchies are attractive because their diameter grow only with the logarithm of the number of stations and the simpling connections. Hence H-Ring provides on one hand a service in which any node can try to transmit asynchronously as much as it can, and on the other hand the network access and flow control ensure self-routing. We model analytically the H- Ring under assumptions of symmetry architecture and homogeneous traffic, infinite buffers and a first-in, first-out (FIFO) queuing discipline at each node (station or bridge). The performance analysis views the queue at an arbitrary node as a M/G/1 system with nonpreemptive priority. The results obtained from the analytical models are compared to those obtained from simulation. They show a good agreement.