Packet switching node

Details Packet switching node Packet switching node

2006-12-05

2006-12-05

Nguyen, Hanh (Department: 2616)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S400000, C370S328000, C370S397000, C370S352000, C455S428000, C455S436000

Reexamination Certificate

active

07145906

ABSTRACT:
To provide fast access times with very large key fields, an associative memory utilizes a location addressable memory and lookup table to generate from a key the address in memory storing an associated record. The lookup tables, stored in memory, are constructed with the aid of arithmetic data compression methods to create a near perfect hashing of the keys. For encoding into the lookup table, keys are divided into a string of symbols. Each valid and invalid symbol is assigned an index value, such that the sum of valid index values for symbols of a particular key is a unique value that is used as an address to the memory storing the record associated with that key, and the sum of keys containing invalid index values point to a location in memory containing similar data. Utilizing the lookup tables set and relational operations maybe carried out that provide a user with a maximum number of key records resulting from a sequence of intersection, union and mask operations.

REFERENCES:
patent: 3355556 (1967-11-01), Chaney
patent: 3678391 (1972-07-01), Gough
patent: 3906445 (1975-09-01), Beckmann et al.
patent: 3979733 (1976-09-01), Fraser
patent: 3987251 (1976-10-01), Texier et al.
patent: 3988544 (1976-10-01), Texier et al.
patent: 4040023 (1977-08-01), Curtis et al.
patent: 4112257 (1978-09-01), Frost
patent: 4168401 (1979-09-01), Molleron et al.
patent: 4233473 (1980-11-01), Frost
patent: 4276643 (1981-06-01), Laprie et al.
patent: 4287592 (1981-09-01), Paulish et al.
patent: 4313035 (1982-01-01), Jordan et al.
patent: 4480328 (1984-10-01), Alaria et al.
patent: 4494230 (1985-01-01), Turner
patent: 4513175 (1985-04-01), Smith
patent: 4519068 (1985-05-01), Krebs et al.
patent: 4547877 (1985-10-01), Lehman et al.
patent: 4565903 (1986-01-01), Riley
patent: 4597078 (1986-06-01), Kempf
patent: 4603416 (1986-07-01), Servel et al.
patent: 4606002 (1986-08-01), Waisman et al.
patent: 4627052 (1986-12-01), Hoare et al.
patent: 4638475 (1987-01-01), Koike
patent: 4644351 (1987-02-01), Zabarsky et al.
patent: 4658416 (1987-04-01), Tanaka
patent: 4661951 (1987-04-01), Segarra
patent: 4706080 (1987-11-01), Sincoskie
patent: 4706081 (1987-11-01), Hart et al.
patent: 4707827 (1987-11-01), Bione et al.
patent: 4715030 (1987-12-01), Koch et al.
patent: 4720855 (1988-01-01), Ohnishi et al.
patent: 4736363 (1988-04-01), Aubin et al.
patent: 4737953 (1988-04-01), Koch et al.
patent: 4740954 (1988-04-01), Cotton et al.
patent: 4742511 (1988-05-01), Johnson
patent: 4751728 (1988-06-01), Treat
patent: 4756020 (1988-07-01), Fodale
patent: 4769834 (1988-09-01), Billinger et al.
patent: 4775999 (1988-10-01), Williams
patent: 4776003 (1988-10-01), Harris
patent: 4780873 (1988-10-01), Mattheyses
patent: 4791665 (1988-12-01), Bogart
patent: 4792753 (1988-12-01), Iwai
patent: 4797881 (1989-01-01), Ben-Artzi
patent: 4807222 (1989-02-01), Amitay
patent: 4811337 (1989-03-01), Hart
patent: 4812843 (1989-03-01), Champion, III et al.
patent: 4831620 (1989-05-01), Conway et al.
patent: 4831647 (1989-05-01), D'Avello et al.
patent: 4833701 (1989-05-01), Comroe
patent: 4843622 (1989-06-01), Yotsutani et al.
patent: 4845740 (1989-07-01), Tokuyama et al.
patent: 4860003 (1989-08-01), DeLuca et al.
patent: 4860336 (1989-08-01), D'Avello et al.
patent: 4860341 (1989-08-01), D'Avello et al.
patent: 4865432 (1989-09-01), Aoyagi et al.
patent: 4866431 (1989-09-01), Andros et al.
patent: 4866763 (1989-09-01), Cooper et al.
patent: 4870679 (1989-09-01), Hanna et al.
patent: 4875208 (1989-10-01), Furuhashi et al.
patent: 4876738 (1989-10-01), Selby
patent: 4887265 (1989-12-01), Felix
patent: 4896319 (1990-01-01), Lidinsky et al.
patent: 4905231 (1990-02-01), Leung et al.
patent: 4912756 (1990-03-01), Hop
patent: 4916691 (1990-04-01), Goodman
patent: 4922503 (1990-05-01), Leone
patent: 4933937 (1990-06-01), Konishi
patent: 4953162 (1990-08-01), Lyons et al.
patent: 4975906 (1990-12-01), Takiyaso et al.
patent: 4989204 (1991-01-01), Shimizu et al.
patent: 5018137 (1991-05-01), Backes et al.
patent: 5050165 (1991-09-01), Yoshioka et al.
patent: 5058109 (1991-10-01), Goldberg et al.
patent: 5060228 (1991-10-01), Tsutsui et al.
patent: 5095480 (1992-03-01), Fenner
patent: 5164943 (1992-11-01), Waggoner
patent: 5168498 (1992-12-01), Adams et al.
patent: 5309437 (1994-05-01), Perlman et al.
patent: 5365520 (1994-11-01), Wang et al.
patent: 5490258 (1996-02-01), Fenner
patent: 5561706 (1996-10-01), Fenner
patent: 5842224 (1998-11-01), Fenner
patent: 5860136 (1999-01-01), Fenner
patent: 6819670 (2004-11-01), Fenner
patent: 2005/0063382 (2005-03-01), Fenner
patent: 0 255 767 (1988-02-01), None
patent: 2513472 (1983-03-01), None
patent: 2 189 112 (1987-10-01), None
patent: 2193861 (1988-02-01), None
U.S. Appl. No. 07/737,147, abandoned, Fenner.
Estrin, Deborah, “Interconnection Protocols for Interoganization Networks,” Reprinted from IEEE J. Selected Areas Commum., vol. SAC-5, No. 9, pp. 1480-1491, Dec. 1987.
Tsudik, Gene, “Implications of Fragmentation and Dynamic Routing for Internet Datagram Authentication,” Networks and Distributed Systems Laboratory, Computer Science Department, University of Southern California and IBM Los Angeles Scientific Center, pp. 22-30.
Tsuchiya, Paul F, “The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks,” The Mitre Corporation, pp. 35-42, 1988 ACM.
Shoch, John F., “Inter-Network Naming, Addressing, and Routing,” Reprinted from IEEE Proc. COMPCON, pp. 72-79, 1978.
Deering, Stephen E., “Multicast Routing in Internetworks and Extended LANs,” pp. 55-64, 1988 ACM.
Sunshine, Carl A., “Addressing Problems in Multi-Network Systems,” Reprinted from IEEE Proc. INFOCOM, pp. 12-18, 1982.
Kleinrock, Leonard et al., “Hierarchical Routing for Large Networks, Peformance Evaluation and Optimization,” Reprinted from Computer Networks, vol. 1, pp. 155-174, Jan. 1977.
Elden, Walter L. et al., “LAN Interoperability Study of Protocols Needed for Distributed Command and Control,” Final Technical Report, Mar. 1985.
Bartee, T.C. et al., “C3I Information Systems Internetwork Study,” Institute for Defense Analyses, Apr. 1984.
G. Parr, “Address Resolution for an Intelligent Filtering Bridge Running on a Subnetted Ethernet System,” Institute of Informatics, Computer Science Dept., 1987, pp. 48-70, Univ. of Ulster at Coleraine, County Londonderry, N. Ireland.
Wai Sum Lai, “Packet Forwarding,” IEEE Communications Magazine, Jul. 12, 1988, pp. 8-17, vol. 26, No. 7.
G. Parr, “A More Fault Tolerant Approach to Address Resolution for a Multi-Lan System of Ethernets,”Network Working Group, Request for Comments: 1029, May 12, 1988, pp. 1-16, University of Ulster.
U.S. Appl. No. 90/007,970, filed Mar. 9, 2006, Fenner.
Karn, P., “TCP/IP: A Proposal For Amateur Packet Radio Levels 3 and 4,” Jan. 1, 1998, pp. 4.62-4.68, Radio Amateur Satellite Corporation.
Brayer, K., “Routing in a Mobile Network—Fact or Fantasy,” Data Communications, Aug. 1, 1983, pp. 145-159, Mitre Corporation; Bedford, MA.
“DECnet Digital Network Architecture routing layer functional specification,” May 1, 1983, pp. 2-94 + Appendix A-2 through I-5, Digital Equipment Corporation; Maynard, MA.
Oran, D., “Digital Network Architecture Phase V Seminar,” Jan. 1, 1988, pp. 1-38.
Finn, G., “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Mar. 1, 1987, pp. 1-61, Information Sciences Institute; Marina del Rey, CA.
Hawe, B., et al., Transparent Interconnection of Local Area Networks with Bridges, Jun. 1, 1984, pp. 116-130, Computer Science Press, Inc.
Sincoskie, W., et al., “Transparent Interconnection of Broadcast Networks,” Mar. 11, 1986, pp. 131-134, Bell Communication Research; Morristown, NJ.
Sincoskie, W., et al., “Extended Bridge Algorithms for Large Networks,” Jan. 1, 1988, pp. 16-24, vol. 2, No. 1, IEEE Network.
Su, Zaw-Sing, et al., “Internetwork Acco

Affiliated with

Also associated with

Rating

Packet switching node 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 switching node, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet switching node will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3710383