Integrated scheduling and buffer management input queued switches under extreme traffic scheme conditions

This paper addresses scheduling and memory management in input queued switches having finite buffer space to improve the performance in terms of throughput and average delay. Most of the prior works on scheduling related to input queued switches assume infinite buffer space. In practice, buffer space being a finite resource, special memory management scheme becomes essential. We introduce a buffer management scheme called iSMM (integrated scheduling and memory management) that can be employed jointly with any deterministic iterative scheduling algorithm. We applied iSMM over iSLIP, a popular scheduling algorithm, and examined its effect under extreme traffic conditions. Simulation results indicate iSMM to perform better than the raw iSLIP and maximum weighted matching (MWM) scheduling algorithms both in terms of throughput and delay.

[1]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[2]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[3]  Alfred Giessler,et al.  Free Buffer Allocation - An Investigation by Simulation , 1978, Comput. Networks.

[4]  Raj Jain,et al.  Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part I: Concepts, Goals and Methodology , 1988, ArXiv.

[5]  Satish Rao,et al.  Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Bruce S. Davie,et al.  Computer Networks: A System Approach , 1998, IEEE Communications Magazine.

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

[8]  Saswati Sarkar.  Optimum scheduling and memory management in input queued switches with finite buffer space , 2004, IEEE Transactions on Information Theory.

[9]  Anujan Varma,et al.  Providing bandwidth guarantees in an input-buffered crossbar switch , 1995, Proceedings of INFOCOM'95.

[10]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Nick McKeown,et al.  Design and Implementation of a Fast Crossbar Scheduler , 1998 .

[12]  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.

[13]  Laxmi N. Bhuyan,et al.  Fair scheduling and buffer management in Internet routers , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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