Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-08-20
2009-10-13
Ahmed, Salmon (Department: 2419)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S458000
Reexamination Certificate
active
07602790
ABSTRACT:
A scheduler allowing high-speed scheduling scalable with the number of input and output ports of a crosspoint switch and suppressed unfairness among inputs is disclosed. The scheduler includes an M×M matrix of scheduling modules, each of which schedules packet forwarding connections from a corresponding input group of input ports to selected ones of a corresponding output group of output ports based on reservation information. A diagonal module pattern is used to determine a set of M scheduling modules to avoid coming into collision with each other. Each determined scheduling module performs reservation of packet forwarding connections based on current reservation information and transfers updated reservation information in row and column directions of the M×M matrix.
REFERENCES:
patent: 5299190 (1994-03-01), LaMaire et al.
patent: 5734649 (1998-03-01), Carvey et al.
patent: 6044061 (2000-03-01), Aybay et al.
patent: 6618379 (2003-09-01), Ramamurthy et al.
patent: 6661788 (2003-12-01), Angle et al.
patent: 6885639 (2005-04-01), Kamiya
patent: 6888841 (2005-05-01), Ozaki
patent: 6977935 (2005-12-01), Kamiya et al.
patent: 7058063 (2006-06-01), Cavendish
patent: 7142546 (2006-11-01), Kamiya
patent: 7161943 (2007-01-01), Kamiya et al.
patent: 1103922 (2002-04-01), None
patent: 2000-174817 (2000-06-01), None
patent: 2001-7822 (2001-01-01), None
IEEE Jun. 2000 publication by Dirceu Cavendish “CORPS—A Pipelined Fair Packet Scheduler for High Speed Switches”.
Yuval Tamir et al., “Symmetric Crossbar Arbiters for VLSI Communication Switches”, IEEE Transactions on Parallel and Distributed Systems, vol. 4, No. 1, 1993, pp. 13-27.
[Hsin-Chou Chi et al., “Starvation Prevention for Arbiters of Crossbars with Multi-Queue Input Buffers”, Feb. 28, 2004, ]pp. 292-297.
[James Hurt et al., “Design and Implementation of High-Speed Symmetric Crossbar Schedulers”, Jun. 6, 1999, vol. 3, ]pp. 1478-1483.
European Search Report dated Feb. 19, 2004.
Yuval Tamir et al., “Symmetric Crossbar Arbiters for VLSI Communication Switches”, IEEE Transactions on Parallel and Distributed Systems, vol. 4, Nov. 1, 1993, pp. 13-27, XP000381322.
Hsin-Chou Chi et al., “Starvation Prevention for Arbiters of Crossbars with Multi-Queue Input Buffers”, Feb. 28, 2004, pp. 292-297, XP000479405.
James Hurt et al., “Design and Implementation of High-Speed Symmetric Crossbar Schedulers”, Jun. 6, 1999, vol. 3, pp. 1478-1483, XP000903619.
Dirceu Cavendish, “CORPS—A Pipelines Fair Packet Scheduler for High Speed Switches”, IEEE Conference Jun. 2000, pp. 55-64.
S. Kamiyta et al., co-pending U.S. Appl. No. 11/562,923, filed Nov. 22, 2006, “Two-Dimensional Pipelined Scheduling Technique”.
Kamiya Satoshi
Ozaki Hirokazu
Ahmed Salmon
Harrity & Harrity LLP
Juniper Networks, Inc.
LandOfFree
Two-dimensional pipelined scheduling technique does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Two-dimensional pipelined scheduling technique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-dimensional pipelined scheduling technique will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4141984