Routing and Performance Analysis of Double-Buffered Omega Networks Supporting Multi-class Priority Traffic

In this paper the modeling of Omega Networks supporting multi-class routing traffic is presented and their performance is analyzed. We compare the performance of multi-class priority mechanism against the single priority one, by gathering metrics for the two most important network performance factors, namely packet throughput and delay under uniform traffic conditions and various offered loads, using simulations. Moreover, two different test-bed setups were used in order to investigate and analyze the performance of all priority-class traffic, under different quality of service (QoS) configurations. In the considered environment, switching elements (SEs) that natively support multi-class priority routing traffic are used for constructing the MIN, while we also consider double-buffered SEs, two configuration parameters that have not been addressed insofar. The rationale behind introducing a multiple-priority scheme is to provide different QoS guarantees to traffic from different applications, which is a highly desired feature for many IP network operators, and particularly for enterprise networks.

[1]  Elizabeth Suet Hing Tse Switch fabric architecture analysis for a scalable bi-directionally reconfigurable IP router , 2004, J. Syst. Archit..

[2]  Matthew Roughan,et al.  Class-of-service mapping for QoS: a statistical signature-based approach to IP traffic classification , 2004, IMC '04.

[3]  G. Jack Lipovski,et al.  Banyan networks for partitioning multiprocessor systems , 1998, ISCA '98.

[4]  Israel Cidon,et al.  Two priority buffered multistage interconnection networks , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[5]  Euripidis Glavas,et al.  Performance Evaluation of Two-Priority Network Schema for Single-Buffered Delta Networks , 2007, 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications.

[6]  Josep Torrellas,et al.  The performance of the cedar multistage switching network , 1997, Supercomputing '94.

[7]  Claus Bauer Throughput and Delay Bounds for Input Buffered Switches Using Maximal Weight Matching Algorithms and a Speedup of Less than Two , 2004, ICOIN.

[8]  John D. Garofalakis,et al.  An Analytical Performance Model for Multistage Interconnection Networks with Blocking , 2008, 6th Annual Communication Networks and Services Research Conference (cnsr 2008).

[9]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[10]  Dietmar Tutsch,et al.  MINSimulate - A MULTISTAGE INTERCONNECTION NETWORK SIMULATOR , 2003 .

[11]  Toshio Soumiya,et al.  The large capacity ATM backbone switch "FETEX-150 ESP" , 1999, Comput. Networks.

[12]  Costas Vassilakis,et al.  Performance Analysis of blocking Banyan Switches , 2007 .

[13]  Janak H. Patel,et al.  Processor-memory interconnections for multiprocessors , 1979, ISCA '79.

[14]  H. T. Mouftah,et al.  Survey of ATM Switch Architectures , 1995, Comput. Networks ISDN Syst..

[15]  Günter Hommel,et al.  Generating Systems of Equations for Performance Evaluation of Multistage Interconnection Networks , 2002, J. Parallel Distributed Comput..

[16]  Howard Jay Siegel,et al.  The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems , 1982, IEEE Transactions on Computers.

[17]  I. Damgård,et al.  The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.

[18]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[19]  Erwin P. Rathgeb,et al.  Performance analysis of buffered Banyan networks , 1991, IEEE Trans. Commun..