Node weighted scheduling

Authors:
Gagan R. Gupta;Sujay Sanghavi;Ness B. Shroff
Affiliations:
Purdue University, West Lafayette, IN, USA;Purdue University, West Lafayette, IN, USA;The Ohio State University, Columbus, OH, USA
Venue:
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Year:
2009

Citing 11
Cited 4

Scheduling nonuniform traffic in a packet-switching system with small propagation delay

IEEE/ACM Transactions on Networking (TON)
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the stability of input-queued switches with speed-up

IEEE/ACM Transactions on Networking (TON)
Efficient Randomized Algorithms for Input-Queued Switch Scheduling

IEEE Micro
SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT

Probability in the Engineering and Informational Sciences
A methodology for estimating interdomain web traffic demand

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach

Proceedings of the 12th annual international conference on Mobile computing and networking
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
Logarithmic delay for N × N packet switches under the crossbar constraint

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
Scheduling and performance limits of networks with constantly changing topology

IEEE Transactions on Information Theory

Workload optimality in switches without arrivals

ACM SIGMETRICS Performance Evaluation Review
Delay analysis and optimality of scheduling policies for multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
Modeling towards incremental early analyzability of networked avionics systems using virtual integration

ACM Transactions on Embedded Computing Systems (TECS)
Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Given an initial configuration of packets at the input buffers, these policies drain all packets in the system in the minimal amount of time provided that there are no further arrivals. These policies are also throughput optimal for a large class of arrival processes which satisfy strong-law of large numbers. We show that it is possible for policies in our class to be throughput optimal even if they are not constrained to be maximal in every time slot. Most algorithms for switch scheduling take an edge based approach; in contrast, we focus on scheduling (a large enough set of) the most congested ports. This alternate approach allows for lower-complexity algorithms, and also requires a non-standard technique to prove throughput-optimality. One algorithm in our class, Maximum Vertex-weighted Matching (MVM) has worst-case complexity similar to Max-size Matching, and in simulations shows slightly better delay performance than Max-(edge)weighted-Matching (MWM).