IP Library › Granted Patent US 7,633,865
Granted Patent B2
US 7,633,865 · App. 11/655,613 · Granted Dec 15, 2009

Network operations control in packet data networks

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,633,865
App. No.
11/655,613
Granted
Dec 15, 2009
Kind
B2
Abstract

A technique for controlling a packet data network to maintain network stability and efficiently utilize network resources through mechanisms involving per-destination queues and urgency weights for medium access control. The technique jointly controls congestion, scheduling, and contention resolution on hop-by-hop basis, such that the length of queues of packets at a node does not become arbitrarily large. In one embodiment, queue lengths and urgency weights may be transmitted and received via medium access control messages.

Claims (34)

1. A method for control of a packet data network node comprising:

maintaining a plurality of local per-destination queues;

transmitting queue lengths of said plurality of local per-destination queues to at least one other node in said packet data network;

receiving queue lengths of remote per-destination queues from at least one other node in said packet data network;

calculating an urgency weight of each of said plurality of local per-destination queues based at least in part on said received queue lengths of said remote per-destination queues;

transmitting said calculated urgency weights to at least one other node in said packet data network; and

receiving urgency weights from at least one other node in said packet data network.

2. The method of claim 1 , further comprising the step of controlling congestion of said packet data network based at least in part on said urgency weights.

3. The method of claim 1 , further comprising the step of scheduling packets for transmission in said packet data network based at least in part on said urgency weights.

4. The method of claim 1 , further comprising the step of resolving contention of packets in a shared channel contention-based network based at least in part on said urgency weights.

5. The method of claim 1 , wherein said steps of transmitting queue lengths and receiving queue lengths are performed using medium access control messages.

6. The method of claim 1 , wherein said steps of transmitting said calculated urgency weights and receiving urgency weights are performed using medium access control messages.

7. The method of claim 1 , wherein said packet data network is a mobile ad-hoc network.

8. Apparatus comprising:

means for maintaining a plurality of local per-destination queues;

means for transmitting queue lengths of said plurality of local per-destination queues to at least one other node in said packet data network;

means for receiving queue lengths of remote per-destination queues from at least one other node in said packet data network;

means for calculating an urgency weight of each of said plurality of local per-destination queues based at least in part on said received queue lengths of said remote per-destination queues;

means for transmitting said calculated urgency weights to at least one other node in said packet data network; and

means for receiving urgency weights from at least one other node in said packet data network.

9. The apparatus of claim 8 , further comprising means for controlling congestion of said packet data network based at least in part on said urgency weights.

10. The apparatus of claim 8 , further comprising means for scheduling packets for transmission in said packet data network based at least in part on said urgency weights.

11. The apparatus of claim 8 , further comprising means for resolving contention of packets in a shared channel contention-based network based at least in part on said urgency weights.

12. The apparatus of claim 8 wherein said packet data network is a mobile ad-hoc network.

13. A computer readable storage medium storing computer program instructions for control of a packet data network node, said computer program instructions defining the steps of:

maintaining a plurality of local per-destination queues;

transmitting queue lengths of said plurality of local per-destination queues to at least one other node in said packet data network;

receiving queue lengths of remote per-destination queues from at least one other node in said packet data network;

calculating an urgency weight of each of said plurality of local per-destination queues based at least in part on said received queue lengths of said remote per-destination queues;

transmitting said calculated urgency weights to at least one other node in said packet data network; and

receiving urgency weights from at least one other node in said packet data network.

14. The computer readable storage medium of claim 13 , said computer program instructions further defining the step of controlling congestion of said packet data network based at least in part on said urgency weights.

15. The computer readable storage medium of claim 13 , said computer program instructions further defining the step of scheduling packets for transmission in said packet data network based at least in part on said urgency weights.

16. The computer readable storage medium of claim 13 , said computer program instructions further defining the step of resolving contention of packets in a shared channel contention-based network based at least in part on said urgency weights.