Port packet queuing

Abstract

A port queue includes a first memory portion having a first memory access time and a second memory portion having a second memory access time. The first memory portion includes a cache row. The cache row includes a plurality of queue entries. A packet pointer is enqueued in the port queue by writing the packet pointer in a queue entry in the cache row in the first memory. The cache row is transferred to a packet vector in the second memory. A packet pointer is dequeued from the port queue by reading a queue entry from the packet vector stored in the second memory.

What is claimed is: 
     
         1 . A queue, the queue having an egress port queue associated with an egress port of a switch, the egress port queue comprising:
 a first queue memory being configured to receive and enqueue a pointer corresponding to a received data packet, the first queue memory having a first access time;   a second queue memory in communication with the first queue memory, the second queue memory having a second access time, the first access time being shorter than the second access time; and   control logic configured to transfer a plurality of pointers from the first queue memory to the second queue memory in a single transfer cycle, and dequeue each pointer of a plurality of pointers from the second queue memory.   
     
     
         2 . The queue of  claim 1 , wherein the access time being shoring than the second access time such that the pointer corresponding to the received data packet may additionally be enqueued in one or more other egress port queues associated with one or more other egress ports of the switch during a single port cycle. 
     
     
         3 . The queue of  claim 1 , wherein the control logic is further configured to dequeue each pointer of the plurality of pointers from the second queue memory. 
     
     
         4 . The queue of  claim 3 , wherein each pointer of the plurality of pointers is dequeued by reading the pointer from the second queue memory. 
     
     
         5 . The queue of  claim 1 , wherein the first queue memory comprises a plurality of cache rows. 
     
     
         6 . The queue of  claim 5 , wherein the plurality of pointers comprises all of the pointers in one of the cache rows, and the control logic transfers the plurality of pointers from the first queue memory to the second queue memory in a single write operation. 
     
     
         7 . The queue of  claim 6 , wherein the control logic fills one of the cache rows in the first queue memory before transferring that cache row to the second queue memory. 
     
     
         8 . The queue of  claim 6 , wherein the control logic partially fills one of the cache rows in the first queue memory before transferring that cache row to the second queue memory. 
     
     
         9 . The queue of  claim 5 , wherein entries in the cache rows are ordered by position. 
     
     
         10 . The queue of  claim 5 , wherein a packet vector stored in the second queue memory includes a cache row entry and a count of the number of pointers stored in the cache row entry. 
     
     
         11 . The queue of  claim 10  wherein the packet vector stored in the second queue memory includes a link to a next packet vector in the queue. 
     
     
         12 . The queue of  claim 5  wherein a packet vector stored in the second queue memory includes a link to a next packet vector in the queue. 
     
     
         13 . The queue of  claim 1 , wherein the plurality of pointers are transferred from the first queue memory to the second queue memory by writing the plurality of pointers as a linked list in the second queue memory. 
     
     
         14 . The queue of  claim 1 , wherein the second queue memory is in communication with the first queue memory via intermediate logic. 
     
     
         15 . The queue of  claim 14 , wherein the intermediate logic is operative to:
 read the plurality of pointers from the first queue memory; and   write the plurality of pointers to the second queue memory in a single transfer cycle.   
     
     
         16 . The queue of  claim 14 , wherein the intermediate logic reads the plurality of pointers from the first queue memory when a number of pointers stored in the first queue memory is greater than a predetermined threshold. 
     
     
         17 . The queue of  claim 14 , wherein the intermediate logic reads the plurality of pointers from the first queue memory when at least one row of the first queue memory is full. 
     
     
         18 . The queue of  claim 1 , wherein the first queue memory has at least two rows. 
     
     
         19 . The queue of  claim 18 , wherein the plurality of pointers correspond to a full row of the first queue memory. 
     
     
         20 . The queue of  claim 18 , wherein the pointers stored in each row of the first queue memory are ordered by position in the row.