Method of dynamic prioritization of time sensitive packets over a packet based network

• US 6,760,309 B1
• Filed: 03/28/2000
• Issued: 07/06/2004
• Est. Priority Date: 03/28/2000
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: 3Com Corporation (HP Inc.)
• Inventors: Rochberger, Haim, Natanson, Sarit Shani, Azriel, Gad
• Primary Examiner(s): Vu, Huy D.
• Assistant Examiner(s): Baranyai, Lawrence
• Application Number:
  US09/535,769
• Time in Patent Office: 1,561 Days
• Field of Search: 370/468, 370/229, 370/230, 370/412, 370/389, 370/235, 370/328, 370/395.4
• US Class Current: 370/235
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/2416 Real-time traffic
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/2458 Modification of priorities while in transit
• CPC Class Codes: H04L 47/286 Time to live
• CPC Class Codes: H04L 65/1101 Session protocols
• CPC Class Codes: H04L 65/1106 Call signalling protocols; H.323 and related
• CPC Class Codes: H04L 65/752 adapting media to network capabilities
• CPC Class Codes: H04L 65/80 Responding to QoS

Abstract

An apparatus for and a method of dynamically prioritizing packets over a packet based network. Packets are dynamically prioritized on the basis of their ‘time to live’ in the network as they travel from one network entity to another. Packets are assigned a priority in accordance with how ‘old’ or ‘young’ they are. Packets with a relatively long time left to live are assigned lower priority then those with relatively little time left to live. A time to live (TTL) field is added to the packet as it travels from one network entity to another. The contents of the time to live (TTL) field represents how ‘young’ or ‘old’ the packet is and conveys the time left before the packet is no longer of any use. Each network entity that receives the packet with a TTL field, subtracts from it the time the packet spends passing through that entity. The field decreases as it hops from network entity to entity until it reaches its destination or is discarded.

Claims

1. A method for dynamically prioritizing time sensitive packets for transmission over a packet based network, said method comprising the steps of:

adding, at an originator of said packet, a time to live (TTL) value field to time sensitive packets wherein said TTL value is set to an initial value;

determining, at each network entity along the path, a priority level for each time sensitive packet received, said priority level determined in accordance with the TTL value extracted from said packet;

distributing each time sensitive packet to one of a plurality of queues in accordance with the priority associated with said packet; and

replacing said TTL value field in said packet with the previous TTL value modified to reflect the time said packet spent in the current network element.

2. The method according to claim 1, further comprising the step of adding, at the originator of said packet, a TTL valid field adapted to indicate whether valid TTL information is incorporated in said packet.

3. The method according to claim 1, further comprising the step of adding, at the originator of said packet, a class field adapted to indicate the classification of said packet into one of a plurality of classes.

4. The method according to claim 3, wherein said classification is performed in accordance with the type of application generating said packet.

5. The method according to claim 1, further comprising the step of modifying said initial value in accordance with the congestion level in said network.

6. The method according to claim 1, further comprising the step of lowering said initial value at said packet originator when an increase in network congestion levels is detected, thus raising the priority of said packets as they traverse the network.

7. The method according to claim 1, further comprising the step of raising said initial value at said packet originator when a decrease in network congestion levels is detected, thus lowering the priority of said packets as they traverse the network.

8. The method according to claim 1, wherein said TTL value field is conveyed in a payload portion of a Real-Time Transport Protocol packet.

9. The method according to claim 1, wherein said TTL value field is conveyed in a header extension portion of a Real-Time Transport Protocol packet.

10. The method according to claim 1, wherein said TTL value field is conveyed in a User Datagram Protocol encapsulated packet.

11. The method according to claim 1, wherein said step of distributing comprises the step of discarding packets whose TTL values are lower than a predetermined threshold.

12. The method according to claim 1, said step of determining comprises the step of creating a mapping adapted to convert a TTL value into a corresponding priority level.

13. An apparatus for dynamically prioritizing packets in a network entity according to their sensitivity to time delays, comprising:

means for adding, at an originator of said packet, a time to live (TTL) value field to time sensitive packets wherein said TTL value is set to an initial value;

means for determining a priority level for each time sensitive packet received by said network entity, said priority level determined in accordance with the TTL value associated with said packet;

a plurality of queues for holding time sensitive packets, said plurality of queues divided into a plurality of groups, each group corresponding to a different priority level;

a distributor adapted to place each time sensitive packet into one of said plurality of queues in accordance with the priority associated with said packet; and

means for replacing said TTL value field in said packet with the previous TTL value modified to reflect the time said packet spent in said network element.

14. The apparatus according to claim 13, further comprising means for adding, at the originator of said packet, a TTL valid field adapted to indicate whether valid TTL information is incorporated in said packet.

15. The apparatus according to claim 13, further comprising means for adding, at the originator of said packet, a class field adapted to indicate the classification of said packet into one of a plurality of classes.

16. The apparatus according to claim 15, wherein said classification is performed in accordance with the type of application generating said packet.

17. The apparatus according to claim 13, further comprising means for modifying said initial value in accordance with the congestion level in said network.

18. The apparatus according to claim 13, further comprising means for lowering said initial value at said packet originator when an increase in network congestion levels is detected, thus raising the priority of said packets as they traverse the network.

19. The apparatus according to claim 13, further comprising means for raising said initial value at said packet originator when a decrease in network congestion levels is detected, thus lowering the priority of said packets as they traverse the network.

20. The apparatus according to claim 13, wherein said TTL value field is conveyed in a payload portion of a Real-Time Transport Protocol packet.

21. The apparatus according to claim 13, wherein said TTL value field is conveyed in a header extension portion of a Real-Time Transport Protocol packet.

22. The apparatus according to claim 13, wherein said TTL value field is conveyed in a User Datagram Protocol encapsulated packet.

23. The apparatus according to claim 13, wherein said distributor is adapted to discard packets whose TTL values are lower than a predetermined threshold.

24. The apparatus according to claim 13, said means for determining utilizes a predetermined mapping for converting a TTL value into a corresponding priority level.