Data packet discarding
View Patent ↗A system for hierarchically storing packetized data and transferring the packetized data includes an input configured to receive packets of data, a memory coupled to the input and configured to store packets of data, an output coupled to the memory and configured to transfer packets of data from the memory, and a controller coupled to the memory and configured to control the memory to store packets of data in queues associated with a hierarchy in which a first level of the hierarchy includes a group of queue group components, wherein at least one of the queue group components in the group at the first level includes a group of queue group components associated with a second level of the hierarchy that is different from the first level of the hierarchy.
1. A system for hierarchically storing packetized data and transferring the packetized data, the apparatus comprising:
an input configured to receive packets of data;
an output coupled to a memory and configured to transfer packets of data from the memory; and
control means coupled to the input and to the output for storing packets of data received by the input in queues associated with a hierarchy where each level of the hierarchy includes at least one group of queue group components, and where at least one of the queue group components in each level other than a lowest level of the hierarchy includes a group of queue group components associated with a logically-lower level of the hierarchy, each queue group component being associated with at least one of a logically-lower queue and a logically-lower queue group, the control means also for transferring stored packets of data to the output,
wherein the control means is also for determining effective lengths of the queue group components.
2. The system of claim 1 wherein the logically-lower level is immediately logically lower in the hierarchy.
3. The system of claim 1 wherein the control means is configured to determine the effective lengths based on at least one of queue size, type of source, size of source, and service requirements associated with a queue.
4. The system of claim 3 wherein values of the effective length vary directly with queue size.
5. The system of claim 4 wherein the control means is also for discarding at least one packet of data of a selected queue associated with a queue group component that has a longest effective length among a hierarchical group under consideration for discard.
6. The system of claim 5 wherein the hierarchical group under consideration is associated with a queue group component at a higher level in the hierarchy that has the longest effective length of its associated group.
7. The system of claim 6 wherein the control means is for discarding multiple packets of data from the selected queue regardless of whether the queue group component associated with the selected queue ceases to have the longest effective length in its group before all of the multiple packets of data are discarded.
8. The system of claim 1 wherein the control means is configured to determine the effective lengths for at least two different hierarchical components differently.
9. The system of claim 1 wherein the control means is configured to discard at least one packet of data of a queue associated with a queue group component having an effective length that is within a highest-length range of effective lengths associated with a hierarchical group under consideration for discard.
10. A method for hierarchically storing packetized data and transferring the packetized data, the method comprising:
receiving packets of data at an input;
storing the received packets of data in queues according to a hierarchy where each level of the hierarchy includes at least one group of queue group components, and where at least one of the queue group components in each level other than a lowest level of the hierarchy includes a group of queue group components associated with a logically-lower level of the hierarchy each queue group component being associated with at least one of a logically-lower queue and a logically-lower queue group;
determining effective lengths of the queue group components; and
discarding at least one packet of data of a selected queue associated with a queue group component that has a longest effective length among a hierarchy group under consideration for discard.
11. The method of claim 10 wherein the lower level is immediately logically lower in the hierarchy.
12. The method of claim 10 wherein determining the effective lengths is based on at least one of queue size, type of source, size of source, and service requirements associated with a queue.
13. The method of claim 12 wherein values of the effective length vary directly with queue size.
14. The method of claim 10 wherein the hierarchy group of queues under consideration is associated with a queue group component at a higher level in the hierarchy that has the longest effective length of its associated group.
15. The method of claim 14 wherein the discarding of at least one packet includes discarding multiple packets of data from the selected queue regardless of whether the queue group component associated with the selected queue ceases to have the longest effective length in its group before all of the multiple packets of data are discarded.
16. The method of claim 10 wherein determining the effective lengths for at least two different hierarchy components is determined differently.
17. The method of claim 10 further comprising discarding at least one packet of data of a queue associated with a queue group component having an effective length that is within a highest-length range of effective lengths associated with a hierarchy group under consideration for discard.