Variable length packet switches: delay analysis of crossbar switches under Poisson and self similar traffic

We consider crossbar switches for switching variable length packets. Analysis of such switches is important in the context of IP switches where the packet interarrival times and packet lengths are drawn from continuous distributions. Assuming a single stage M/spl times/N switch we obtain a very general throughput delay model for Poisson packet arrivals and exponential service times. We then analyze an M/spl times/N switch for self similar packet arrivals and exponential packet lengths. An MMPP (Markov modulated Poisson process) based self similar arrival process model corresponding to the arrival rate, the autocorrelation, the Hurst parameter and the time scales over which burstiness exists in the input process is first obtained using results from Andersen and Nielsen (1998). We then use queuing theory available for MMPP/G/1 queues to model the switch performance for self similar packet arrivals. The results from the analytical model are compared against those from a simulation model that is driven by traces that are statistically similar to the Bellcore traces. We also analyse the effect of link multiplicities (speedup) to the output and asymmetries in the input traffic.

[1]  Harry G. Perros.  Queueing Networks with Blocking: Exact and Approximate Solutions , 1994 .

[2]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[3]  San-Qi Li,et al.  Performance of a nonblocking space-division packet switch with correlated input traffic , 1992, IEEE Trans. Commun..

[4]  R. Hinden,et al.  Ipsilon flow management protocol specification for ipv4 , 1996 .

[5]  Masayuki Murata,et al.  Effect of speedup in nonblocking packet switch , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[6]  Julian Keilson,et al.  The M/G/1/K blocking formula and its generalizations to state-dependent vacation systems and priority systems , 1993, Queueing Syst. Theory Appl..

[7]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[8]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[9]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[10]  Bo Friis Nielsen,et al.  A Markovian approach for modeling packet traffic with long-range dependence , 1998, IEEE J. Sel. Areas Commun..

[11]  Thomas G. Robertazzi.  Performance of ProcessorMemory Interconnections for Multiprocessors , 1993 .

[12]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[13]  Steve W. Fuhrmann,et al.  Performance of a packet switch with crossbar architecture , 1993, IEEE Trans. Commun..

[14]  Wolfgang Fischer,et al.  The Markov-Modulated Poisson Process (MMPP) Cookbook , 1993, Perform. Evaluation.

[15]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  S.-Q. Li.  Performance of a non-blocking space-division packet switch with correlated input traffic , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[17]  P.-J. Courtois,et al.  The M/G/1 Finite Capacity Queue with Delays , 1980, IEEE Trans. Commun..

[18]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[19]  Shun-Chen Niu,et al.  Transform-Free Analysis of M/G/1/K and Related Queues , 1993, Math. Oper. Res..

[20]  Walter Willinger,et al.  Experimental queueing analysis with long-range dependent packet traffic , 1996, TNET.

[21]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[22]  Parag Pruthi,et al.  An application of deterministic chaotic maps to model packet traffic , 1995, Queueing Syst. Theory Appl..