NDLI: Achieving 100% throughput in an input-queued switch

Content Provider	IEEE Xplore Digital Library
Author	McKeown, N. Mekkittikul, A. Anantharam, V. Walrand, J.
Copyright Year	1972
Abstract	It is well known that head-of-line blocking limits the throughput of an input-queued switch with first-in-first-out (FIFO) queues. Under certain conditions, the throughput can be shown to be limited to approximately 58.6%. It is also known that if non-FIFO queueing policies are used, the throughput can be increased. However, it has not been previously shown that if a suitable queueing policy and scheduling algorithm are used, then it is possible to achieve 100% throughput for all independent arrival processes. In this paper we prove this to be the case using a simple linear programming argument and quadratic Lyapunov function. In particular, we assume that each input maintains a separate FIFO queue for each output and that the switch is scheduled using a maximum weight bipartite matching algorithm. We introduce two maximum weight matching algorithms: longest queue first (LQF) and oldest cell first (OCF). Both algorithms achieve 100% throughput for all independent arrival processes. LQF favors queues with larger occupancy, ensuring that larger queues will eventually be served. However, we find that LQF can lead to the permanent starvation of short queues. OCF overcomes this limitation by favoring cells with large waiting times.
Starting Page	1260
Ending Page	1267
Page Count	8
File Size	248423
File Format	PDF
ISSN	00906778
Volume Number	47
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-08-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Throughput Switches Scheduling algorithm Packet switching Linear programming Lyapunov method Asynchronous transfer mode Switching systems Communications Society Bipartite graph
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On Tracking the Behavior of an Output-Queued Switch Using an Input-Queued Switch

The iSLIP scheduling algorithm for input-queued switches

Efficient randomized algorithms for input-queued switch scheduling

An Efficient Packet Scheduling Algorithm With Deadline Guarantees for Input-Queued Switches

On achieving throughput in an input-queued switch

Multicast scheduling for input-queued switches

Packet-mode scheduling in input-queued cell-based switches

Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches

High-throughput cell scheduling for broadband switching systems

Achieving 100% throughput in an input-queued switch

Similar Documents

On Tracking the Behavior of an Output-Queued Switch Using an Input-Queued Switch

The iSLIP scheduling algorithm for input-queued switches

Efficient randomized algorithms for input-queued switch scheduling

An Efficient Packet Scheduling Algorithm With Deadline Guarantees for Input-Queued Switches

On achieving throughput in an input-queued switch

Multicast scheduling for input-queued switches

Packet-mode scheduling in input-queued cell-based switches

Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches

High-throughput cell scheduling for broadband switching systems

Achieving 100% throughput in an input-queued switch