MNCM: a critical node matching approach to scheduling for input buffered switches with no speedup

Authors:
Vahid Tabatabaee;Leandros Tassiulas
Affiliations:
Institute for Systems Research, University of Maryland, College Park, MD;Computer Engineering and Telecommunication Department, University of Thessaly, Volos, Greece
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
High-speed switch scheduling for local-area networks

ACM Transactions on Computer Systems (TOCS)
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
QoS provisioning and tracking fluid policies in input queueing switches

IEEE/ACM Transactions on Networking (TON)
Achieving 100% throughput in an input-queued switch

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we use fluid model techniques to es-tablish new results for the throughput of input-buffered switches. Dai and Prabhakar have shown that any maximal size matching algorithm with speedup of 2 achieves 100% throughput. We introduce the maximum node containing matching (MNCM), which is a new class of matching algorithms that achieve 100% throughput with no speedup. The only assumption on the arrival processes is they satisfy the strong law of large numbers (SLLN). The MNCM policies only need to include ports whose weight (backlog) are above a threshold in the matching rather than finding a matching with maximum total weight. This simplified requirement enables us to introduce a new matching algorithm, maximum first matching (MFM), with O(N2.5) complexity. We show that MFM is a low-complexity algorithm with good delay performance. We also provide a deterministic upper bound for the buffering requirement of a switch with an MNCM scheduler, when the ports incoming traffic are admissible and (σ, ρ) regulated.