Packet Scheduling in Switches with Target Outflow Profiles
Aditya Dua, Nicholas Bambos

TL;DR
This paper introduces dynamic packet scheduling algorithms for input-queued switches that aim to match desired outflow profiles, achieving high throughput and low distortion even under heavy contention.
Contribution
It presents novel scheduling methods that focus on pulling traffic streams to follow target profiles, with provable throughput and effective distortion suppression.
Findings
Schedules achieve 100% pull-throughput.
Proposed schedules closely match target outflow profiles.
Effective even under high contention.
Abstract
The problem of packet scheduling for traffic streams with target outflow profiles traversing input queued switches is formulated in this paper. Target outflow profiles specify the desirable inter-departure times of packets leaving the switch from each traffic stream. The goal of the switch scheduler is to dynamically select service configurations of the switch, so that actual outflow streams ("pulled" through the switch) adhere to their desired target profiles as accurately as possible. Dynamic service controls (schedules) are developed to minimize deviation of actual outflow streams from their targets and suppress stream "distortion". Using appropriately selected subsets of service configurations of the switch, efficient schedules are designed, which deliver high performance at relatively low complexity. Some of these schedules are provably shown to achieve 100% pull-throughput.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Software-Defined Networks and 5G · Network Traffic and Congestion Control
