US2015365336A1PendingUtilityA1

Method to schedule multiple traffic flows through packet-switched routers with near-minimal queue sizes

Individually held — no corporate assignee on recordPriority: Aug 21, 2009Filed: Jun 23, 2015Published: Dec 17, 2015
Est. expiryAug 21, 2029(~3 yrs left)· nominal 20-yr term from priority
H04L 47/6295H04L 49/9023H04L 47/6215H04L 47/629H04L 49/90H04L 47/6255H04L 49/3018H04L 47/56H04L 47/283H04L 47/726H04L 1/0018H04L 49/205H04L 47/528
50
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A method to schedule multiple traffic flows through a multiplexer server to provide fairness while minimizing the sizes of the associated queues, is proposed. The multiplexer server minimizes a quantity called the maximum Normalized Service Lag for each traffic flow. In each time-slot, the normalized service lag of every traffic flow may be updated by adding the normalized lag increment value, whether or not there is a packet in the queue associated with the flow. In each time-slot, a multiplexer server selects a traffic flow to service with an available packet and with the maximum normalized service lag. When the traffic rate requested by each traffic flow is stable, the multiplexer server schedule may repeat periodically. Efficient methods to compute periodic schedules are proposed. The methods can be applied to packet-switched Internet routers to achieve reduced queue sizes and delay.

Claims

exact text as granted — not AI-modified
1 . A method of transmitting a plurality of traffic flows to N output ports through a switch during a scheduling interval, comprising:
 receiving each of said plurality of traffic flows, each of said plurality of traffic flows associated with a respective guaranteed data rate;   buffering packets in each of said plurality of traffic flows in one of N input queues, in dependence on the output port for that traffic flow;   in a switching interval, transmitting a packet from a chosen traffic flow from a selected one of said N input queues to the output port for that selected one of said N input queues;   wherein said chosen traffic flow is chosen as having the largest positive normalized service lag among traffic flows having buffered packets in said selected one of said N input queues, determined over a period of time from the beginning of the scheduling interval until the beginning of the switching interval;   wherein the normalized service lag of each traffic flow reflects the difference between the amount of traffic that could be transmitted at said flow's guaranteed data rate during said period and the amount of traffic from said flow transmitted through said switch during said period.

Join the waitlist — get patent alerts

Track US2015365336A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.