Multiplex communications – Wide area network – Packet switching
Patent
1989-06-16
1992-03-10
Safourek, Benedict V.
Multiplex communications
Wide area network
Packet switching
370 951, 379 22, 34082504, 34082552, H04J 324
Patent
active
050954806
ABSTRACT:
A plurality of disparate communication network systems communicate with each other through the use of different physical media protocols. Each of the systems has at least one input and one output. A message routing system couples a transmitter at any one system input to a receiver at any other system output using a message format that is structure independent of the location of the receiver in the system. Each receiver/transmitter device coupled to any one system input has a unique, fixed and unchangeable identification code regardless of the communication network system to which it is connected. To couple a message from any one receiver/transmitter device to a second receiver/transmitter device at an unknown location within the communication network system, a message format is transmitted from the sending location containing the fixed, unique identification code of the receiving station. A routing system having a plurality of intermediate routing devices receives the message format and couples it to the receiving station at the unknown location using only the fixed, unique identification codes of the transmitting and receiving stations and the addresses of the intermediate routing devices for determining routing.
REFERENCES:
patent: 4742511 (1988-05-01), Johnson
patent: 4843622 (1989-06-01), Yotsutani
patent: 4866431 (1989-09-01), Andros
patent: 4875208 (1989-10-01), Furuhashi et al.
patent: 4887265 (1989-12-01), Felix
patent: 4912756 (1990-03-01), Hop
patent: 4953162 (1990-08-01), Lyons et al.
"LAN Interoperability Study of Protocols Needed for Distributed Command and Control" by W. L. Eldon, A. L. Miller, S. L. Morgan and B. A. Romanzo Rome Air Development Center DTIC AD-A154-003 (Mar. 1985).
"C31 Information Systems Internetwork Study" by T. C. Bartee, O. P. Buneman, J. M. McQuillan, and S. T. Walker Institute for Defense Analysis (Apr. 1984).
"Inter-network Naming, Addressing, and Routing" by J. F. Shoch IEEE Proceedings of Compcon (1978).
"Addressing Problems in Multi-network Systems" C. A. Sunshine IEEE Proc. INFOCOM (1982).
"Multi-cast Routing in Internetworks and Extended LANs" by S. E. Deering ACM SIGCOMM (1988).
"A Trade-off Between Space and Efficiency for Routing Tables" by David Peleg and Eli Upfal Journal of the ACM (Jul. 1989).
"The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Systems" by Paul F. Tsuchiya ACM SIGCOMM `88 Symposium on Communications Architectures & Protocols Stanford, Calif. (Aug. 1988).
"Dynamic Hashing Schemes" by R. J. Enbody and H. C. Du in ACM Computing Surveys, vol. 20, No. 2 (Jun. 1988).
"Hashing for Dynamic and Static Internal Tables" T. G. Lewis and C. R. Cook in IEEE Computer Magazine (Oct. 1988).
"Should Tables be Sorted" by Andrew Chi-Chih Yao Journal of the ACM (Jul. 1981).
"Storing a Table with 0(1) Worst Case Access Time" by M. L. Fredman, J. Komolos and E. Szemeredi Journal of the ACM (Jul. 1984).
"Hashing in Practice, Analysis of Hashing and Universal Hashing" by M. V. Ramarkrishna Proceedings of ACM SIGMOD (Jun. 1988).
"Linear Hashing with Overflow-Handling by Linear Probing" by P. A. Larson in ACM Transactions on Database System (Mar. 1985).
"Analysis of Dynamic Hashing with Deferred Splitting" by E. Veklerov in ACM Transactions on Database Systems (Mar. 1985).
"Partial-Match Retrieval Using Hashing and Descriptors" by K. Ramamohanarao, J. W. Lloyd, and J. A. Thom in ACM Transactions on Database Systems (Dec. 1983).
"New File Organization Based on Dynamic Hashing" by Michael School in ACM Transactions on Database Systems (Mar. 1981).
"Analysis of Uniform Hashing" by Per-Ake Journal of the ACM (Oct. 1983).
"Bounded Index Exponential Hashing" by David B. Lomet ACM Transactions on Database Systems (Mar. 1983).
"Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions" by G. Jaeschke Communications of the ACM (Dec. 1981).
"Dynamic Hash Table" by Per-Ake Larson Communications of the ACM (Apr. 198).
"Data Compression" by D. A. Lelewer and D. S. Hirschberg, ACM Computing Surveys (Sep. 1987).
"Arithmetic Coding for Data Compression" by I. H. Whitten, R. H. Neal, and J. C. Cleary, Communications of the ACM Jun., 1987.
"A Working-Set Coprocessor" by Milan Milenkovic, SMU Technical Report (Mar. 1989).
"An Adaptive Dependency Source Model for Data Compression" by David M. Ambrahamson, Communications of the ACM (Jan. 1989).
"A multiplication-Free Multialphabet Arithmetic Code" by J. Rissanen and K. M. Mohiuddin IEE Transactions on Communications (Feb. 1989).
Hsu Alpus H.
O'Neil Michael A.
Safourek Benedict V.
LandOfFree
Message routing system for shared communication media 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 Message routing system for shared communication media networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message routing system for shared communication media networks will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2289966