Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-06-27
2006-06-27
Nguyen, Brian (Department: 2661)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S258000, C709S238000
Reexamination Certificate
active
07068671
ABSTRACT:
A network or interconnect structure utilizes a data flow technique that is based on timing and positioning of messages communicating through the interconnect structure. Switching control is distributed throughout multiple nodes in the structure so that a supervisory controller providing a global control function and complex logic structures are avoided. The interconnect structure operates as a “deflection” or “hot potato” system in which processing and storage overhead at each node is minimized. Elimination of a global controller and buffering at the nodes greatly reduces the amount of control and logic structures in the interconnect structure, simplifying overall control components and network interconnect components and improving speed performance of message communication.
REFERENCES:
patent: 4814980 (1989-03-01), Peterson et al.
patent: 4933836 (1990-06-01), Tulpule et al.
patent: 5181017 (1993-01-01), Frey, Jr. et al.
patent: 5224100 (1993-06-01), Lee et al.
patent: 5253248 (1993-10-01), Dravida et al.
patent: 5339396 (1994-08-01), Muramatsu et al.
patent: 5377333 (1994-12-01), Nakagoshi et al.
patent: 5471623 (1995-11-01), Napolitano, Jr.
patent: 5546596 (1996-08-01), Geist
patent: 5553078 (1996-09-01), Horie
patent: 5577029 (1996-11-01), Lu et al.
patent: 5583990 (1996-12-01), Birrittella et al.
patent: 5606551 (1997-02-01), Kartalopoulos
patent: 5617413 (1997-04-01), Monacos
patent: 5694393 (1997-12-01), Kaye
patent: 5774369 (1998-06-01), Horstmann et al.
patent: 5781551 (1998-07-01), Born
patent: 5996020 (1999-11-01), Reed
patent: 6578010 (2003-06-01), Teacherson
patent: 94 12939 (1994-06-01), None
patent: 95 16240 (1995-06-01), None
Aruna V. Ramanan, “Ultrafast Space-Time Networks for Multiprocessors”, a thesis, 1993, pp. 1-170.
Malek M., et al.: “The Cylindrical Banyan Multicomputer: A Reconfigurable Systolic Architecture”, May 1, 1989, pp. 319-327, Parallel Computing, XP000065558.
Isaac Yi-Yuan Lee et al.: “A Versatile Ring-Connected Hypercube”, Jun. 1, 1994, pp. 60-67, IEEE Micro, pp. 60-67, XP000448657.
Narashima Reddy: “I/O Embedding in Hypercubes”, Aug. 19, 1988, pp. 331-338, Proceedings of the 1988 Intern'l Conf. on Parallel Processing, Pennsylvania State Univ., XP002016775.
Catier: “Une architecture “hypercube”.”, Sep. 1986, pp. 59-64, Electronique Industrielle, XP002016776.
Welty: “Hypercube architectures”, Jan. 19, 1986, pp. 495-501, AFIPS Conference Proceedings 1986 National Computer Conference, XP002016777.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing (Cat. No. 91TH0396-2), DAllas, TX, USA, Dec. 2-5, 1991, ISBN 0-8186-2310-1, Los Alamitos, CA, USA, IEEE Compt. Soc. Press, USA, pp. 564-571.
Young, S.D., et al, “Adaptive Routing in Generalized Hypercube Architectures”, IEEE Symposium, Dec. 2-5, 1991, pp. 564-571, XP002024983.
Gaughan, P.T. et al.: “Adaptive Routing Protocols for Hypercube Interconnection Networks”,Computer, vol. 26, No. 5, May 1, 1993, pp. 12-16, 17-23, XP000365279.
Koestner Bertani LLP
National Security Agency
Nguyen Brian
LandOfFree
Multiple level minimum logic network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multiple level minimum logic network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple level minimum logic network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3686147