Packet routing switch

Multiplex communications – Wide area network – Packet switching

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

370 941, 370 8514, H04L 1256

Patent

active

052260399

ABSTRACT:
A switch is provided for selectively routing digital information packets received from at least first and second external sources to at least first and second external destinations. At least one of the first sources generates an information packet including a datum, or a request therefore, and a corresponding descriptor. First and second routing interconnects have inputs for receiving packets from respective sources and outputs for transmitting packets to respective destinations. The interconnects are also coupled for transferring packets between one another. Directories within the interconnects store descriptors corresponding to data associated with the first destination, as well as requests routed from the other interconnect. A controller routes packets based on the correspondence, or lack thereof, between the descriptor in that packet and an entry signal allocated to corresponding directory.

REFERENCES:
patent: Re28811 (1976-05-01), Pierce
patent: 3713096 (1973-01-01), Comfort et al.
patent: 3723976 (1973-03-01), Alvarez et al.
patent: 3731002 (1973-05-01), Pierce
patent: 3735362 (1973-05-01), Ashany et al.
patent: 3748647 (1973-07-01), Ashany et al.
patent: 4011545 (1977-03-01), Nadir
patent: 4031512 (1977-06-01), Faber
patent: 4077059 (1978-02-01), Cordi et al.
patent: 4141067 (1979-02-01), McLagan
patent: 4240143 (1980-12-01), Besemer et al.
patent: 4245306 (1981-01-01), Besemer et al.
patent: 4293910 (1981-10-01), Flusche et al.
patent: 4322795 (1982-03-01), Lange et al.
patent: 4334305 (1982-06-01), Girardi
patent: 4394731 (1983-06-01), Flusche et al.
patent: 4410946 (1983-10-01), Spencer
patent: 4468733 (1984-08-01), Oka et al.
patent: 4484262 (1984-11-01), Sullivan et al.
patent: 4503497 (1985-03-01), Krygowski et al.
patent: 4510492 (1985-04-01), Mori et al.
patent: 4598400 (1986-07-01), Hillis
patent: 4604694 (1986-08-01), Hough
patent: 4622631 (1986-11-01), Frank et al.
patent: 4625081 (1986-11-01), Latito et al.
patent: 4646271 (1987-02-01), Uchiyama et al.
patent: 4700347 (1987-10-01), Rettberg et al.
patent: 4701756 (1987-10-01), Burr
patent: 4706080 (1987-11-01), Sincoskie
patent: 4734907 (1988-03-01), Turner
patent: 4754394 (1988-06-01), Brantley, Jr. et al.
patent: 4780873 (1988-10-01), Mattheyses
patent: 4797880 (1989-01-01), Bussey, Jr. et al.
patent: 4811009 (1989-03-01), Orimo et al.
patent: 4814970 (1989-03-01), Barbagelata et al.
patent: 4829227 (1989-05-01), Turner
patent: 4845702 (1989-07-01), Melindo
patent: 4885742 (1989-12-01), Yano
patent: 4951193 (1990-08-01), Muramatsu et al.
patent: 4984235 (1991-01-01), Hillis et al.
European Search Report for EP 91 11 6719.
Midkiff et al., "Architectural Support for Interprocessor Communication . . . " Proc. of the 6th Annual Phoenix Conf. on Computers and Communications, Feb. 25-27, 1987, pp. 14-17.
European Search Report for EP 91 30 4493.
Ciepielewsik et al., "A Formal Model for Or-Parallel . . . ", Proc. of the IFIP 9th World Computer Congress (1983) pp. 299-305.
Censier et al., "A New Solution to Coherence . . . ", IEEE Transaction on Computers, vol. c-27, No. 12 (Dec. 1978) pp. 1112-1118.
Eggers et al., "Evaluating the Performance of Four . . . ", Proc. of the 16th Annual Int'l Symposium on Computer Archit. (1989) pp. 2-15.
Gehringer et al., "The Cm* Hardware Architecture", Parallel Proc. the Cm* Experience, Digital Press, pp. 11-28, 432, 438.
Goodman et al., "The Wisconsin Multicube: A New . . . ", Proc. of the 15th Annual Int'l Symposium on Computer Archit. (1988) pp. 422-431.
Mizrahi et al., "Introducing Memory into the Switch . . . ", Proc. of the 16th Annual Int'l Symposium on Computer Archit. (1989) pp. 158-166.
Pfister et al., "The IBM Research Parallel Processor . . . ", IEEE Proc. of the 1985 Int'l Conf. on Parallel Proc. (1985) pp. 764-771.
Tabak, "Chapter 8 Bus-Oriented Systems", Multiprocessors, Prentice Hall (1990) pp. 92-102.
Wilson, Sr. Editor, "Increased CPU Speed Drives Changes in Multiprocessor Cache and Bus Designs", Computer Desing, (Jun. 1987) p. 20.
Ali et al., "Global Garbage Collection for Distributed . . . ", Int'l Jo. of Parallel Programming, vol. 15, No. 5 (1986) pp. 339-387.
Lovett et al., Proceedings 1988 Int'l. Conf. on Parrell Proc., v. 1, Penn State Univ. Press (Conf. Aug. 15-19, 1988) pp. 303 et seg.
Kai Li et al., Proceedings 1989 Int'l. Conf. on Parallel Processing, Penn State Univ. Press (Conf. Aug. 8-12 1989) p. 1-125 et seg.
Papamarcos et al., Proc. of 11th Annual Symposium on Computer Architecture (Conf. Jun. 5-7 1984) pp. 348 et seg (IEEE).
"High Performance/High Availability Interprocessor Communication Method," IBM Technical Disclosure Bulletin, vol. 31, No. 2, Jul. 1988, pp. 41-42.
Schwartz, Telecommunications Network, "Introduction & Overview" pp. 1-20, "Layered Architectures in Data Networks" pp. 71-117.
Haridi et al, "The Cache Coherence Protocol of the Data Diffusion Machine" pp. 1-18.
Warren et al, "Data Diffusion Machine-A Scalable . . . ", Proceedings of the International Conference on Fifth . . . , 1988, pp. 943-952.
Hagersten et al, "The Data Diffusion Machine and Its Data Coherency Protocols", Proceedings of the IFIP, pp. 127-148 (1990).
Hagersten, "Some Issues on Cache-Only Memory Architecture," Scalable Shared Memory Multiprocessors. May 1990. p. 12.

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

Packet routing switch does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Packet routing switch, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet routing switch will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1695443

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