Packet scheduling particularly applicable to systems...

Details Packet scheduling particularly applicable to systems... Packet scheduling particularly applicable to systems...

2007-02-27

2007-02-27

Ngo, Ricky Q. (Department: 2616)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S395400

Reexamination Certificate

active

10109785

ABSTRACT:
Methods and apparatus are disclosed for 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 this scheduling. A set of requests for sending packets from a particular input is generated. From a grant starting position, a first n requests in a predetermined sequence are identified, where n is less than or equal to the maximum number of connections that can be used in a single packet time to the particular output. The grant starting position is updated in response to the first n grants including a particular grant corresponding to a grant advancement position. In one embodiment, the set of grants generated based on the set of requests is similarly determined using an acceptance starting position and an acceptance advancement position.

REFERENCES:
patent: 4733390 (1988-03-01), Shirakawa et al.
patent: 5500858 (1996-03-01), McKeown
patent: 5923644 (1999-07-01), McKeown et al.
patent: 5956342 (1999-09-01), Manning et al.
patent: 6212182 (2001-04-01), McKeown
patent: 6262986 (2001-07-01), Oba et al.
patent: 6445680 (2002-09-01), Moyal
patent: 6628646 (2003-09-01), Angle et al.
patent: 6757246 (2004-06-01), Alasti et al.
patent: 2001/0043606 (2001-11-01), Han 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
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 shemes for a large-capacity optical ATM switch,” ATM Workshop Proceedings, 1998 IEEE, Fairfax, VA, USA pp. 11-16, May 26, 1998.

Affiliated with

Also associated with

Rating

Packet scheduling particularly applicable to systems... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Packet scheduling particularly applicable to systems..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet scheduling particularly applicable to systems... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3830531