Weighted random scheduling particularly applicable to packet...

Details Weighted random scheduling particularly applicable to packet... Weighted random scheduling particularly applicable to packet...

2006-06-13

2006-06-13

Phunkulh, Bob A. (Department: 2661)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S230000

Reexamination Certificate

active

07061927

ABSTRACT:
Weighted random scheduling is preformed, which may be particularly applicable to packet switching systems. For each particular input of multiple switch inputs, a request to send a packet to one of the outputs of the switch is generated by weighted randomly selecting one of the outputs to which the particular input has one or more packets to send. One of the requests is granted for each different one of the outputs for which one or more requests were generated. Packets are sent between the inputs and the output corresponding to the granted requests. The weighted random selection is typically weighted based on the number of packets or bytes to send to each of the outputs by a corresponding input of the inputs, the last times packets were sent from a corresponding input of the inputs to each of the outputs, and/ classes of service associated with packets to send to each of the outputs by a corresponding input of the inputs.

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: 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: 2003/0193941 (2003-10-01), Bonomie 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, Cohen et al.
U.S. Appl. No. 10/684,282, filed Oct. 10, 2003, Patrick A. Costello.
Anderson et al.,High-Speed Switch Scheduling for Local Area Networks, ACM Transactions on Computer Systems, vol. 11, No. 4, Nov. 1993, pp. 319-352.
Mckeown et al.,Achieving 100% Throughput in an Input-Queued Switch, in IEEE Infocom, 1996.
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.

Affiliated with

Also associated with

Rating

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

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3662876