IP Library › Granted Patent US 7,535,929
Granted Patent B2
US 7,535,929 · App. 10/255,518 · Granted May 19, 2009

System and method for token-based PPP fragment scheduling

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,535,929
App. No.
10/255,518
Granted
May 19, 2009
Kind
B2
Abstract

To avoid lost packets that could otherwise occur were a round robin scheduling policy to be used to assign PPP packet fragments to multiple communication links, the links are assigned tokens based on their capacities, with a fragment being assigned to the link with the most tokens. When a fragment is scheduled to a link, the tokens of the link are decremented accordingly. The tokens are periodically refreshed.

Claims (44)

1. A method for communicating data arranged in packets, comprising:

providing plural links between a transmitter and a receiver;

allocating at least one capacity indicator to each link;

partitioning each packet into plural fragments, wherein a number of the plural fragments is equal to a number of available links among the plural links;

using the capacity indicators, associating each of the plurality of fragments with a link having a highest available capacity as indicated by tokens; and

transmitting the plural of fragments of a packet in parallel over the available links among the plural links.

2. The method at claim 1 , comprising subtracting an amount representative of a size of a fragment from a number of tokens allocated to the link when the fragment has been assigned to the link.

3. The method of claim 1 , further comprising assigning at least one identification to each fragment to enable reconstruction of the packet.

4. The method of claim 1 , comprising reconstituting the fragments at the receiver, based on at least one identification assigned to each fragment, to reconstruct the packet.

5. The method of claim 1 , comprising transmitting the fragments of a packet in parallel over the links.

6. The method of claim 1 , wherein the packets are encapsulated in PPP.

7. The method of claim 1 , farther comprising assigning the tokens to the links, the tokens being representative of the capacities of the respective links.

8. The method of claim 1 , wherein the plural links comprise wireless communication links.

9. A transmitter transmitting packetized data in an IP protocol, comprising:

a controller receiving packets of data and partitioning the packets into fragments, wherein a number of the fragments of a packet is equal to a number of available links among plural links, each fragment being scheduled for transmission on one of the available links based on an allocation policy in accordance with available link capacity, wherein the fragments of the packet are transmitted in parallel over the available links among the plural links;

wherein the controller, for each fragment, associates the fragment to a link having a highest available capacity as indicated by tokens.

10. The transmitter of claim 9 , wherein the controller is implemented in a mobile station.

11. The transmitter of claim 9 , wherein the controller is implemented in a gateway station.

12. The transmitter of claim 9 , wherein the controller is implemented in a satellite.

13. The transmitter of claim 9 , wherein the controller assigns the tokens to links, the tokens being representative of the capacities of the respective links.

14. The transmitter of claim 13 , wherein the controller subtracts an amount representative of a size of a fragment from a number of tokens allocated to the link when the fragment has been assigned to the link.

15. The transmitter of claim 9 , wherein the controller transmits the fragments of a packet in parallel over the links.

16. The transmitter of claim 9 , wherein the plural links comprise wireless communication links.

17. The transmitter of claim 9 , wherein the controller is further operable to assign at least one identification to each fragment to enable reconstruction of the packet.

18. A system for packetized data transmission, comprising:

means for partitioning data packets into fragments, wherein a number of the fragments of a packet is equal to a number of available links among plural links;

means for scheduling the fragments among the available links based on current capacities of the available links, wherein the fragments of the packet are transmitted in parallel over the available links; and

wherein the means for scheduling, for each fragment, associates the fragment to a link having a highest available capacity as indicated by tokens.

19. The system of claim 18 , wherein at least the means for scheduling is implemented by at least one controller, wherein the controller assigns tokens to links, the tokens being representative of the capacities of the respective links.

20. The system of claim 19 , wherein the controller subtracts an amount representative of a size of a fragment from a number of tokens allocated to the link when the fragment has been assigned to the link.

21. The system of claim 18 , wherein the controller is implemented in a mobile station.

22. The system of claim 18 , wherein the controller is implemented in a gateway station.

23. The system of claim 18 , wherein the controller is implemented in a satellite.

24. The system of claim 18 , further comprising means for transmitting the fragments of a packet in parallel with each other over the links.

25. The system of claim 18 , wherein the plural links comprise wireless communication links.

26. The system of claim 18 , further comprising means for assigning at least one identification to each fragment to enable reconstruction of the packet.

27. A mobile station, comprising:

a controller for controlling at least one modem for communicating via plural links, wherein the controller receives packets of data and partition the packets into fragments, wherein a number of the fragments of a packet is equal to a number of available links among the plural links, each fragment being scheduled for transmission on one of the available links based on an allocation policy in accordance with available link capacity, wherein the fragments of the packet are transmitted in parallel over the available links among the plural links; and

wherein the controller, for each fragment, associates the fragment to a link having a highest available capacity as indicated by tokens.

28. The mobile station of claim 27 , wherein the controller is further operable to assign the tokens to links, the tokens being representative of the capacities of the respective links.

29. The mobile station of claim 28 , wherein the controller is further operable to subtract an amount representative of a size of a fragment from a number of tokens allocated to the link when the fragment has been assigned to the link.

30. The mobile station of claim 27 , wherein the controller is further operable to transmit the fragments of a packet in parallel over the links.

31. The mobile station of claim 27 , wherein the plural links comprise wireless communication links.

32. The mobile station of claim 27 , wherein the controller is further operable to assign at least one identification to each fragment to enable reconstruction of the packet.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 25, 2002
From: SINGHAI, SANDEEP; SAIDI, BEN A.
To: QUALCOMM INCORPORATED
Reel/Frame 013341/0276 →
Continuity (2)
Provisional Application 6033568000 · Oct 25, 2001
Related Publication 20030026218A1 · Feb 6, 2003