Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2003-01-09
2008-08-05
Rao, Seema S. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S419000
Reexamination Certificate
active
07408937
ABSTRACT:
Methods and apparatus are disclosed for identifying a variable number of items first in sequence from a variable starting position which may be particularly useful by packet or other scheduling mechanisms, such as, but not limited to the SLIP/I SLIP scheduling algorithms or variants thereof. Each of the groups of items is typically identified with a number of items the group desires to be selected. Based on an identified starting position, a progressive sum value is initialized, with progressive sum values corresponding to successive groups of items in the sequence being adjusted typically based on the corresponding number of items each successive group desires to be selected. The number of items a particular group is authorized to select can then be determined, such as, but not limited to, by being based on its corresponding progressive sum value, the progressive sum value of the immediately prior group in the sequence, and its desired number of items to be selected.
REFERENCES:
patent: 4733390 (1988-03-01), Shirakawa et al.
patent: 5500858 (1996-03-01), McKeown
patent: 5526352 (1996-06-01), Min et al.
patent: 5729702 (1998-03-01), Creedon et al.
patent: 5832278 (1998-11-01), Pham
patent: 5923644 (1999-07-01), McKeown et al.
patent: 6212182 (2001-04-01), McKeown
patent: 6633568 (2003-10-01), Han et al.
patent: 6754223 (2004-06-01), Lussier et al.
patent: 7023840 (2006-04-01), Golla et al.
patent: 7145904 (2006-12-01), Zhao et al.
patent: 2003/0193941 (2003-10-01), Bonomi et al.
Halsall (Data Communications, Computer Network and Open Systems, Fourth Edition, Addison-Wesley, 1998).
Nick McKeown,The iSlip Scheduling Algorithm for Input-Queued Switches, IEEE/ACM Transactions on Networking, vol. 7, No. 2, Apr. 1999, pp. 188-201.
McKeown et al.,Tiny Tera: A Packet Switch Core, IEEE Micro, vol. 17, Issue 1, Jan.-Feb. 1997, pp. 26-33.
Nick McKeown and Thomas E. Anderson,A Quantitative Comparison of Scheduling Algorithms for Input-Queued Switches, Computer Networks and ISDN Systems, vol. 30, No. 24, pp. 2309-2326, Dec. 1998.
Pankaj Gupta and Nick McKeown,Designing and Implementing a Fast Crossbar Scheduler, IEEE Micro, vol. 19, Issue 1, Jan.-Feb. 1999, pp. 20-28.
Cohen Earl T.
Werner Tony Lee
Cisco Technology Inc.
Rao Seema S.
Russell Wanda Z
The Law Office of Kirk D. Williams
LandOfFree
Methods and apparatus for identifying a variable number of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods and apparatus for identifying a variable number of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for identifying a variable number of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3995621