Departmental Papers (ESE)

Abstract

This paper addresses scheduling and memory management in input queued switches with finite input buffers, with the objective of minimizing packet loss. The framework and algorithms proposed here apply to buffer constrained wireless networks as well. The scheduling problem has been extensively addressed under the assumption of infinite input buffers. We study the finite buffer case here which arises in practice. The introduction of memory constraint significantly complicates the problem. The optimal strategies for infinite buffer case no longer apply and become strictly suboptimal in presence of memory limitations. We present closed form optimal strategies which minimize packet loss in 2 x 2 switches with equal arrival rates for all streams. We identify certain characteristics of the optimal strategy for arbitrary arrival rates, and use these properties to design a near optimal heuristic. We use the insight obtained from the investigation for 2 x 2 switches to propose a heuristic for N x N switches, arbitrary N and show numerically that this strategy performs close to optimal. The policies presented here reduce packet loss by about 25% as compared to the optimal strategy for the infinite buffer case.

Document Type

Conference Paper

Date of this Version

March 2003

Comments

Copyright 2003 IEEE. Reprinted from Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), Volume 2, pages 1373-1383.
Publisher URL: http://ieeexplore.ieee.org/xpl/tocresult.jsp?isNumb er=27206&page=3

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Keywords

buffer storage, packet switching, queueing theory, scheduling, 2 x 2 switch, N x N switch, arbitrary packet, arrival rate, buffer constrained wireless network, closed form optimal strategy, equal packet arrival rate, finite input buffer space, input queued switch, memory management, optimum scheduling, packet loss minimization

Share

COinS
 

Date Posted: 15 November 2004

This document has been peer reviewed.