Patent ID: 7929438

Claim:
A method for scheduling traffic information in a network on a per-port hierarchical sharing basis, the method comprising: distributing a total bandwidth of a physical port into a hierarchical tree comprising a plurality of logical links that each depend from the physical port, a plurality of virtual local area network queues that each depend from the logical links, and a plurality of flow queues that each depend from the virtual local area network queues through either a guaranteed data flow link or a best effort flow link; and enqueuing and dequeueing a frame by: storing parts of flow queue control blocks that are required to be read and written at an enqueue instance of the frame and at a dequeue instance of the frame in a static random access memory via a first static random access memory interface comprising a first interface read bus dedicated for read access and a first interface write bus dedicated to write access; storing hierarchy control blocks of the virtual local area network queues and frame control blocks that are required to be read and written at the enqueue instance and the dequeue instance in the static random access memory via a second static random access memory interface that is different from the first static random access memory interface and comprising a second interface read bus dedicated for read access and a second interface write bus dedicated to write access; updating a network management read-write-modify counter in a first dynamic random access memory in response to the enqueue instance; storing parts of read-only flow queue control blocks and read-only virtual local area network queue hierarchy control blocks that are required to be read and written at the enqueue instance and the dequeue instance in a second dynamic random access memory; and dequeuing the frame from the flow queues as a function of a value of the network management read-write-modify counter.