公开(公告)号：US06577635B2

公开(公告)日：2003-06-10

申请号：US10084112

申请日：2002-02-26

申请人： Pidugu Narayana ,  Makarand Dharmapurikar

发明人： Pidugu Narayana ,  Makarand Dharmapurikar

IPC分类号： H04L1256

CPC分类号： H04L69/329 ,  H04L47/10 ,  H04L47/24 ,  H04L47/2433 ,  H04L47/26 ,  H04L47/28 ,  H04L47/50 ,  H04L47/56 ,  H04L47/60 ,  H04L47/6215 ,  H04L67/06 ,  H04L67/322 ,  H04L67/325 ,  H04L2012/5635 ,  H04L2012/5651 ,  H04L2012/5679 ,  H04L2012/5681 ,  H04Q11/0478

摘要： The present invention is directed toward data packet transmission scheduling. Scheduling values, such as priority or other scheduling criteria assigned to data packets, are placed in a scheduling heap data structure. Packets percolate up through the heap by comparing their assigned values in pairs. Operations in the heap may be pipelined so as to provide for high-speed sorting. Thus, a few relatively simple operations can be performed repeatedly to quickly percolate packets up through the heap. Another aspect of the invention provides for fast traversal of the scheduling heap data structure. The hierarchical heap may include a highest level having a single position and each succeeding lower level having twice the number of positions as the preceding level. A binary number may represent each position in the heap. To traverse the heap, the relative movements necessary to move from one position to another may be determined from the binary number. This is useful to quickly and efficiently traverse the heap.

公开(公告)号：US06469983B2

公开(公告)日：2002-10-22

申请号：US10083965

申请日：2002-02-26

申请人： Pidugu Narayana ,  Makarand Dharmapurikar

发明人： Pidugu Narayana ,  Makarand Dharmapurikar

IPC分类号： H04J314

CPC分类号： H04L69/329 ,  H04L47/10 ,  H04L47/24 ,  H04L47/2433 ,  H04L47/26 ,  H04L47/28 ,  H04L47/50 ,  H04L47/56 ,  H04L47/60 ,  H04L47/6215 ,  H04L67/06 ,  H04L67/322 ,  H04L67/325 ,  H04L2012/5635 ,  H04L2012/5651 ,  H04L2012/5679 ,  H04L2012/5681 ,  H04Q11/0478

摘要： The present invention is directed toward methods and apparatus for data packet transmission scheduling using a partitioned scheduling heap data structure. The scheduling heap data structure has a plurality of levels for storing scheduling values for data packets according to their relative priorities. A highest level in the heap has a single position and each succeeding lower level has twice the number of positions as the preceding level. The data structure may be adapted to store a plurality of logical heaps within the heap data structure by assigning a highest level of each logical heap to a level in the heap data structure that is lower than the highest level. Thus, a single physical memory may be adapted to store plural logical heaps. This is useful because a single physical memory can be adapted to prioritize packets of various different transmission protocols and speeds.

摘要翻译： 本发明涉及使用分区调度堆数据结构的数据分组传输调度的方法和装置。 调度堆数据结构具有多个级别，用于根据其相对优先级存储用于数据分组的调度值。 堆中的最高级别具有单个位置，并且每个后续的较低级别具有前一级别的位置数量的两倍。 数据结构可以适于通过将每个逻辑堆的最高级分配给低于最高级别的堆数据结构中的级别来将多个逻辑堆存储在堆数据结构内。 因此，单个物理存储器可以适于存储多个逻辑堆。 这是有用的，因为单个物理内存可以适应各种不同传输协议和速度的数据包的优先级。