| US 7,535,929 B2 | ||
| System and method for token-based PPP fragment scheduling | ||
| Sandeep Singhai, 8520 Costa Verde Blvd., Apt. 3105, San Diego, Calif. 92122 (US); and Ben A. Saidi, 11722 Springside Rd., San Diego, Calif. 92128 (US) | ||
| Filed on Sep. 25, 2002, as Appl. No. 10/255,518. | ||
| Claims priority of provisional application 60/335680, filed on Oct. 25, 2001. | ||
| Prior Publication US 2003/0026218 A1, Feb. 06, 2003 | ||
| Int. Cl. H04J 3/24 (2006.01) | ||
| U.S. Cl. 370—473 [370/536] | 32 Claims |
| 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.
|