Modelling and performance study of finite-buffered blocking multistage interconnection networks supporting natively 2-class priority routing traffic
نویسندگان
چکیده
In this paper, we model, analyze and evaluate the performance of a 2-class priority architecture for finite-buffered Multistage Interconnection Networks (MINs). The MIN operation modelling is based on a state diagram, which includes the possible MIN states, transitions and conditions under which each transition occurs. Equations expressing state and transition probabilities are subsequently given, providing a formal model for evaluating the MIN’s performance. The proposed architecture’s performance is subsequently analyzed using simulations; operational parameters, including buffer length, MIN size, offered load and ratios of high priority packets which are varied across experiments to gain insight on how each parameter affects the overall MIN performance. The 2-class priority MIN performance is compared against the performance of single priority MINs, detailing the performance gains and losses for packets of different priorities. Performance is assessed by means of the two most commonly used factors, namely packet throughput and packet delay, while a performance indicator combining both individual factors is introduced, computed and discussed. The findings of this study can be used by network and interconnection system designers in order to deliver efficient systems while minimizing the overall cost. The performance evaluation model can also be applied to other network types, providing the necessary data for network designers to select optimal values for network operation parameters.
منابع مشابه
Performance Study of Multilayered Multistage Interconnection Networks under Hotspot Traffic Conditions
The performance of Multistage Interconnection Networks (MINs) under hotspot traffic, where some percentage of the traffic is targeted at single nodes, which are also called hot spots, is of crucial interest. The prioritizing of packets has already been proposed at previous works as alleviation to the tree saturation problem, leading to a scheme that natively supports 2-class priority traffic. I...
متن کاملModelling and performance evaluation of a novel internal-priority routing scheme for finite-buffered multistage interconnection networks
Dr. Dimitris Vasiliadis is currently head of the Network Operations Center (NOC) of Technological Educational Institute (T.E.I.) of Epirus, a node of the Greek Research and Technology Network (GRNET). He has published more than 30 papers. He has been a PC member and referee in various international journals and conferences. His research interests include Performance Analysis of Networking and C...
متن کاملPerformance Analysis of Packet Switching Interconnection Networks with Finite Buffers
In this paper, a mathematical method for analysis of synchronous packet-switching interconnection networks with jinite buffering capacity at the output of switching elements is presented. The proposed mathematical method is general in that it analyzed interconnection networks under uniform and nonuniform traflc with blocking. The existing methods for analysis of buffered interconnection network...
متن کاملAn analytical model for the performance evaluation of multistage interconnection networks with two class priorities
The aim of this paper is to develop an analytical method for performance evaluation of double prioritized Multistage Interconnected Networks (MINs) with single or multilayers and backpressure operation which provide service differentiation and QoS guarantee to an end application running over next generation Internet or Grid systems. Specifically, a new architecture of switching elements is used...
متن کاملClass-based weighted fair queuing scheduling on quad-priority Delta Networks
Contemporary networks accommodate handling of multiple priorities, aiming to provide suitable QoS levels to different traffic classes. In the presence of multiple priorities, a scheduling algorithm is employed to select each time the next packet to transmit over the data link. Class-based Weighted Fair Queuing (CBWFQ) scheduling and its variations, is widely used as a scheduling technique, sinc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Network and Computer Applications
دوره 36 شماره
صفحات -
تاریخ انتشار 2013