Patent ID: 7729242
Filing Date: 2010-06-01
Classification: H04L

Abstract:
1. A method comprising: accessing only an updated adjacent group of first level queue buckets included in a first memory structure including N first level queue buckets each holding a token value associated with a transmission queue and with each first level queue bucket having a unique ID, with the updated adjacent group of first level queue buckets being a group of M first level queue buckets including a first level queue bucket holding a most recently updated token value, where N is a positive integer and M is a positive integer less than N and where the first level queue buckets are grouped into L first level queue adjacent groups where L is a positive integer equal to N divided by M; propagating a first level minimum token value accessed from the updated adjacent group of first level queue buckets and a first level MIN ID value equal to a unique ID of a first level queue bucket holding the first level minimum token value; storing the first level minimum token value and first level MIN ID in a second level bucket, associated with the updated adjacent group of first level queue buckets, included in a second memory structure including L second level buckets with a second level adjacent group being a group of M second level buckets and where the second level buckets are grouped into K second level adjacent groups where K is a positive integer equal to L divided by M; accessing only an updated adjacent group of second level queue buckets including the second level bucket storing the first level minimum token value and the first level MIN ID; propagating a second level minimum token value accessed from the updated adjacent group of second level queue buckets and a second level MIN ID value identifying a first level bucket holding the second level minimum token value; storing the minimum second level token value and second level MIN ID in a third level bucket, associated with the updated adjacent group of second level queue buckets, included in a third memory structure including K third level buckets; accessing all third level buckets; and propagating a third level minimum token value and a third level ID equal to a unique ID identifying a first level queue bucket holding the third level minimum token value so that a transmission queue associated with the third level ID can be scheduled for transmission.