Appeal No. 2002-0874
Application 09/124,278
in memory for each queue stored in the shared memory buffer.
When a new data packet arrives at the network node to be stored
in its appropriate queue and the buffer is full, a data packet is
removed from the queue having the largest weighted queue length.
This makes room in the buffer for the newly arrived data packet
to be stored in the appropriate queue. See page 3 of Appellant’s
specification. The weighted queue length is maintained by
adjusting the weighted queue length of a queue by an amount equal
to the weight assigned to the traffic class of the data packet.
These weights may be provisioned in order to implement different
loss priorities among the traffic classes. See page 4 of
Appellant’s specification. With reference to figure 3, the
weighted queue length is calculated as follows. First, each
traffic class is assigned a weight based on its loss priority,
the small weights corresponding to high priorities. This weight
assignment may be provisioned on a per output port basis so that
the same traffic class at different output ports may have
different priorities. A weighted queue length is maintained for
each connection queue stored in the buffer. When a data packet
associated with a particular connection arrives at the network
node, the data packet is stored in the associated connection
queue and the weighted queue length of the connection queue is
2
Page: Previous 1 2 3 4 5 6 7 8 9 10 Next
Last modified: November 3, 2007