A SCALABLE APPROACH TO LARGE SCALE QUEUING THROUGH DYNAMIC RESOURCE ALLOCATION

Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified accordint to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a "Q...

Full description

Saved in:
Bibliographic Details
Main Authors FULLI, ALESSANDRO, HOFFMAN, ROBERT, KLOTH, RAYMOND, J
Format Patent
LanguageEnglish
French
German
Published 30.05.2012
Subjects
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online AccessGet full text

Cover

More Information
Summary:Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified accordint to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a "Q" value. For example, a Q value may be a Q number defined as {Egress port number I I Priority number I I Ingress port number}. Only a single physical queue is allocated for each classification. When a physical queue is empty, the physical queue is preferably de-allocated and added to a "free list" of available physical queues. Accordingly, the total number of allocated physical queues preferably does not exceed the total number of classified packets. Because the input buffering requirements of Fibre Channel ("FC") and other protocols place limitations on the number of incoming packets, the dynamic allocation methods of the present invention result in a sparse allocation of physical queues.
Bibliography:Application Number: EP20040757419