Low-latency scheduling in large switches

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07912068

ABSTRACT:
Embodiments of a scheduler for a switch, where the switch is configured to couple input ports to output ports are described. During operation, the scheduler may determine a schedule based on a group of requests, associated with multiple data streams, that are received for the output ports of the switch, where the schedule matches input ports to output ports of the switch for a given data cell time. Note that the schedule may be determined using an arbitration technique during a time interval. Moreover, the scheduler may assign an additional request, which was received at a time that precedes a current time by less than the time interval, to a portion of the switch which is available in the schedule, thereby reducing a latency of the scheduler.

REFERENCES:
patent: 6160812 (2000-12-01), Bauman et al.
patent: 6587961 (2003-07-01), Garnett et al.
patent: 6674720 (2004-01-01), Passint et al.
patent: 6882649 (2005-04-01), Gura
patent: 7006501 (2006-02-01), Gura
patent: 7239669 (2007-07-01), Cummings et al.
patent: 7274701 (2007-09-01), Boduch et al.
patent: 7359384 (2008-04-01), Kodialam et al.
patent: 7382794 (2008-06-01), Zheng et al.
patent: 2002/0181483 (2002-12-01), Oki et al.
patent: 2003/0227932 (2003-12-01), Meempat et al.
patent: 2004/0017804 (2004-01-01), Vishnu
T. Anderson, S. Owicki, J. Saxe, and C. Thacker, “High Speed Switch Scheduling for Local Area networks”, ACM Trans. Comput. Syst., vol. 11, No. 4, pp. 319-352, Nov. 1993.
N. McKeown, “The iSlip Scheduling Algorithm for Input-queued Switches”, IEEE/ACM Transaction on Networking, vol. 7, No. 2, Apr. 1993.
E. Oki, R. Rojas-Cessa, and H.J. Chao, “A Pipeline-Based Maximal-Sized Matching Scheme for High-Speed Input-Buffered Switches”, IEICE Transactions on Communications, vol. E85-B, No. 7, pp. 1302-1311, Jul. 2002.
Y. Tamir and H. C. Chi, “Symmetric Crossbar Arbiters for VLSI Communication Switches”, IEEE Transactions on Parallel and Distributed Systems, vol. 4, issue 1, pp. 13-27, Jan. 1993.
H. J. Chao and J. S. Park, “Centralized Contention Resolution Schemes for a Large-Capacity Optical ATM switch”, Proc. IEEE ATM Workshop '97, Fairfax, VA, May 1998.
R. Drost, R. D. Hopkins and I. Sutherland, “Proximity Communication”, IEEE Custom Integrated Circuits Conference, pp. 469-472, Sep. 2003.
H. Eberle, A. Chow, B. Coates, J. Cunningham, R. Drost, J. Ebergen, S. Fairbanks, J. Gainsley, N. Gura, R. Ho, D. Hopkins, A. Krishnamoorthy, J. Lexau, W. Olesinski, J. Schauer, and T. Ono, “Multiterabit Switch Fabrics Enabled by Proximity Communication”, Symposium on High Performance Chips (Hot Chips '07), Stanford, CA, Aug. 19-21, 2007.
I. Elhanany, and X. Li, “A Scalable Frame-based Multi-crosspoint Packet Switching Architecture”, High Performance Switching and Routing Conference (HPSR ′07), Brooklyn, New York, May 30-Jun. 1, 2007.
C. Minkenberg, I. Iliadis and F. Abel, “Low-latencey Pipelined Crossbar Arbitration”, IEEE Global Telecommunications Conference 2004 (Globecom '04), vol. 2, pp. 1174-1179, Nov. 2004.
W. Olesinski, H. Eberle, and N. Gura, “PWWFA: Parallel Wave Front Arbiter for Large Switches”, High Performance Switching and Routing Conference (HPSR ′07), Brooklyn, NY, May 30-Jun. 1, 2007.
Y. Tian, X. Tu, L. Wen, K. Wang, and Y. Liu, “PPAwFE: a Novel High Speed Crossbar Scheduling Algorithm”, Proceedings of the 2005 International Conference on Communications, Circuits and Systems, vol. 1, pp. 673-677, May 2005.
W. Olesinski, N. Gura, H. Eberle, and A. Mejia, “Low-latency scheduling in large switches,” Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems, pp. 87-96, 2007.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Low-latency scheduling in large switches does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Low-latency scheduling in large switches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-latency scheduling in large switches will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2773804

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.