## Performance Analysis of dual priority single-buffered blocking Multistage Interconnection Networks (2007)

Venue: | Proceedings of the third International Conference on Networking and Services (ICNS’07), IEEE Computer Society pres |

Citations: | 1 - 1 self |

### BibTeX

@INPROCEEDINGS{Vasiliadis07performanceanalysis,

author = {D. C. Vasiliadis and G. E. Rizos and C. Vassilakis},

title = {Performance Analysis of dual priority single-buffered blocking Multistage Interconnection Networks},

booktitle = {Proceedings of the third International Conference on Networking and Services (ICNS’07), IEEE Computer Society pres},

year = {2007}

}

### OpenURL

### Abstract

In this paper a novel architecture of dual priority single-buffered blocking Multistage Interconnection Networks (MINs) is presented. We analyzed their performance in the uniform traffic condition under various loads using simulations. We compared the dual priority architecture against a single priority MIN, by gathering metrics for the two most important network performance factors, namely packet throughput and the mean time a packet needs to traverse the network. We demonstrated the gain of the high priority packets against the low priority packets under different configuration schemas. In this paper we focus on studying the influence of the priority bit in the header field of transmitted packets on the performance of high and low priority traffic of a MIN. Performance prediction before actual network implementation and understanding the impact of parameter settings in a MIN setup are valuable assets for network designers for minimizing overall deployment costs and delivering efficient networks. 1.

### Citations

547 |
TCP/IP Illustrated, Volume 1: The Protocols
- Stevens
- 1994
(Show Context)
Citation Context ...red better quality of service than others. Packets with real-time requirements (e.g. from streaming media) vs. non realtime packets (e.g. file transfer), and out-of-band data vs. ordinary TCP traffic =-=[20]-=- are two examples of such differentiations. There are already several commercial switches which accommodate traffic priority schemes, such as [6, 7]. These switches consist internally of single priori... |

71 |
Banyan Networks for Partitioning Multiprocessor Systems
- Goke, Lipovski
- 1973
(Show Context)
Citation Context ...into account the overall performance they offer. A significant advantage of MIN-type interconnection systems, is their ability to route multiple communication tasks concurrently. MINs with the Banyan =-=[9]-=- property are proposed to connect a large number of processors to establish a multiprocessor system; they have also received considerable interest in the development of packet-switched networks. NonBa... |

51 |
Performance analysis of a packet switch based on singlebuffered banyan network
- Jenq
- 1983
(Show Context)
Citation Context ...ork cycles, before collecting the statistics. Fig. 2 shows the normalized throughput of a single buffered MIN with 6 stages as a function of the probability of arrivals for the three classical models =-=[12, 17, 21]-=- and our simulation. All models are very accurate at low loads. Accuracy reduces as input load increases. Especially, when input load approaches thesnetwork maximum throughput, the accuracy of Jenq's ... |

27 | Performance Analysis of Buffered Banyan Networks - Theimer, Rathgeb, et al. - 1991 |

26 |
Performance analysis of finite buffered multistage interconnection networks
- Mun, Youn
- 1994
(Show Context)
Citation Context ...ork cycles, before collecting the statistics. Fig. 2 shows the normalized throughput of a single buffered MIN with 6 stages as a function of the probability of arrivals for the three classical models =-=[12, 17, 21]-=- and our simulation. All models are very accurate at low loads. Accuracy reduces as input load increases. Especially, when input load approaches thesnetwork maximum throughput, the accuracy of Jenq's ... |

25 | Performance Analysis of Finite-Buffered Multistage Interconnection Networks with a General Traffic Pattern. Joint International Conference on Measurement and Modeling of Computer Systems
- Lin, Kleinrock
- 1991
(Show Context)
Citation Context ...so examined by Jurczyk [13], and Turner [22] dealt with multicast in Clos networks, as a subclass of MINs. Atiquzzaman [1] focused only on non-uniform arriving traffic schemes. Furthermore, Kleinrock =-=[14]-=- discusses approaches that examine the case of Poisson traffic on inputs of a MIN. In the industry domain, Cisco has built its new CRS-1 router [3, 4] as a multistage switch fabric. The switch fabric ... |

21 |
Stohastic Petri Nets
- Haas
- 2002
(Show Context)
Citation Context ...theory. Some authors that dealt with Markov chains also employed Petri nets as a modeling method. In the literature, there are several approaches that focus on Petri nets as those of German [8], Haas =-=[10]-=- and Lindermann [15]. Hsiao [11] and Theimer [21] studied MINs with uniform load traffic on inputs. Hot-spot traffic performance was also examined by Jurczyk [13], and Turner [22] dealt with multicast... |

13 | Performance Analysis of Single-Buffered Multistage Interconnection Networks - Hsiao, Chen - 1991 |

9 | Multirate Clos Networks
- Turner
- 2003
(Show Context)
Citation Context ... of German [8], Haas [10] and Lindermann [15]. Hsiao [11] and Theimer [21] studied MINs with uniform load traffic on inputs. Hot-spot traffic performance was also examined by Jurczyk [13], and Turner =-=[22]-=- dealt with multicast in Clos networks, as a subclass of MINs. Atiquzzaman [1] focused only on non-uniform arriving traffic schemes. Furthermore, Kleinrock [14] discusses approaches that examine the c... |

7 |
Performance study of an input queueing packet switch with two priority classes
- Chen, Guerin
- 1991
(Show Context)
Citation Context ...s, such as [6, 7]. These switches consist internally of single priority SEs and employ two priority queues forseach input port, where packets are queued based on their priority level. Chen and Guerin =-=[5]-=- studied an (N X N) non-blocking packet switch with input queues, built using one-priority SEs. Ng and Dewar [18] introduced a simple modification to load-sharing replicated buffered Banyan Networks t... |

7 |
Generating Systems of Equations for Performance Evaluation of Buffered Multistage Interconnection Networks
- Tutsch
- 2002
(Show Context)
Citation Context ...N) MIN. In our simulation n is assumed to be n=6, 8, 10. 4. Simulation and Performance Results The performance of MINs is usually determined by modeling, using simulation [23] or mathematical methods =-=[24]-=-. In this paper we estimated the network performance using simulations. We developed a general simulator for MINs in a packet communication environment. The simulator can handle several switch types, ... |

6 |
Processor-memory interconnections for mutliprocessors
- Patel
- 1979
(Show Context)
Citation Context ...ll stages, as opposed to the crossbar network which requires O(N 2 ) links. A configuration of an 8 X 8 delta network, one of the most widely used classes of Banyan MINs, which were proposed by Patel =-=[19]-=-, is shown below: Figure 1. An 8 X 8 delta-2 network A MIN is assumed to operate under the following conditions: • The network clock cycle consists of two phases. In the first phase, flow control info... |

5 |
Efficient of Non-Uniform Traffic on Performance of Unbuffered Multistage Interconnection Networks
- Atiquzzaman, Akhatar
- 1994
(Show Context)
Citation Context ...ied MINs with uniform load traffic on inputs. Hot-spot traffic performance was also examined by Jurczyk [13], and Turner [22] dealt with multicast in Clos networks, as a subclass of MINs. Atiquzzaman =-=[1]-=- focused only on non-uniform arriving traffic schemes. Furthermore, Kleinrock [14] discusses approaches that examine the case of Poisson traffic on inputs of a MIN. In the industry domain, Cisco has b... |

5 |
Performance Analysis of Communication Systems
- German
- 2000
(Show Context)
Citation Context ...m queuing theory. Some authors that dealt with Markov chains also employed Petri nets as a modeling method. In the literature, there are several approaches that focus on Petri nets as those of German =-=[8]-=-, Haas [10] and Lindermann [15]. Hsiao [11] and Theimer [21] studied MINs with uniform load traffic on inputs. Hot-spot traffic performance was also examined by Jurczyk [13], and Turner [22] dealt wit... |

5 | Performance Comparison of Wormhole-Routing Priority Switch Architectures
- Jurczyk
- 2001
(Show Context)
Citation Context ...tri nets as those of German [8], Haas [10] and Lindermann [15]. Hsiao [11] and Theimer [21] studied MINs with uniform load traffic on inputs. Hot-spot traffic performance was also examined by Jurczyk =-=[13]-=-, and Turner [22] dealt with multicast in Clos networks, as a subclass of MINs. Atiquzzaman [1] focused only on non-uniform arriving traffic schemes. Furthermore, Kleinrock [14] discusses approaches t... |

5 |
A Markov chain approximation for analysis of Banyan networks
- Merchart
- 1991
(Show Context)
Citation Context ...ent methods have been used. These methods mainly include Markov chains, queuing theory, Petri nets and Simulation. Markov chains have been extensively used by many researchers. Bolch [2] and Merchant =-=[16]-=- used Markov chains in order to approximate the behavior of MINs under different buffering schemes. Bolch [2] also enhances Markov chains, with elements from queuing theory. Some authors that dealt wi... |

5 |
A Multistage Interconnection Network Simulator. 17th European Simulation Multiconference: Foundations for Successful Modelling & Simulation (ESM'03
- Simulate
- 2003
(Show Context)
Citation Context ... number of stages of an (N X N) MIN. In our simulation n is assumed to be n=6, 8, 10. 4. Simulation and Performance Results The performance of MINs is usually determined by modeling, using simulation =-=[23]-=- or mathematical methods [24]. In this paper we estimated the network performance using simulations. We developed a general simulator for MINs in a packet communication environment. The simulator can ... |

4 |
Queueing Networks and Markov Chains,Modeling and Performance Evaluation with
- Belch, Greiner, et al.
- 2009
(Show Context)
Citation Context ...erformance different methods have been used. These methods mainly include Markov chains, queuing theory, Petri nets and Simulation. Markov chains have been extensively used by many researchers. Bolch =-=[2]-=- and Merchant [16] used Markov chains in order to approximate the behavior of MINs under different buffering schemes. Bolch [2] also enhances Markov chains, with elements from queuing theory. Some aut... |

4 | Load sharing replicated buffered banyan networks with priority traffic Connecting the System
- Ng, Dewar
- 1995
(Show Context)
Citation Context ...ach input port, where packets are queued based on their priority level. Chen and Guerin [5] studied an (N X N) non-blocking packet switch with input queues, built using one-priority SEs. Ng and Dewar =-=[18]-=- introduced a simple modification to load-sharing replicated buffered Banyan Networks to guarantee priority traffic transmission. The internal switch structure used in all the above listed studies was... |

3 |
DES-3250TG 10/100Mbps managed switch. http://www.dlink.co.uk /DES-3250TG.htm
- D-Link
(Show Context)
Citation Context ...nsfer), and out-of-band data vs. ordinary TCP traffic [20] are two examples of such differentiations. There are already several commercial switches which accommodate traffic priority schemes, such as =-=[6, 7]-=-. These switches consist internally of single priority SEs and employ two priority queues forseach input port, where packets are queued based on their priority level. Chen and Guerin [5] studied an (N... |

3 | Intel Express 460T standalone switch - Corporation |

3 |
Performance Analysis of blocking Banyan Swithces
- Vasiliadis, Rizos, et al.
- 2006
(Show Context)
Citation Context ...ts that an input buffer of a SE can hold. In our paper we consider a single-buffered (b=1) MIN. Doublebuffered SEs lead to better exploitation of network, while the increase in delay can be tolerated =-=[25]-=-. • Probability of arrivals (pa) is the steady-state fixed probability of arriving packets at each queue on inputs. In our simulation pa is assumed to be pa = 0.1, 0.2, …, 0.9, 1. • Ratio of high prio... |

2 |
Performance Modelling with Deterministic and Stohastic Petri Nets
- Lindermann
- 1998
(Show Context)
Citation Context ... that dealt with Markov chains also employed Petri nets as a modeling method. In the literature, there are several approaches that focus on Petri nets as those of German [8], Haas [10] and Lindermann =-=[15]-=-. Hsiao [11] and Theimer [21] studied MINs with uniform load traffic on inputs. Hot-spot traffic performance was also examined by Jurczyk [13], and Turner [22] dealt with multicast in Clos networks, a... |