Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2006-06-20
2006-06-20
Pezzlo, John (Department: 2662)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S360000, C370S411000
Reexamination Certificate
active
07065074
ABSTRACT:
A generalized divide-and-conquer network and concomitant methodology for recursively constructing large-scaled switching fabrics to meet the need for present-day broadband switching. Such a network achieves optimal layout complexity among the class of banyan-type networks under the 2-layer Manhattan model with reserved layers, which has been the most popular layout model for CMOS technologies. Moreover, the network achieves optimal structure modularity that minimizes the number of different components required at each step of the recursive construction. The recursive construction of a 2n×2ngeneralized divide-and-conquer network can be readily mapped by an n-leaf balanced binary tree.
REFERENCES:
patent: 4523273 (1985-06-01), Adams et al.
patent: 4623996 (1986-11-01), McMillen
patent: 4852091 (1989-07-01), Li
patent: 4899334 (1990-02-01), Shimizu
patent: 4905225 (1990-02-01), Francois et al.
patent: 4945534 (1990-07-01), Driscoll et al.
patent: 4955017 (1990-09-01), Eng et al.
patent: 4970507 (1990-11-01), Cooperman et al.
patent: 5123011 (1992-06-01), Hein et al.
patent: 5148428 (1992-09-01), Lee
patent: 5166926 (1992-11-01), Cisneros et al.
patent: 5184346 (1993-02-01), Kozaki et al.
patent: 5216668 (1993-06-01), Zhang
patent: 5299317 (1994-03-01), Chen et al.
patent: 5303383 (1994-04-01), Neches et al.
patent: 5353283 (1994-10-01), Tsuchiya
patent: 5367518 (1994-11-01), Newman
patent: 5367520 (1994-11-01), Cordell
patent: 5369635 (1994-11-01), Gandini et al.
patent: 5371495 (1994-12-01), Sturges et al.
patent: 5396231 (1995-03-01), Hein
patent: 5426733 (1995-06-01), Masui
patent: 5450074 (1995-09-01), Yoshifuji
patent: 5451936 (1995-09-01), Yang et al.
patent: 5471628 (1995-11-01), Phillips et al.
patent: 5483541 (1996-01-01), Linsky
patent: 5500858 (1996-03-01), McKeown
patent: 5506840 (1996-04-01), Pauwels et al.
patent: 5517495 (1996-05-01), Lund et al.
patent: 5541914 (1996-07-01), Krishnamoorthy et al.
patent: 5566179 (1996-10-01), Kobayashi et al.
patent: 5568477 (1996-10-01), Galand et al.
patent: 5583861 (1996-12-01), Holden
patent: 5600630 (1997-02-01), Takano et al.
patent: 5602844 (1997-02-01), Lyles
patent: 5623698 (1997-04-01), Stephenson et al.
patent: 5671222 (1997-09-01), Chen et al.
patent: 5689505 (1997-11-01), Chiussi et al.
patent: 5689506 (1997-11-01), Chiussi et al.
patent: 5724349 (1998-03-01), Cloonan et al.
patent: 5724351 (1998-03-01), Chao et al.
patent: 5768270 (1998-06-01), Ha-Duong
patent: 5802052 (1998-09-01), Venkataraman
patent: 5809021 (1998-09-01), Diaz et al.
patent: 5841775 (1998-11-01), Huang
patent: 5852407 (1998-12-01), Ishii et al.
patent: 5859846 (1999-01-01), Kim et al.
patent: 5896371 (1999-04-01), Kobayashi et al.
patent: 5940389 (1999-08-01), Yang et al.
patent: 5949778 (1999-09-01), Abu-Amara et al.
patent: 5963554 (1999-10-01), Song
patent: 5987028 (1999-11-01), Yang et al.
patent: 6052373 (2000-04-01), Lau
patent: 6058112 (2000-05-01), Kerstein et al.
patent: 6067298 (2000-05-01), Shinohara
patent: 6081512 (2000-06-01), Muller et al.
patent: 6157643 (2000-12-01), Ma
patent: 6160806 (2000-12-01), Cantwell et al.
patent: 6215786 (2001-04-01), Larson et al.
patent: 6219349 (2001-04-01), Kobayashi et al.
patent: 6259699 (2001-07-01), Opalka et al.
patent: 6269353 (2001-07-01), Sethi et al.
patent: 6307854 (2001-10-01), Webb
patent: 6335930 (2002-01-01), Lee
patent: 6370155 (2002-04-01), Cantwell et al.
patent: 6400708 (2002-06-01), Bartholomew et al.
patent: 6427037 (2002-07-01), Okayama
patent: 6473827 (2002-10-01), McMillen et al.
patent: 6493347 (2002-12-01), Sindhu et al.
patent: 6553031 (2003-04-01), Nakamura et al.
patent: 6556725 (2003-04-01), Kondo et al.
patent: 6563819 (2003-05-01), Park
patent: 6563837 (2003-05-01), Krishna et al.
patent: 6600741 (2003-07-01), Chrin et al.
patent: 6611519 (2003-08-01), Howe
patent: 6621828 (2003-09-01), Field et al.
patent: 6628651 (2003-09-01), Ryan et al.
patent: 6647017 (2003-11-01), Heiman
patent: 6657998 (2003-12-01), Li
patent: 6714562 (2004-03-01), Calvignac et al.
patent: 6721324 (2004-04-01), Shinohara
patent: 6735203 (2004-05-01), Heiman
patent: 6747971 (2004-06-01), Hughes et al.
patent: 6757281 (2004-06-01), Irish
patent: 6757282 (2004-06-01), Ofek
patent: 6798777 (2004-09-01), Ferguson et al.
patent: 6829237 (2004-12-01), Carson et al.
patent: 6834038 (2004-12-01), Zelig et al.
patent: 6850524 (2005-02-01), Troxel et al.
patent: 6859455 (2005-02-01), Yazdani et al.
patent: 2002/0018475 (2002-02-01), Ofek et al.
patent: 2002/0031124 (2002-03-01), Li
patent: 2002/0176526 (2002-11-01), Mejia
“Access and Alignment of Data in an Array Processor”, by Lawrie, IEEE Trans. on Computers, vol. c-24, No. 12, Dec., 1975 pp. 1145-1155.
“The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching”, by Yeh et. al, IEEE Journal on Selected Comm, vol. SAC-5, No. 8, Oct. 1987, pp. 274-282.
“Optimal, Multi-Stage Interconnection by Divide-and-Conquer Networks”, by Li, Proc. of Second IASTED Conf, Dec. 1998, pp. 318-323.
Akin Gump Strauss Hauer & Feld & LLP
Industrial Technology Research Institute
Pezzlo John
LandOfFree
Generalized divide-and-conquer networks does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Generalized divide-and-conquer networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized divide-and-conquer networks will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3681910