Patent US1120549A successfully refreshed from Google Patents.
Patent US4244024A successfully refreshed from Google Patents.
Patent US4953157A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4953157A Expired / Lapsed US ⏱️ 0.0 years remaining

Programmable data packet buffer prioritization arrangement

Assignee: Nokia of America Corp
•
Filing: 1989-04-19
•
Granted: 1990-08-28
•
Expires: 2009-04-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a packet network, each data packet that is transported through the network to a destination node is assigned one of 2**N priority levels based on the type of information contained in the data packet. A data packet containing system control information is assigned the highest priority level. A data packet containing, for example, user information, is assigned a lower priority level. In addition, each priority level is associated with a respective "watermark" threshold. When a data packet arrives at a network node, the node compares the packet's associated watermark threshold with the number of data words currently stored in a common memory. The node rejects the packet if the watermark threshold is found to be less than that number to reserve space in the memory for data packets of higher priority. Otherwise, the data packet is stored in the common memory.

Inventors

  • 👤 Andrew D. Franklin
  • 👤 Robert J. Gallegos

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 23:09
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 113 words
Apparatus comprising a memory having a plurality of memory locations for the storage of data words contained in respective data packets, said data packets being associated with respective levels of priority, said levels of priorty being associated with respective priorly stored memory threshold values, and means, responsive to the storing in individual ones of said memory locations the data words of one of said data packets, for determining the number of data words currently stored in said memory and for effectively blocking the storage of said one data packet if the value of said number exceeds the value of the memory threshold associated with the respective priority level of said one data packet.
Claim 2
Dependent Claim 113 words
Apparatus comprising a memory having a plurality of memory locations for the storage of data words contained in respective data packets, said data packets being associated with respective levels of priority, said levels of priorty being associated with respective priorly stored memory threshold values, and means, responsive to the storing in individual ones of said memory locations the data words of one of said data packets, for determining the number of data words currently stored in said memory and for effectively blocking the storage of said one data packet if the value of said number exceeds the value of the memory threshold associated with the respective priority level of said one data packet.
Claim 3
Dependent Claim 47 words
The apparatus set forth in claim 1 wherein said means for determining includes means for allowing said one data packet to be stored in said memory if the value of said number is less than the value of the memory threshold associated with said one data packet.
Claim 4
Dependent Claim 75 words
The apparatus set forth in claim 1 wherein said apparatus further comprises memory read and write pointer registers, said write pointer register containing the address of the memory location at which a respective data word is to be stored and said read pointer register containing the address of the next memory location which is to be read, and wherein said number is determined as function of the contents of said read and write pointer registers.
Claim 5
Dependent Claim 78 words
The apparatus set forth in claim 1 wherein said apparatus is a packet switch arranged to receive packets of said data words from an external source of data packets, wherein each of said data packets includes a respective class-of-service mark identifying a respective one of said memory threshold values, and wherein the memory threshold that is associated with said one data word is derived from the class-of-service mark contained in the data packet associated said one data word.
Claim 6
Dependent Claim 61 words
The apparatus set forth in claim 1 wherein each of said memory threshold values is programmable and wherein said apparatus includes means for changing the value of at least one of said thresholds responsive to receipt from a user of said apparatus an instruction to do so, in which said instruction contains the new value of said at least one threshold.
Claim 7
Dependent Claim 83 words
Apparatus comprising a memory having a plurality of memory locations for the storage of respective data words each associated with a respective level of priority, and means responsive to receipt of one of said data words for storing said one data word in an individual one of said memory locations as long as the number of locations of said memory that are filled is less than a respective priorly stored memory threshold value associated with the priority level of said one data word.
Claim 8
Dependent Claim 83 words
Apparatus comprising a memory having a plurality of memory locations for the storage of respective data words each associated with a respective level of priority, and means responsive to receipt of one of said data words for storing said one data word in an individual one of said memory locations as long as the number of locations of said memory that are filled is less than a respective priorly stored memory threshold value associated with the priority level of said one data word.
Claim 9
Dependent Claim 41 words
The apparatus set forth in claim 6 wherein said means for storing includes means for blocking the storage of said one data word in said memory if the value of said number is greater than the value of said memory threshold.
Claim 10
Dependent Claim 74 words
The apparatus set forth in claim 6 wherein said apparatus further comprises memory read and write pointer registers, said read pointer register containing the address of the memory location at which said one data word is to be stored and said read pointer register containing the address of the memory location which is to be read, and wherein said number is determined as function of the contents of said read and write pointer registers.
Claim 11
Dependent Claim 48 words
The apparatus set forth in claim 6 wherein said apparatus is a packet switch arranged to receive packets of said data words from an external source of data packets, and wherein each of said data packets includes a respective class-of-service mark indicative of said a respective priority level.

References Cited (Backward Citations)

US4400771A Cited
US4159518A Cited
US4507760A Cited
US4692894A Cited
US4644533A Cited
US4819229A Cited
US4731785A Cited
US4769810A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-08-27 1994-02-26 1994-08-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-08-27 1998-02-26 1998-08-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-08-27 2002-02-26 2002-08-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag