Cart (Loading....) | Create Account
Close category search window
 

MNCM: A Critical Node Matching Approach to Scheduling for Input Buffered Switches With No Speedup

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tabatabaee, V. ; Inst. for Syst. Res., Univ. of Maryland, College Park, MD ; Tassiulas, L.

In this paper, we use fluid model techniques to establish 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 (sigma, rho) regulated.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:17 ,  Issue: 1 )

Date of Publication:

Feb. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.