Dynamic data queuing mechanism for packet networks

Details Dynamic data queuing mechanism for packet networks Dynamic data queuing mechanism for packet networks

2002-03-27

2004-11-02

Huynh, Kim (Department: 2182)

Electrical computers and digital data processing systems: input/

Input/output data processing

Input/output data buffering

C710S310000, C710S052000, C711S109000, C711S110000

Reexamination Certificate

active

06813658

ABSTRACT:

BACKGROUND
1. Field of the Invention
Embodiments described herein are directed to a dynamic data queuing mechanism for packet networks. Specifically, a three-dimensional coil can expand or contract in length. In addition, the size of each loop of the coil may be adjusted such that circular queue size may be increased or decreased.
2. Related Art
Simple circular queues form a common method of buffering data. A circular queue consists of an input pointer and an output pointer that are incremented each time a data element is processed, in a first-in/first-out (“FIFO”) manner. Upon reaching the end of a queue, the pointers wrap around to the beginning again.
Since circular queues do not require maintenance of linked lists or memory allocation because of their fixed sizes, they are especially useful in time sensitive applications. A disadvantage of circular queues is that they are not memory efficient, in that the space allocated to the queues is not dynamically changeable.
U.S. Pat. No. 6,145,061, issued Nov. 7, 2000, and entitled “Method of Management of a Circular Queue for Asynchronous Access” discloses the use of a marker within queue data so as to allow sharing of circular queues by multiple processing threads as well as changing of queue size. This method adds to the operations needed in the queue input/output functions and thus affects their performance. Moreover, when queue sizes change, data copying becomes required.
A method that allows the space allocated for circular queues to be increased or decreased during normal operation, without subtracting from the efficiency of queuing and de-queuing data is thus a well-needed improvement in the field.


REFERENCES:
patent: 5873089 (1999-02-01), Regache
patent: 5925099 (1999-07-01), Futral et al.
patent: 6609161 (2003-08-01), Young
patent: 2003/0120886 (2003-06-01), Moller et al.

Affiliated with

Also associated with

Rating

Dynamic data queuing mechanism for packet networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic data queuing mechanism for packet networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic data queuing mechanism for packet networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3341396