Abstract
During the last decade, the expansion of local area computer networks has been impressive, regarding industrial applications as well as office implementation. This developping trades do not seem to stop in the near future [1]. On the other hand, the public data and telephone networks are continuously changing from amalog to digiatal techniques, reinforcing their reliability, ensuring the transimission of any kind of information (voice, data, image) over large distances with very low transmission error probabilities. New kinds of telecommunications networks have been appeared, for example, Metropolitan Area Networks (MANs), Cable Television Networks, Videotex Networks et.c. As a result, the necessity to interconnect all these telecommunications facilities into one integrated network has become apparent. This enormous ability of information transfer angments the productivity and the automation of any job giving to people the possibility to be supervisors rather and not hardworkers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Sunshine, “Network Interconnection and gateways”, IEEE Selected Areas in Communications, vol. 8, no. 1, 1990, pp. 4–12.
D. Estrin, “Interconnection Protocols for Interorganisation Networks” IEEE Selected Areas in Communications, vol. 5, no 9, 1987 pp. 1480–1492.
M. Gien, H. Zimmerman, “Design principles for network interconnection” Proc. VI Data Comm. Symp. (IEEE/ACM), 1979, pp. 109–119.
P. Green “Protocol Conversion” IEEE Trans Commun, vol. 34, 1986. pp. 257–268.
V. Warrier, C. Sunshine, “A Platform for Heterogeneous interconnection Network Management” IEEE Selected Areas in Communications, vol. 8, no 1., 1990, pp. 119–127.
J. Jaffe, F. Moss, “A Responsive Distributed Routing Algorithm for Computer Network” IEEE Trans on Comm. vol. 30, no. 7, 1982, pp. 1758–1762.
J. Garcia-Luna-Aceves, “A New Minimum Hop Routing Algotithm” Proc. IEEE Infocom’87 pp. 170–180.
R. Perlman, “Hierarchical Networks and the Subnetwork Partition Problem” Computer Networks and ISDN Systems, 1985, vol. 9, pp. 297–303.
P. Bell et al, “Review of Point-to-Point Routing Algorithms” IEEE Commun Magazine, vol. 24, 1986, pp. 34–38
P. Tsuchiya, “The landmark hierarchy: A new hierachy for routing in very large networks”, ACM SIGCOMM, 1988, pp. 8–14.
V. Voydock, “Security Mechanisms in High-Level Network Protocols” ACM Computing Surveys., vol. 15, no. 2, 1983 pp 135–171.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Pavlidou, NF., Papathanassiu, B. (1991). Design of Interfactory Computer Network Interconnection. In: Fandel, G., Zäpfel, G. (eds) Modern Production Concepts. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76401-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-76401-1_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-76403-5
Online ISBN: 978-3-642-76401-1
eBook Packages: Springer Book Archive