Adaptive Virtual-Channel Flow Control in MIN Switches with Bursty Traffic
ثبت نشده
چکیده
This paper is concerned with performance analysis of the MIN (Multistage Interconnection Network) with virtual channel flow control under bursty traffic. In the past, many research efforts have been devoted to the performance analysis of buffered MIN switches. Most of these analyses, however, assume that a burst of cells is indivisible when transferred across stages of a MIN switch, or that the traffic consists of discrete packets of uniform length. The effect of employing virtual-channel flow control to process burst of varying lengths through the MIN switch remains largely unknown at present. In this paper, we consider the use of virtual channels to make efficient use of MIN physical link resource. We derive closed forms for switch latency in term of some system parameters. We also construct a simulator for the proposed MIN. Simulations are based on various different kinds of network parameters. Simulation results are compared against the analytical results for verifying their accuracy. Extensive simulation has been performed focusing on the relationship among packet delay and burst length, virtual channel number and virtual channel length. We proposed an auto-adjusting virtual channel allocation method, namely Adaptive Virtual Channel Allocation Policy or AVP. This proposed approach can always provide a better performance than those with fixed virtual channel size. This is true with different or varying degrees of traffic bursts. We use simulation to prove this.
منابع مشابه
Mathematical Modelling of Torus Networks under Bursty Traffic
Many performance models for interconnection networks in parallel computing systems have been reported under the assumption of non-bursty Poisson arrival process. However, network traffic loads often exhibit bursty nature, which can markedly degrade the system performance. In order to develop a cost-efficient performance evaluation tool, this paper proposes a new analytical model for torus netwo...
متن کاملPerformance Evaluation of Rate-Based Congestion Control Algorithm with Explicit Rate Switch Algorithms for Bursty Traffic
A rate-based congestion control algorithm regulates cell emission processes of source end systems according to feedback information from the network in order to utilize network resources. Although behavior of source and destination end systems have been standardized by the ATM Forum, operation algorithm of intermediate ATM switches are left to manufacturers. Many types of switch algorithms have...
متن کاملk -ary n -trees: High Performance Networks for Massively Parallel Architectures
The past few years have seen a rise in popularity of massively parallel architectures that use fat-trees as their interconnection networks. In this paper we study the communication performance of a parametric family of fat-trees, the k-ary n-trees, built with constant arity switches interconnected in a regular topology. Through simulation on a 4-ary 4-tree with 256 nodes, we analyze some varian...
متن کاملHigh Performance Networks for Massively Parallel Architectures
The past few years have seen a rise in popularity of massively parallel architectures that use fat-trees as their interconnection networks. In this paper we study the communication performance of a parametric family of fat-trees, the k-ary n-trees, built with constant arity switches interconnected in a regular topology. Through simulation on a 4-ary 4-tree with 256 nodes, we analyze some varian...
متن کاملLoad Balancing in Internet Using Adaptive Packet Scheduling and Bursty Traffic Splitting
In this paper, we propose an architecture for load balancing, which contains an adaptive packet scheduler with a bursty traffic splitting algorithm. The scheduler has one classifier which classifies the flows into aggressive and normal flow. Aggressive flows are treated as high priority flows. Based on the buffer occupancy threshold, a trigger handler checks for load unbalance of the network an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006