Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2003-01-09
2008-11-18
Pham, Chi H. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S418000
Reexamination Certificate
active
07453898
ABSTRACT:
Methods and apparatus are disclosed for simultaneously scheduling multiple priorities of packets, such as in systems having a non-blocking switching fabric. In one implementation, the maximum bandwidth which a particular input can send is identified. During a scheduling cycle, a current bandwidth desired for a first priority of traffic is identified, which leaves the remaining bandwidth available for a second priority of traffic without affecting the bandwidth allocated to the first priority of traffic. By determining these bandwidth amounts at each iteration of a scheduling cycle, multiple priorities of traffic can be simultaneously scheduled. This approach may be used by a wide variety of scheduling approaches, such as, but not limited to using a SLIP algorithm or variant thereof. When used in conjunction with a SLIP algorithm, the current desired bandwidths typically correspond to high and low priority requests.
REFERENCES:
patent: 4733390 (1988-03-01), Shirakawa et al.
patent: 5500858 (1996-03-01), McKeown
patent: 5923644 (1999-07-01), McKeown et al.
patent: 6212182 (2001-04-01), McKeown
patent: 6262986 (2001-07-01), Oba et al.
patent: 6445707 (2002-09-01), Iuoras et al.
patent: 6628646 (2003-09-01), Angle et al.
patent: 6757246 (2004-06-01), Alasti et al.
patent: 6904047 (2005-06-01), Han et al.
patent: 7058751 (2006-06-01), Kawarai et al.
patent: 2001/0043606 (2001-11-01), Han et al.
patent: 2003/0072326 (2003-04-01), Alasti et al.
patent: 2003/0193941 (2003-10-01), Bonomi et al.
patent: 2004/0165598 (2004-08-01), Shrimali et al.
patent: 2004/0218600 (2004-11-01), Alasti et al.
patent: 1052814 (2000-11-01), None
patent: WO 03/085909 (2003-10-01), None
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. AndersonA 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.
U.S. Appl. No. 10/109,785, filed Mar. 30, 2002, Bonomi et al.
U.S. Appl. No. 10/684,282, filed Oct. 10, 2003, Patrick A. Costello.
Wenzhe Cui et al., “A threshold based scheduling algorithm for input queue switch,” IEEE, 2001, pp. 207-212.
Chao H J et al., “Centralized contention resolution schemes for a large-capacity optical ATM switch,” ATM Workshop Proceedings, 1998 IEEE, Fairfax, VA, USA pp. 11-16, May 26, 1998.
Bonomi Flavio Giovanni
Cohen Earl T.
Cisco Technology Inc.
Hyun Soon D.
Pham Chi H.
The Law Office of Kirk D. Williams
LandOfFree
Methods and apparatus for simultaneously scheduling multiple... 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 simultaneously scheduling multiple..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for simultaneously scheduling multiple... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4024722