Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2007-10-30
2007-10-30
Pezzlo, John (Department: 2616)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S252000, C370S413000, C370S429000
Reexamination Certificate
active
10684282
ABSTRACT:
Methods and apparatus are disclosed for slow-start scheduling packets, such as in systems having a non-blocking switching fabric and homogeneous or heterogeneous line card interfaces. In one implementation, multiple request generators, grant arbiters, and acceptance arbiters work in conjunction to determine the scheduling of packets. A set of requests for sending packets from a particular input is identified. The number of requests is possibly reduced to a value less than the number of packets that can be sent from the particular source if the particular input is not saturated. Otherwise, when the particular input is saturated, the number of requests remains the same or is reduced to the maximum number of packets that can be sent during a packet time.
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: 6253080 (2001-06-01), Wiedeman et al.
patent: 6262986 (2001-07-01), Oba et al.
patent: 6757246 (2004-06-01), Alasti et al.
patent: 2001/0043606 (2001-11-01), Han et al.
patent: 2003/0032391 (2003-02-01), Schweinhart et al.
patent: 2003/0072326 (2003-04-01), Alasti 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
U.S. Appl. No. 10/109,785, filed Mar. 30, 2002, Bonomi et al.
U.S. Appl. No. 10/339,032, filed Jan. 9, 2003, Earl T. Cohen.
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.
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.
Cisco Technology Inc.
Pezzlo John
The Law Office of Kirk D. Williams
LandOfFree
Slow-start packet scheduling particularly applicable to... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Slow-start packet scheduling particularly applicable to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slow-start packet scheduling particularly applicable to... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3841205