US5936964A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Round-trip delay optimization of multiplexed speech channels
Assignee: Unwired Planet LLC
•
Filing: 1997-04-18
•
Granted: 1999-08-10
•
Expires: 2017-04-18
Abstract
Abstract Data packets are transmitted in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections. Transmission is performed by, for each connection, assigning a forward delay limit and a corresponding backward delay limit, wherein the sum of the forward and backward delay limits is equal to a round-trip delay bound for the connection. The assigned forward delay limits are used to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the forward direction. Similarly, the assigned backward delay limits are used to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the backward direction. One embodiment accomplishes the forward and backward delay limit assignments by maintaining forward and backward lists of connection identifiers sorted in, for example, ascending order based on time of connection establishment in the forward direction, and in descending order based on time of connection establishment in the backward direction. In another embodiment, transmission order is determined by sorting arriving data packets at the time of their corresponding connection identifiers, wherein the forward and backward sorting rules are selected so that a sum of a forward transmission delay limit and a backward transmission delay limit is less than or equal to a round-trip delay bound for each connection.
Inventors
- 👤 Andras Valko
- 👤 Lars Westberg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 23:34
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04J; H04J3/00; H04J3/24; H04J3/247; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5638; H04L2012/5646; H04L2012/5649; H04L2012/5672
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
133 words
A method of transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the method comprising the steps of: for each connection, assigning a forward delay limit and a corresponding backward delay limit, wherein the sum of the forward and backward delay limits is less than or equal to a round-trip delay bound for the connection; using the assigned forward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the forward direction; and using the assigned backward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the backward direction.
Claim 2
Independent Claim
133 words
A method of transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the method comprising the steps of: for each connection, assigning a forward delay limit and a corresponding backward delay limit, wherein the sum of the forward and backward delay limits is less than or equal to a round-trip delay bound for the connection; using the assigned forward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the forward direction; and using the assigned backward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the backward direction.
Claim 3
Dependent Claim
67 words
The method of claim 1, wherein: for each of the connections, the forward delay limit, d forward , is in a range d.sub.min ≦d.sub.forward ≦d.sub.max where d min is a predefined minimum multiplexing delay, and d max is a predefined maximum multiplexing delay; and for each of the connections, the corresponding backward delay limit, d backward , is assigned a value in accordance with d.sub.backward ≦d.sub.max -d.sub.forward.
Claim 4
Dependent Claim
18 words
The method of claim 1, wherein the round-trip delay bound is the same for each of the connections.
Claim 5
Independent Claim
165 words
A method of transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the method comprising the steps of: providing a forward multiplexing list; providing a backward multiplexing list; when a connection is established, inserting a corresponding connection identifier at a first position in the forward multiplexing list, and inserting the corresponding connection identifier at a second position in the backward multiplexing list, wherein the distance of the first position from the head of the forward multiplexing list is less than or equal to the distance of the second position from the back of the backward multiplexing list; in the forward direction, transmitting arriving data packets supplied from the plurality of connections in an order determined by the forward multiplexing list; and in the backward direction, transmitting arriving data packets supplied from the plurality of connections in an order determined by the backward multiplexing list.
Claim 6
Independent Claim
165 words
A method of transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the method comprising the steps of: providing a forward multiplexing list; providing a backward multiplexing list; when a connection is established, inserting a corresponding connection identifier at a first position in the forward multiplexing list, and inserting the corresponding connection identifier at a second position in the backward multiplexing list, wherein the distance of the first position from the head of the forward multiplexing list is less than or equal to the distance of the second position from the back of the backward multiplexing list; in the forward direction, transmitting arriving data packets supplied from the plurality of connections in an order determined by the forward multiplexing list; and in the backward direction, transmitting arriving data packets supplied from the plurality of connections in an order determined by the backward multiplexing list.
Claim 7
Dependent Claim
29 words
The method of claim 4, wherein: the first position is the head of the forward multiplexing list; and the second position is the end of the backward multiplexing list.
Claim 8
Dependent Claim
41 words
The method of claim 4, further comprising the step of: if a first data packet that should be transmitted now is not yet available while data packets from other connections are available, then waiting until the first data packet becomes available.
Claim 9
Dependent Claim
56 words
The method of claim 4, further comprising the step of: for the forward direction, if a first data packet that should be transmitted now is not yet available while data packets from other connections are available, then skipping over the first data packet and transmitting a next data packet as determined by the forward multiplexing list.
Claim 10
Dependent Claim
51 words
The method of claim 7, wherein the step of skipping over the first data packet and transmitting the next data packet as determined by the forward multiplexing list further comprises the step of: after transmitting the next data packet as determined by the forward multiplexing list, transmitting the first data packet.
Claim 11
Dependent Claim
29 words
The method of claim 8, further comprising the step of: after transmitting the first data packet, transmitting a next not-yet-transmitted data packet as determined by the forward multiplexing list.
Claim 12
Independent Claim
163 words
A method of transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the method comprising the steps of: in the forward direction, sorting arriving data packets in accordance with a first sorting rule based on connection identifiers of the corresponding connections, and transmitting the arriving data packets in the forward direction in an order based on the forward direction sorting step; and in the backward direction, sorting arriving data packets in accordance with a second sorting rule based on connection identifiers of the corresponding connections, and transmitting the arriving data packets in the backward direction in an order based on the backward sorting step, wherein the first and second sorting rules are selected so that a sum of a forward transmission delay limit and a backward transmission delay limit is less than or equal to a round-trip delay bound for each connection.
Claim 13
Independent Claim
163 words
A method of transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the method comprising the steps of: in the forward direction, sorting arriving data packets in accordance with a first sorting rule based on connection identifiers of the corresponding connections, and transmitting the arriving data packets in the forward direction in an order based on the forward direction sorting step; and in the backward direction, sorting arriving data packets in accordance with a second sorting rule based on connection identifiers of the corresponding connections, and transmitting the arriving data packets in the backward direction in an order based on the backward sorting step, wherein the first and second sorting rules are selected so that a sum of a forward transmission delay limit and a backward transmission delay limit is less than or equal to a round-trip delay bound for each connection.
Claim 14
Dependent Claim
25 words
The method of claim 10 wherein: the first sorting rule is sorting in ascending order; and the second sorting rule is sorting in descending order.
Claim 15
Dependent Claim
63 words
The method of claim 10, wherein the sorting and transmitting steps in the forward direction comprise the steps of: inserting the arriving data packets into a buffer so that the buffer will contain all data packets that have arrived, wherein the buffer contents are sorted in ascending order; and transmitting the arriving data packets from a head of the buffer in ascending order.
Claim 16
Dependent Claim
78 words
The method of claim 10, wherein the sorting and transmitting steps in the forward direction comprise the steps of: inserting connection identifiers associated with the arriving data packets into a buffer so that the buffer will contain all connection identifiers associated with data packets that have arrived, wherein the buffer contents are sorted in ascending order; and transmitting the data packets that have arrived in an order determined by the order of the connection identifiers in the buffer.
Claim 17
Independent Claim
133 words
An apparatus for transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the apparatus comprising: means for assigning, for each connection, a forward delay limit and a corresponding backward delay limit, wherein the sum of the forward and backward delay limits is equal to a round-trip delay bound for the connection; means for using the assigned forward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the forward direction; and means for using the assigned backward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the backward direction.
Claim 18
Independent Claim
133 words
An apparatus for transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the apparatus comprising: means for assigning, for each connection, a forward delay limit and a corresponding backward delay limit, wherein the sum of the forward and backward delay limits is equal to a round-trip delay bound for the connection; means for using the assigned forward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the forward direction; and means for using the assigned backward delay limits to determine the order in which the data packets supplied by the plurality of connections will be transmitted in the backward direction.
Claim 19
Dependent Claim
67 words
The apparatus of claim 14, wherein: for each of the connections, the forward delay limit, d forward , is in a range d.sub.min ≦d.sub.forward ≦d.sub.max where d min is a predefined minimum multiplexing delay, and d max is a predefined maximum multiplexing delay; and for each of the connections, the corresponding backward delay limit, d backward , is assigned a value in accordance with d.sub.backward ≦d.sub.max -d.sub.forward.
Claim 20
Dependent Claim
18 words
The apparatus of claim 14, wherein the round-trip delay bound is the same for each of the connections.
Claim 21
Independent Claim
168 words
An apparatus for transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the apparatus comprising: a forward multiplexing list; a backward multiplexing list; means, responsive to a connection being established, for inserting a corresponding connection identifier at a first position in the forward multiplexing list, and for inserting the corresponding connection identifier at a second position in the backward multiplexing list, wherein the distance of the first position from the head of the forward multiplexing list is less than or equal to the distance of the second position from the back of the backward multiplexing list; in the forward direction, means for transmitting arriving data packets supplied from the plurality of connections in an order determined by the forward multiplexing list; and in the backward direction, means for transmitting arriving data packets supplied from the plurality of connections in an order determined by the backward multiplexing list.
Claim 22
Independent Claim
168 words
An apparatus for transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the apparatus comprising: a forward multiplexing list; a backward multiplexing list; means, responsive to a connection being established, for inserting a corresponding connection identifier at a first position in the forward multiplexing list, and for inserting the corresponding connection identifier at a second position in the backward multiplexing list, wherein the distance of the first position from the head of the forward multiplexing list is less than or equal to the distance of the second position from the back of the backward multiplexing list; in the forward direction, means for transmitting arriving data packets supplied from the plurality of connections in an order determined by the forward multiplexing list; and in the backward direction, means for transmitting arriving data packets supplied from the plurality of connections in an order determined by the backward multiplexing list.
Claim 23
Dependent Claim
29 words
The apparatus of claim 17, wherein: the first position is the head of the forward multiplexing list; and the second position is the end of the backward multiplexing list.
Claim 24
Dependent Claim
38 words
The apparatus of claim 17, further comprising: means, responsive to non-availability of a first data packet that should be transmitted now while data packets from other connections are available, for waiting until the first data packet becomes available.
Claim 25
Dependent Claim
46 words
The apparatus of claim 17, further comprising: for the forward direction, means, responsive to non-availability of a first data packet that should be transmitted now, for skipping over the first data packet and transmitting a next available data packet as determined by the forward multiplexing list.
Claim 26
Dependent Claim
51 words
The apparatus of claim 20, wherein the means for skipping over the first data packet and transmitting the next available data packet as determined by the forward multiplexing list further comprises: means for transmitting the first data packet after transmitting the next data packet as determined by the forward multiplexing list.
Claim 27
Dependent Claim
28 words
The apparatus of claim 21, further comprising: means for transmitting a next not-yet-transmitted data packet as determined by the forward multiplexing list after transmitting the first data packet.
Claim 28
Independent Claim
166 words
An apparatus for transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the apparatus comprising: in the forward direction, means for sorting arriving data packets in accordance with a first sorting rule based on connection identifiers of the corresponding connections, and for transmitting the arriving data packets in the forward direction in an order based on the forward direction sorting operation; and in the backward direction, means for sorting arriving data packets in accordance with a second sorting rule based on connection identifiers of the corresponding connections, and for transmitting the arriving data packets in the backward direction in an order based on the backward sorting operation, wherein the first and second sorting rules are selected so that a sum of a forward transmission delay limit and a backward transmission delay limit is less than or equal to a round-trip delay bound for each connection.
Claim 29
Independent Claim
166 words
An apparatus for transmitting data packets in forward and backward directions via a multiplexed communications medium, wherein each of the data packets is associated with a corresponding one of a plurality of connections, the apparatus comprising: in the forward direction, means for sorting arriving data packets in accordance with a first sorting rule based on connection identifiers of the corresponding connections, and for transmitting the arriving data packets in the forward direction in an order based on the forward direction sorting operation; and in the backward direction, means for sorting arriving data packets in accordance with a second sorting rule based on connection identifiers of the corresponding connections, and for transmitting the arriving data packets in the backward direction in an order based on the backward sorting operation, wherein the first and second sorting rules are selected so that a sum of a forward transmission delay limit and a backward transmission delay limit is less than or equal to a round-trip delay bound for each connection.
Claim 30
Dependent Claim
25 words
The apparatus of claim 23 wherein: the first sorting rule is sorting in ascending order; and the second sorting rule is sorting in descending order.
Claim 31
Dependent Claim
64 words
The apparatus of claim 23, wherein the sorting and transmitting means in the forward direction comprises: means for inserting the arriving data packets into a buffer so that the buffer will contain all data packets that have arrived, wherein the buffer contents are sorted in ascending order; and means for transmitting the arriving data packets from a head of the buffer in ascending order.
Claim 32
Dependent Claim
80 words
The apparatus of claim 23, wherein the means for sorting and transmitting in the forward direction comprises: means for inserting connection identifiers associated with the arriving data packets into a buffer so that the buffer will contain all connection identifiers associated with data packets that have arrived, wherein the buffer contents are sorted in ascending order; and means for transmitting the data packets that have arrived in an order determined by the order of the connection identifiers in the buffer.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-09 | 2003-02-08 | 2003-08-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-09 | 2007-02-08 | 2007-08-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-09 | 2011-02-08 | 2011-08-10 | $7700.00 | Window Closed / Lapsed |