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

abstract

• 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. 2005 IEEE.

name of conference

• IEEE International Conference on Communications, 2005. ICC 2005. 2005

authors

• Mahapatra, Rabinarayan

published proceedings

• ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5

author list (cited authors)

• Kumar, A., & Mahapatra, R. N.

citation count

• 0

complete list of authors

• Kumar, A||Mahapatra, RN

publication date

• January 2005

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• 2013 National Conference on Communications, NCC 2013  Journal

Digital Object Identifier (DOI)

• 10.1109/icc.2005.1494503

International Standard Book Number (ISBN) 10

• 0-7803-8938-7

start page

• 1020

end page

• 1025

volume

• 2

URL

• http://dx.doi.org/10.1109/icc.2005.1494503