Scheduling packet flows in multi-rate wireless local area networks
First Claim
1. A method for scheduling a plurality of series of packets for transmission between a plurality of terminals in a single wireless channel of a packet-switched local area network, comprising:
- assigning a transmission rate to each of a plurality of terminals;
assigning a start tag Skƒ
=max {V (A(tkƒ
)), Fk−
171 }and a finish tag Fkƒ
=Skƒ
+Lp/(rƒ
·
Cƒ
(t)) to each packet, where k is a sequence number of the packet, in a particular series of packets ƒ
, A(tkƒ
) is an arrival time of the packet, Lp is a size of the packet in bits, V(·
) is a virtual time for the start tag, rƒ
is a base transmission rate, and Cƒ
(t) is a current transmission rate; and
scheduling the series of packets for transmission between the terminals such that each terminal receives a substantially equal amount of transmission time over an extended period of time.
1 Assignment
0 Petitions
Accused Products
Abstract
A system and method schedule series of packets for transmission between terminals in a single wireless channel of a packet-switched local area network. The local area network can operate in an ad hoc mode or in infrastructure mode. A transmission rate is assigned to each of the terminals. The terminals can be mobile. Different terminals can be assigned different transmission rates, depending on a quality of the channel. That is, terminals transmitting via an error-free channel are assigned a higher transmission rate than terminals transmitting via an error-prone channel. Then, the series of packets are scheduled for transmission between the terminals such that each terminal receives a substantially equal amount of transmission time over an extended period of time.
-
Citations
19 Claims
-
1. A method for scheduling a plurality of series of packets for transmission between a plurality of terminals in a single wireless channel of a packet-switched local area network, comprising:
-
assigning a transmission rate to each of a plurality of terminals; assigning a start tag Skƒ
=max {V (A(tkƒ
)), Fk−
171 }and a finish tag Fkƒ
=Skƒ
+Lp/(rƒ
·
Cƒ
(t)) to each packet, where k is a sequence number of the packet, in a particular series of packets ƒ
, A(tkƒ
) is an arrival time of the packet, Lp is a size of the packet in bits, V(·
) is a virtual time for the start tag, rƒ
is a base transmission rate, and Cƒ
(t) is a current transmission rate; andscheduling the series of packets for transmission between the terminals such that each terminal receives a substantially equal amount of transmission time over an extended period of time. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A system for scheduling a plurality of series of packets for transmission between a plurality of terminals in a single wireless channel of a packet-switched local area network, comprising:
-
an error-free service model configured to define ideal packet flows that transmit at different rates over an error-free channel; a lead and lag model configured to determine leading packet flows and lagging packet flows, and to determine amounts of leading and amounts of lagging for the leading packet flows and the lagging packet flows, respectively; and a compensation model configured to compensate the lagging packet flows at an expense of the leading packet flows; and means for scheduling the series of packets for transmission between the terminals such that each terminal receives a substantially equal amount of transmission time over an extended period of time. - View Dependent Claims (18)
-
-
19. A system for scheduling a plurality of series of packets for transmission between a plurality of terminals in a single wireless channel of a packet-switched local area network, comprising:
-
means for assigning a transmission rate to each of a plurality of terminals; means for assigning a start tag Skƒ
=max {V (A(tkƒ
)), Fk−
1ƒ
}and a finish tag Fkƒ
=Skƒ
+Lp/(rƒ
·
Cƒ
(t)) to each packet, where k is a sequence number of the packet, in a particular series of packets ƒ
, A(tkƒ
) is an arrival time of the packet, Lp is a size of the packet in bits, V(·
) is a virtual time for the start tag, rƒ
is a base transmission rate, and Cƒ
(t) is a current transmission rate; andmeans for scheduling the series of packets for transmission between the terminals such that each terminal receives a substantially equal amount of transmission time over an extended period of time.
-
Specification