Method and apparatus for avoiding packet reordering in multiple-class, multiple-priority networks using a queue
US6633575B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Apr 7, 1999 |
| Grant date | Oct 14, 2003 |
| Priority date | — |
| Expiry date | Apr 7, 2019 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/13
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method and apparatus for avoiding packet reordering in multiple-class, multiple-priority networks. The present invention provides a queue implementation technique that can be used in multiple-class, multiple-priority networks such as Differentiated Services networks to ensure that packets are serviced without reordering. The queue implementation technique maintains performance isolation between different classes under some scheduling disciplines and can identify scheduling disciplines which do not degrade the performance seen by the lower priority traffic classes. The system includes a first queue for receiving packets associated with a first traffic class, the packets being arranged in the first queue as in-profile packets and out-profile packets and a second queue for storing pointers associated with the out-profile packets, wherein the packets in the first queue comprise doubly-linking, and the pointers associated with the out-profile packets in the second queue point to corresponding out-profile packets in the first queue as well as to a previous and next element in the second queue.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.