Skip to main content
SpringerLink
Log in

Modeling and Design of Distributed Information Systems

  • Chapter
Book cover Advances in Information Systems Science

Abstract

Advances in communication technology have made the design of sophisticated computer networks feasible. A principal advantage of a computer network is that it permits the sharing and exchange of information and computational resources by a large number of users. An evolutionary extension to the concept of data sharing is now possible: geographically distributed and physically dissimilar databases may be treated as though they comprise a single, logically uniform database.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References and Suggested Further Reading

Distributed Computer Systems, General

  1. P. Alsberg, An Experiment in Distributed Computing, Report from the Center for Advanced Computation, University of Illinois, Urbana (1973).

    Google Scholar 

  2. Distributed intelligence in data communications, EDP Analyzer II, No. 2 (1973).

    Google Scholar 

  3. In your future: distributed systems?, EDP Analyzer II, No. 8 (1973).

    Google Scholar 

  4. Structures for future systems, EDP Analyzer 12, No. 8 (1974).

    Google Scholar 

  5. P. Buran, S. Boehm, and P. Smith, On Distributed Communications, RM-3420-PR, series of 11 reports by RAND Corporation (1964).

    Google Scholar 

  6. R. P. Bigelow, Some legal and regulatory problems of multiple access computer network, in “Proc. Interdisciplinary Conf. on Multiple Access Computer Networks,” p. 4–5-1 (1970).

    Google Scholar 

  7. J. Davis, Distribution or centralized control?, Automation (Cleveland) 1973 (May), 42–45.

    Google Scholar 

  8. D. J. Farber et al., The distributed computing system, in “Digest of Papers, COMP-CON 73,” pp. 31–34 (1973).

    Google Scholar 

  9. G. Glaser, The centralization vs. decentralization issue : arguments, alternatives, and guidelines, DATA BASE, Quarterly Newsletter of the ACM Special Interest Group on Business Data Processing, 2, No. 3, Fall/Winter (1970).

    Google Scholar 

  10. R. C. Guarino, Sr., Problems of integration and consolidation of data processing operations, a presentation at Session FA Si 4.1 at the TIMS/ORSA/AIIE Joint National Meeting, Atlantic City, New Jersey (1972).

    Google Scholar 

  11. R. E. Kahn, Resource sharing computer communication networks, Proc. IEEE 60, 1397–1407 (1972).

    Article  Google Scholar 

  12. M. Kochen and K. W. Deulsch, Toward a rational theory of decentralization : some implications of a mathematical approach, Pol. Sci. Rev. 63, (1969).

    Google Scholar 

  13. M. Kochen and K. W. Deulsch, Decentralization by function and space, Manage. Sci. 19, 841–856 (1973).

    Article  Google Scholar 

  14. R. F. Littrell, Economies of scale in the IBM 360 and 370, Datamation 1974 (March), 83–88.

    Google Scholar 

  15. A. S. Manne, Plant location under economies of scale—recentralization and computation, Manage. Sci. II, 213–235 (1964).

    Article  Google Scholar 

  16. P. K. Merrill, Computer Netting and Distributing Data: A Tutorial, IBM Technical Report No. TR02.610 (1974).

    Google Scholar 

  17. E. Seals and S. M. Drenzer, A Computer Centralization Cost Model for Conceptual Design, RAND Corporation Report R-1268-PR, Santa Monica, California (September, 1973).

    Google Scholar 

  18. G. S. Speers, Monitoring/control by distributed computing, Datamation 1973 (July), 47–48.

    Google Scholar 

  19. D. N. Streeter, Centralization or dispersion of computing facilities, IBM Syst. J. No. 3, 283–301 (1973).

    Article  Google Scholar 

  20. Strom and Walker, Distributed computer-communication networks, in “Proc. Brooklyn Polytechnic Symp. Computer Communications, Networks and Teletraffic,” Vol. 23 (1972).

    Google Scholar 

  21. A. H. Weis, Distributed Network Activity at IBM, IBM Research Report RC3392 (1971).

    Google Scholar 

  22. N. E. Willmorth, The economies of scale and distributed intelligence, in “Proc. Symp. Computer-Communications Networks and Teletraffic,” New York, pp. 557–564 (1972).

    Google Scholar 

Workload Description

  1. J. D. Couger and R. W. Knapp, “System Analysis Techniques,” John Wiley, New York (1974).

    Google Scholar 

  2. D. H. Fredericksen, Describing data in computer networks, IBM Syst. J. No. 3, 257–282 (1973).

    Article  Google Scholar 

  3. R. W. Hare, Workload Analysis Model-Phase III, Air Force Data Systems Design Center, OR Project A11-72 (1972).

    Google Scholar 

  4. C. P. Wang, Parametrization of Information System Applications, IBM Research Report RJ 1199, IBM Research Laboratory, San Jose, California (April, 1973).

    Google Scholar 

System Performance

  1. G. D. Cole, Performance measurements on the ARPA computer networks, in “Computer Networks: A Tutorial” (1975).

    Google Scholar 

  2. K. C. Knight, Changes in computer performance, Datamation 12, 40–54 (1966).

    Google Scholar 

  3. K. Knight, Evolving computer performance, 1968–1967, Datamation, 14, 31–35 (1962).

    Google Scholar 

  4. E. F. Miller, Bibliography on techniques of computer performance analysis, Computer 1972 (Sep./Oct.), 35–47.

    Google Scholar 

Distributed Database Design, Software

  1. G. M. Booth, The use of distributed data bases in information networks, in “Proc. First Int. Conf. Computer Communications,” pp. 371–380 (1972).

    Google Scholar 

  2. S. Carr, S. Crocker, and V. Cerf, Host-host communication protocal in the ARPA network, in “Proc. Spring Joint Computer Conf.,” pp. 589–597 (1970).

    Google Scholar 

  3. J. C. Castle, System control in multiple access computer networks, in “Proc. Interdisciplinary Conf. Multiple Access Computer Networks,” 5–3XX (1970).

    Google Scholar 

  4. D. J. Farber and F. R. Heinrich, The structure of a distributed computer system — the distributed file system, in “Proc. Int. Conf. Computer Communication,” pp. 364–370 (1972).

    Google Scholar 

  5. D. J. Farber and F. R. Heinrich, The structure of a distributed computing system — software, in “Proc. Symp. Computer-Communications Networks and Teletraffic,” pp. 539–545 (1972).

    Google Scholar 

  6. W. M. Lay, D. L. Mills, and M. V. Zelkowitz, Operating systems architecture for a distributed computer network, “Proc. IEEE Symp. on Computer Networks: Trends and Applications,” Gaithersburg, Maryland, pp. 39–43, (1974).

    Google Scholar 

  7. T. Marrill and D. Stern, The data computer: a network data utility, in “Proc. National Computer Conf.,” Anaheim, California (1973).

    Google Scholar 

  8. R. M. Metcalfe, Strategies for Interprocess Communication in a Distributed Computing System, in “Proc. Symp. Computer-Communication Networks and Teletraffic,” New York, pp. 519–526 (1972).

    Google Scholar 

  9. R. W. Peebles, Design Considerations for a Distributed Data Access System, Technical Report AD-775-569 (Ph.D. Dissertation), Wharton School of Finance and Commerce, University of Pennsylvania, Philadelphia, Pennsylvania (May, 1973).

    Google Scholar 

  10. M. M. Somia, Super system or subsystem in a distributed computer network, in “Proc. Int. Conf. Computer Communication,” Stockholm, Sweden, pp. 315–323 (1974).

    Google Scholar 

  11. D. C. Waiden, A system for interprocess communication in a resource sharing computer network, Commun. ACM 15, 221–230 (1972).

    Article  Google Scholar 

Distributed Database Design, System Deadlock

  1. A. Bensoussan, “Overview of the Locking Strategy in the File System,” MULTICS System Programmer’s Manual, MIT, Cambridge, Massachusetts (1968).

    Google Scholar 

  2. D. Chamberlin et al., A Deadlock-Free Scheme for Resource Looking in a Data Base Environment, IBM Research Laboratory, San Jose, California (March, 1974).

    Google Scholar 

  3. W. W. Chu and G. Ohlmacher, Avoiding deadlock in distributed databases, in “Proc. ACM National Symp.”, Vol. 1, pp. 156–160 (1974).

    Google Scholar 

  4. E. Coffman et al., System deadlocks, Comput. Surv. 3, 67–68 (1971).

    Article  Google Scholar 

  5. G. Everest, Concurrent update control and data base integrity, in “IFIP Conf. Data Base Management Systems,” Cargese, Corsica (1974).

    Google Scholar 

  6. J. Gray, Locking in a Decentralized Computer System, IBM Research Report, RJ 1346, San Jose (February, 1974).

    Google Scholar 

  7. A. N. Habermann, Prevention of system deadlocks, Commun. ACM 12, 373–377 (1969).

    Article  Google Scholar 

  8. A. N. Habermann, Synchronization of communicating processes, Commun. ACM 15, 171–176 (1972).

    Article  Google Scholar 

  9. J. Havender, Avoiding deadlocks in multitasking systems, IBM Syst. J. 7, No. 2 (1968).

    Google Scholar 

  10. P. G. Hebalka, Deadlock Free Sharing of Resources in Asynchronous Systems, Project MAC Technical Report, TR-75, MIT, Cambridge, Massachusetts (1970).

    Google Scholar 

  11. R. C. Holt, Some deadlock properties of computer systems, ACM Comput. Surv. 4, 180–196 (1972).

    Article  Google Scholar 

Distributed Database Design, Privacy and Security

  1. M. Eleccion, Automatic fingerprint identification, IEEE Spectrum 1973 (September), 36–45.

    Google Scholar 

  2. W. Haberman and A. Fejfar, Automatic identification of personnel through speaker and signature verification—system description and testing, in “Proc. Carnahan Conf. Crime Countermeasures,” pp. 23–30 (1976).

    Google Scholar 

  3. N. M. Herbst and C. N. Liu, Automatic signature verification based on accelerom-etry, IBM J. Res. Dev. 21, 245–253 (1977).

    Article  Google Scholar 

  4. L. J. Hoffman, Computer and privacy: a survey, Comput. Surv. 1, 85–103 (1969).

    Article  Google Scholar 

  5. L. J. Hoffman, The formulary model for flexible privacy and access control, in “Proc. FJCC,” Las Vegas, Nevada (1971).

    Google Scholar 

  6. B. Lampson, Dynamic protection structures, in “Proc. FJCC” (1969).

    Google Scholar 

  7. P. Meissner, Evaluation of techniques for verifying personal identity, in “Proc. Fifteenth Annual Tech. Symp.—Directions and Challenges,” NBS, pp. 119–127 (1976).

    Google Scholar 

  8. R. Summers et al., A Programming Language Approach to Secure Data Base Access, IBM Los Angeles Scientific Center, G320–2662 (May, 1974).

    Google Scholar 

  9. R. Turn and N. Shapiro, Privacy and security in databank systems—measures of effectiveness, costs, and protection—intruder—interactions, in “AFIPS Conf. Proc. FJCC,” Vol. 1, Part 1, pp. 435–444 (1972).

    Google Scholar 

Distributed Database Design, File Allocation

  1. R. Casey, Design Techniques for Data Base-Oriented Computer Networks, IBM Technical Proposal, IBM San Jose Laboratory (September, 1971).

    Google Scholar 

  2. R. G. Casey, Allocation of copies of a file in an information network, in “AFIPS Conf. Proc,” Vol. 40, “Spring Joint Computer Conf.,” pp. 617–625 (1972).

    Google Scholar 

  3. A. N. Chandra, Some Considerations in the Design of Homogeneous Distributed Data Bases, IBM Research Report RC 4125, IBM Watson Research Center, Yorktown Heights, New York (November, 1972).

    Google Scholar 

  4. W. W. Chu, Optimal file allocation in a multi-computer information system, IEEE Trans, on Comput. C-18, 885–889 (1969).

    Google Scholar 

  5. M. A. Efroymson and T. L. Ray, A branch-bound algorithm for plant location, Oper. Res. 14, 361–368 (1966).

    Article  Google Scholar 

  6. E. Feldman et al., Warehouse location under continuous economy of scale, Manage. Sci. 12, 670–684 (1966).

    Article  Google Scholar 

  7. J. D. Foley and E. H. Brownlee, A model of distributed processing in computer networks, with application to satellite graphics, in “Proc. Int. Conf. Computer Communication,” Stockholm, Sweden, pp. 330–336 (1974).

    Google Scholar 

  8. J. D. Foley and E. H. Brownlee, On the Optimal Distribution of Processing in Computer Networks, Research Report, Computer Science Department, University of North Carolina, Chapel Hill (July, 1974).

    Google Scholar 

  9. W. D. Frazer, An Approximate Algorithm for Plant Location under Piecewise Linear Concave Costs, IBM Research Report RC 1875, IBM Watson Research Center, Yorktown Heights, New York (July, 1967).

    Google Scholar 

  10. S. P. Ghosh, Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching, IBM Research Report (1974).

    Google Scholar 

  11. H. R. Howson, L. R. Amey, and W. D. Thorpe, Research and Development of Parametric Cost Models to Evaluate Strategies in the Design of a National Data Bank Network, Research Report, Faculty of Management, McGill University (1974).

    Google Scholar 

  12. K. D. Levin, “Organizing Distributed Data Bases in Computer Networks,” Ph.D. Dissertation, University of Pennsylvania (1974).

    Google Scholar 

  13. H. L. Morgan and K. D. Levin, Optimal Program and Data Locations in Computer Networks, Research Report 74-10-01, Department of Decision Sciences, University of Pennsylvania (1974).

    Google Scholar 

  14. Adrian Segall, Dynamic File Assignment in a Computer Network, Electronic systems Laboratory Technical Report ESL-P-586, MIT (1975).

    Google Scholar 

  15. V. K. M. Whitney, A Study of Optimal File Assignment and Communication Network Configuration in Remote-Access Computer Message Processing and Communication Systems, University of Michigan, Electrical Engineering. Department, SEL Technical Report 48 (September, 1970).

    Google Scholar 

  16. Y. Urano, K. Ono, and S. Inoue, Optimal design of distributed networks, in “Proc. Int. Conf. Computer Communication,” Stockholm, Sweden, pp. 413–420 (1974).

    Google Scholar 

Distributed Processing and Processor Allocation

  1. L. B. Belokrinitskaya et al., Computing Techniques in Automatic Control, Automat. Remote Control [translation of Avtomati Telemeh.] 33, 142–151 (1972).

    Google Scholar 

  2. S. K. Chang and D. T. Tang, Processor Allocation in a Distributed Computer System, Research Report RC4954, IBM (July, 1974).

    Google Scholar 

  3. L. B. Ellwein, “Fixed Charge Location Allocation Problems with Capacity and Configuration Constraints,” Ph.D. Dissertation, Department of Industrial Engineering, Stanford University (1970).

    Google Scholar 

  4. D. S. Johnson, Fast allocation algorithms, in. “Proc. 13th Ann. IEEE Symp. Switching and Automata Theory” (1974).

    Google Scholar 

  5. D. S. Johnson, “Near-optimal Bin Packing Algorithms,” Doctoral Thesis, MIT (1973).

    Google Scholar 

  6. W. D. Roome and H. C. Torng, Modeling and design of computer networks with distributed computation facilities, in “Proc. IEEE Symp. Computer Networks: Trends and Applications,” Gaithersburg, Maryland, pp. 30–38 (1974).

    Google Scholar 

Distributed Network Configuration and Line-Processor Allocation

  1. L. R. Bahl and D. T. Tang, Optimization of concentrator locations in teleprocessing networks, in “Proc. Symp. Computer-Communication Networks and Teletraffic,” pp. 355–362 (1972).

    Google Scholar 

  2. R. G. Casey, Design of tree networks for distributed data, in “AFIPS Conf. Proc.” Vol. 43, “Nat. Computer Conf.,” pp. 251–257 (1973).

    Google Scholar 

  3. R. Casey and T. Friedman, Design Techniques for Data-Base-Oriented Computer Networks, IBM Research Report RJ 1222 (May, 1973).

    Google Scholar 

  4. K. M. Chandy and R. A. Russell, The design of multipoint linkages in a teleprocessing tree network, IEEE Trans. Comput. C-21, 1062–1066 (1972).

    Article  Google Scholar 

  5. K. M. Chandy, The capacitated minimum spanning tree, Networks, 3, 173–181 (1973).

    Article  Google Scholar 

  6. S. K. Chang, The generation of minimal trees with a Steiner topology, J. ACM 19, 699–711 (1972).

    Article  Google Scholar 

  7. S. K. Chang, The design of network configuration with linear or piecewise linear cost functions, in “Proc. Symp. Computer-Communications Networks and Tele-traffic,” Polytechnic Institute of Brooklyn, New York, Vol. 22, pp. 363–369 (1972).

    Google Scholar 

  8. S. K. Chang, A model for distributed computer system design, IEEE Trans. Syst., Man Cybern. SMC-5, 344–359 (1976).

    Article  Google Scholar 

  9. W. Chou and A. Kershenbaum, A unified algorithm for designing multidrop teleprocessing networks, in “Proc. Third Data Communications Symp.,” St. Petersburg, Florida, pp. 148–156 (1973).

    Google Scholar 

  10. D. R. Doll, “The Efficient Allocation of Resources in Centralized Computer-Communication Network Design,” Ph.D. Dissertation, University of Michigan (1969).

    Google Scholar 

  11. S. E. Dreyfus, An appraisal of some shortest-path algorithm, J. ORSA, 17, 395–412 (1969).

    Google Scholar 

  12. L. R. Esau and K. C. Williams, On teleprocessing system design: part 2, a method for approximating the optimal network, IBM Syst. J., 5, No. 3 (1966).

    Google Scholar 

  13. H. Frank and W. Chou, Topological optimization of computer networks, Proc. IEEE 60, 1385–1397 (1972).

    Article  Google Scholar 

  14. H. Frank, I. T. Frisch, and W. Chou, Topological considerations in the design of the ARPA computer network, in “Proc. Spring Joint Computer Conference,” Vol. 36, pp. 543–549 (1970).

    Google Scholar 

  15. H. Frank, I. T. Frisch, W. Chou, and R. Van Slyke, Optimal design of centralized computer networks, in “Proc. Int. Conf. Communication,” pp. 21.1–21.8 (1969).

    Google Scholar 

  16. E. N. Gilbert and H. O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16, 1–29 (1968).

    Article  Google Scholar 

  17. M. C. Goldstein, Design of long-distance telecommunication networks — the Telpak problem, IEEE Trans. Circuit Theory, CT-20, 186–192 (1973).

    Google Scholar 

  18. S. L. Hakimi, Steiner’s problem in graphs and its implications, Networks 1, 113–133 (1971).

    Article  Google Scholar 

  19. E. Hansler, A Heuristic Configuration Procedure for Cost Minimal Communication Networks, IBM Research Report RZ666 (October, 1974).

    Google Scholar 

  20. B. Meister, H. Mueller, and H. Rudin, New optimization criteria for message-switching networks, IEEE Trans. Commun. Technol. Comm-19, 256–260 (1971).

    Article  Google Scholar 

  21. R. C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36, 1389–1401 (1957).

    Google Scholar 

  22. R. Rothfarb and M. C. Goldstein, The one-terminal TELPAK problem, J. ORSA, 156–169 (1971).

    Google Scholar 

  23. S. Sen, A Multi-Commodity Concave Cost Minimization Problem for Communication Networks, Report ORC 72-5, Operations Research Center, University of California, Berkeley, California (1972).

    Google Scholar 

  24. D. T. Tang, L. S. Woo, and L. R. Bahl, Optimization of TP Networks with Concentrators and Multiconnected Terminals, IBM Research Report RC5149 (November, 1974).

    Google Scholar 

  25. V. K. M. Whitney, Comparison of network topology optimization algorithms, in “Proc. ICCC-72” (1972).

    Google Scholar 

  26. L. Woo and D. T. Tang, Optimization of teleprocessing networks, in “Proc. 1973 National Telecommunications Conf.,” Atlanta, Georgia, Vol. 2, pp. 37C1–C5 (1973).

    Google Scholar 

Computer Networks, Geneva

  1. M. Abrams, R. P. Blanc, and I. W. Cotton, “Computer Networks — A Tutorial,” (Texts and References for a Tutorial Given May 23, 1974 at IEEE Symp. Computei Networks, Gaithersburg, Maryland), IEEE Computer Society Publication (1974).

    Google Scholar 

  2. N. Abramson and F. Kuo, “Computer Communication Networks,” Prentice-Hall, Inc., Englewood Cliffs, New Jersey (1973).

    Google Scholar 

  3. G. Cole, “Computer Network Measurements: Techniques and Experiments,” Ph.D. Dissertation, School of Engineering and Applied Science, Computer Science Department, University of California, Los Angeles (1971).

    Google Scholar 

  4. S.D. Crocker, J. F. Heafner, R. H. Hetcalfe, and J. B. Postei, Function-oriented protocols for the ARPA computer network, in “Proc. Spring Joint Computer Conf.,” Vol. 40, pp. 271–279 (1972).

    Google Scholar 

  5. D. W. Davies, The principles of a data communication network for computers and remote peripherals, in “Proc. 1968 IFIPS Congress, D11 (1968).

    Google Scholar 

  6. D. W. Davies and D. L. A. Barber, “Communication Networks for Computers,” John Wiley Sons Ltd., London (1973).

    Google Scholar 

  7. The emerging computer networks, EDP Analyzer, 11, No. 1 (1973).

    Google Scholar 

  8. P. H. Enslow Jr., Non-technical issues in network design — economic, legal, social and other considerations, Computer Magazine, IEEE Computer Society, August 1973, 21–30.

    Google Scholar 

  9. H. Frank and I.T. Frisch, “Communication, Transmission and Transportation Networks,” Addison-Wesley, Reading, Massachusetts (1971).

    Google Scholar 

  10. H. Frank, R. E. Kahn, and L. Kleinrock, Computer communication network design — experience with theory and practice, in “AFIPS Conf. Proc, Spring Joint Computer Conf.,” pp. 255–270 (1972).

    Google Scholar 

  11. F. E. Heart, R. Kahn, S. Ornstein, S. Crowther, and D. Waiden, The interface message processor for the ARPA computer network, in “AFIPS Conf. Proc, SJCC,” Vol. 36, pp. 551–567 (1970).

    Google Scholar 

  12. H. Helmrich, Networks for data communication and remote data processing, Trans. S. Afr. Inst. Electr. Eng. 63, No. 9 (1972).

    Google Scholar 

  13. B. W. Jordan Jr. and E. L. Baatz, C.MUP — Northwestern University’s multimini-computer network, in “Proc. IEEE Symp. Computer networks: Trends and Applications,” Gaithersburg, Maryland, pp. 51–54 (1974).

    Google Scholar 

  14. P. M. Karp, “Origin, development, and current status of the ARPA network, in “Compcon 73, Seventh Annual IEEE Computer Society International Conf.,” pp. 49–52 (1973).

    Google Scholar 

  15. L. Kleinrock, “Communication Nets: Stochastic Message Flow and Delay,” McGraw-Hill (1964).

    Google Scholar 

  16. L. Kleinrock, Analytic and simulation methods in computer networks, in “Proc. Int. Conf. Communication,” Boulder, Colorado, pp. 21.9–21.16 (1969).

    Google Scholar 

  17. L. Kleinrock, Analytic and simulation methods in computer network design, in “AFIPS Conf. Proc,” Vol. 36, pp. 569–579 (1970).

    Google Scholar 

  18. J. Martin, “Telecommunications and the Computer,” Prentice-Hall, Englewood Cliffs, New Jersey (1969).

    Google Scholar 

  19. J. Martin, “Systems Analysis for Data Transmission,” Prentice-Hall, Englewood Cliffs, New Jersey (1972).

    Google Scholar 

  20. A. A. McKenzie, B. P. Cosell, J. M. McQuillan, and M. J. Thorpe, The network control center for the ARPA network, in “First Int. Conf. Computer Communications,” pp. 185–191 (1972).

    Google Scholar 

  21. R. C. Raymond and D. J. McKee, A design model for teleprocessing systems, in “Proc. Third Data Communications Symp.,” St. Petersburg, Florida, pp. 131–140 (1973).

    Google Scholar 

  22. L. G. Roberts and B. D. Wessler, Computer network development to achieve resource sharing, in “Proc Spring Joint Computer Conf.,” pp. 543–549 (1970).

    Google Scholar 

  23. R. W. Sanders, Networking: an overview, Datamation 1974 (March), 54–55; and following articles, 56–66.

    Google Scholar 

  24. M. Schwartz, R. R. Boorstyn, and R. L. Pickholtz, Terminal-oriented computer communication networks, Proc. IEEE 60, 1408–1423 (1972).

    Article  Google Scholar 

  25. R. A. Scantlebury, P. T. Wilkinson, and K. A. Barlett, The design of a message switching center for a digital communication network, in “Proc. 1968 IPIPS Congress,” D-26 (1968).

    Google Scholar 

  26. R. H. Thomas, On the design of a resource sharing executive for the ARPANET, in “Proc. AFIPS, 1973 National Computing Conf.,” Vol. 42, pp. 155–164 (1973).

    Google Scholar 

  27. P. T. Wilkinson and R. A. Scantlebury, The control functions in a local data network, in “Proc. 1968 IFIPS Congress,” D16 (1968).

    Google Scholar 

  28. H. Zimmermann, Protocols, Formalization, Hierarchy, in “First European Workshop on Computer Networks” (1973).

    Google Scholar 

Queueing Theory and Response Times Analysis

  1. J. Cohen, “The Single Server Queue,” Wiley, New York (1969).

    Google Scholar 

  2. D. R. Cox and W. L. Smith, “Queues,” Methuen, London (1961).

    Google Scholar 

  3. L. Kleinrock, Scheduling, queueing, and delays in time-shared systems and computer networks, in “Computer-Communication Networks,” (Abramson and Kuo, eds.), pp. 95–141, Prentice-Hall, Englewood Cliffs, New Jersey (1973).

    Google Scholar 

  4. L. Kleinrock, “Queuing Systems: Theory and Applications,” Wiley Interscience, New York (1975).

    Google Scholar 

  5. Izhak Rubin, Terminal Path Delays for Communication Networks, Research Report, Department of System Science, University of California, Los Angeles, California (1974).

    Google Scholar 

  6. T. L. Saaty, “Elements of Queueing Theory,” McGraw-Hill, New York (1961).

    Google Scholar 

Reliability and Availability

  1. G. Black and F. Proschan, On optimal redundancy, Oper. Res. 7, 581–588 (1959).

    Article  Google Scholar 

  2. R. Bump, Fault isolation for data communication systems, Business Communications Review 2, 12–18 (1972).

    Google Scholar 

  3. J. DeMercado, Minimum cost reliable computer communications networks, in “Proc. AFIPS, FJCC,” Vol. 47, pp. 553–579 (1972).

    Google Scholar 

  4. W. Dent, Redundant networks and minimum distance, Franklin Inst. J. 295, 263–270 (1973).

    Article  Google Scholar 

  5. H. Frank and I. T. Frisch, Analysis and design of survivable networks, IEEE Trans. Commun. COM-18, 501–519 (1970).

    Article  Google Scholar 

  6. H. Frank and R. Van Slyke, Reliability considerations in the growth of computer communications networks, in “Proc. National Telecommunications Conf.,” pp. 22D1–22D5 (1973).

    Google Scholar 

  7. P. Ghare and R. Taylor, Optimal redundancy for reliability in series systems, Oper. Res. 17, 838–847 (1969).

    Article  Google Scholar 

  8. S. L. Hakimi, Simultaneous flows through communication networks, IRE Trans. Circuit Theory CT-9, 169–175 (1962).

    Google Scholar 

  9. E. Hansler, A fast recursive algorithm to calculate the reliability of a communication network, IEEE Trans. Commun. COM-20, 637–640 (1972).

    Article  Google Scholar 

  10. E. Hansler, G. McAuliffe, and R. Wilkov, Optimizing the reliability in centralized computer networks, IEEE Trans. Commun. COM-20, 640–645 (1972).

    Article  Google Scholar 

  11. E. Hansler, G. K. McAuliffe, and R. S. Wilkov, Exact calculation of computer network reliability, in “AFIPS Proc, FJCC,” Vol. 41, pp. 49–54 (1972).

    Google Scholar 

  12. R. Hoffman and J. Giltgen, Teleprocessing reliability, Business Communications Review 2, 22–27 (1972).

    Google Scholar 

  13. A. Kershenbaum and R. M. Van Slyke, Recursive analysis of network reliability, Networks 3, 81–94 (1973).

    Article  Google Scholar 

  14. D.J. Kleitman, Methods for investigating connectivity for large graphs, IEEE Trans. Circuit Theory CT-16, 232–233 (1969).

    Article  Google Scholar 

  15. K. Mizukami, Optimal redundancy for maximum system reliability by the method of convex and integer programming, Oper. Res., 16, 392–406 (1968).

    Article  Google Scholar 

  16. G. H. Sandler, “System Reliability Engineering,” Prentice-Hall, Englewood Cliffs, New Jersey, pp. 112–144 (1963).

    Google Scholar 

  17. D. M. Schutzer, A study of switch data security as it relates to network reliability/ survivability, in “Proc. National Electronics Conf.,” Vol. 29, pp. 213–216 (1974).

    Google Scholar 

  18. R. Van Slyke and H. Frank, Network reliability analysis: part I, Networks, 1, 279–290 (1972).

    Article  Google Scholar 

  19. K. Steiglitz, P. Weiner, and D. J. Kleitman, Design of minimum cost survivable networks, IEEE Trans. Circuit Theory CT-16, 455–460 (1969).

    Article  Google Scholar 

  20. R. Wilkov, Reliability Considerations in Computer Network Design, IBM Research Report RC 3180, IBM Watson Research Center, Yorktown Heights, New York (1970).

    Google Scholar 

  21. R. S. Wilkov, Analysis and design of reliable computer networks, IEEE Trans. Commun. COM-20, 1972, 660–678.

    Article  Google Scholar 

Routing and Flow Control

  1. H. Frank and W. Chow, Routing in computer networks, Networks 1, 99 (1972).

    Article  Google Scholar 

  2. G. Fultz and L. Kleinrock, Adaptive routing techniques for store-and-forward computer-communication networks, in “Proc. Int. Conf. Communications,” pp. 39.1–39.8 (1971).

    Google Scholar 

  3. Mario Gerla, “Adaptive Routing,” Ph.D. Dissertation, UCLA (1974).

    Google Scholar 

  4. R. E. Kahn and W. R. Crowther, Flow control in a resource-sharing computer network, IEEE Trans. Commun. COM-20, 539–546 (1972).

    Article  Google Scholar 

  5. E. P. Kaiser, On an analytical switched communication network model employing dynamic routing, in “Proc. National Electronics Conf.,” Vol. 29, pp. 209–212 (1974).

    Google Scholar 

  6. D. J. Silk, Routing doctrines and their implementation in message switching networks, Proc. Inst. Electr. Eng. 116, 1631 (1969).

    Article  Google Scholar 

  7. B. Yaged, Minimum cost routing for static network models, Networks 1, 139–172 (1972).

    Article  Google Scholar 

Database Systems, Data Models and User Interface

  1. Special Issue on “Data-Base Management Systems,” Comput. Surv. 8, No. 1 (1976).

    Google Scholar 

  2. M. M. Astrahan and D. D. Chamberlin, Implementation of a structured English query language, Comm. ACM 18 (10), 580–588 (1975).

    Article  Google Scholar 

  3. C. J. Bell, A Relational Model for Information Retrieval and the Processing of Linguistic Data, IBM Research Report RC1705, Yorktown Heights, New York (November, 1966).

    Google Scholar 

  4. D. Bjorner, E. F. Codd, I. L. Deckert, and I. L. Traiger, The Gamma Zero rc-ary Relational Data Base Interface: Specification of Objects and Operations, IBM San Jose Research Report, RJ1200 (April, 1973).

    Google Scholar 

  5. R. F. Boyce, D. D. Chamberlin, M. M. Hammer, and W. F. King, Specifying Queries as Relational Expressions: SQUARE, IBM Technical Report RJ 1291 (October, 1973).

    Google Scholar 

  6. P. Browne and D. Steinauer, A model for access control, in “Proc. ACM-SIGFIDET Workshop on Data Description, Access and Control,” San Diego, California (1971).

    Google Scholar 

  7. A. F. Cardenas, Analysis and performance of inverted data base structures, Comm. ACM 18, No. 5, 253–263 (1975).

    Article  Google Scholar 

  8. D. Chamberlin and R. Boyce, Using a Structured English Query Language as a Data Definition Facility, IBM Research Report RJ1318, San Jose, California (December, 1973).

    Google Scholar 

  9. D. D. Chamberlin and R. F. Boyce, SEQUEL: a structured English query language, in “Proc. 1974 ACM-SIGFIDET Workshop on Data Description, Access and Control,” Ann Arbor, Michigan (1974).

    Google Scholar 

  10. D. Chamberlin et al., Views, authorization and locking in a relational data base system, in “Proc. National Computer Conf.,” Anaheim, California (1975).

    Google Scholar 

  11. P. Y.-T. Chang, A Design for a Relational Data Base System, Research Report, Computer Science Department, University of Utah, Salt Lake City, Utah (1975).

    Google Scholar 

  12. S. K. Chang, M. O’brien, J. Read, R. Borovec, W. H. Cheng, and J. S. Ke, Design considerations of a database system in a clinical network environment, in “Proc. National Computer Conf.,” pp. 277–286, New York (1976).

    Google Scholar 

  13. CODASYL, “Data Base Task Group Report,” ACM Headquarters (October, 1969).

    Google Scholar 

  14. E. F. Codd, A relational model of data for large shared data banks, Commun. ACM 13, No. 6 (1970).

    Google Scholar 

  15. E. F. Codd, Further normalization of the data base relational model, in “Courant Symp. Data Base Systems,” Vol. 6, Prentice-Hall, Englewood Cliffs, New Jersey (1971).

    Google Scholar 

  16. E. F. Codd, Relations completeness of data base sublanguages, in “Courant Symp. Data Base Systems,” Vol. 6, Prentice-Hall, Englewood Cliffs, New Jersey (1971).

    Google Scholar 

  17. E. F. Codd, Normalized data base structure: a brief tutorial, in “Proc. ACM-SIGFIDET Workshop on Data Description, Access and Control,” San Diego, California (1971).

    Chapter  Google Scholar 

  18. E. F. Codd, A data base sublanguage founded on the relational calculus, in “Proc. ACM SIGFIDET Workshop on Data Description, Access and Control,” San Diego, California (1971).

    Chapter  Google Scholar 

  19. E. F. Codd, Recent investigations in rational data base systems, in “Information Processing 1974,” North Holland, Amsterdam (1974).

    Google Scholar 

  20. E. F. Codd, Seven Steps to Rendezvous with the Casual User, IBM Research, San Jose, California, RJ 1333 (January, 1974).

    Google Scholar 

  21. E. Codd and C. Date, Interactive support for nonprogrammers : the relational and network approaches, in “Proc. ACM-SIGFIDET, Workshop on Data Description, Access and Control,” Ann Arbor, Michigan (1974).

    Google Scholar 

  22. C. J. Date, “An Introduction to Data Base Systems,” Addison Wesley, Reading, Massachusetts (1975).

    Google Scholar 

  23. C. Delobel, A Theory about Data in an Information System, IBM Research Report, RJ 964 (December, 1971).

    Google Scholar 

  24. C. Delobel and R. Casey, Decomposition of a data base and the theory of boolean switching functions, IBM J. Res. Dev. 17, No. 5, 374–388 (September, 1973).

    Article  Google Scholar 

  25. G. C. Everest, The objective of data base management, in “Information Systems, COINS IV,” Plenum Press, New York (1974).

    Google Scholar 

  26. P. Fehder, HOL: a set-oriented transaction language for hierarchically structured data bases, in “Proc. ACM National Conf.,” San Diego, California (1974).

    Google Scholar 

  27. E. S. Fehr, “A Cost Study of Directory Structures for Ordered Files,” M. S. Thesis, University of Texas at Austin (1975).

    Google Scholar 

  28. J. Florentin, Consistency auditing of data bases, Comput. J. 17, No. 1 (1974).

    Google Scholar 

  29. B. Fossum, Data base integrity as provided for by a particular data base management system, in “Proc. IFIPS Conf. Data Base Management Systems,” Cargese, Corsica (1974).

    Google Scholar 

  30. T. Friedman, The authorization problem in shared files, IBM Syst. J. 9, No. 4, 258–280 (1970).

    Article  Google Scholar 

  31. D. Gotlieb et al., A classification of compression methods and their usefulness in a large data processing center, in “Proc. National Computer Conf.,” Anaheim, California (1975).

    Google Scholar 

  32. G. D. Held, M. Stonebraker, and E. Wang, INGRES — a relational data base management system, in “Proc. National Computer Conf.” (1975).

    Google Scholar 

  33. G. Held and M. Stonebraker, Storage Structures and Access Methods in the Relational Data Base Management System INGRES, Electronics Research Laboratory, University of California, Berkeley, ERL-M505 (March, 1975).

    Google Scholar 

  34. B. Henisz-Dostert and F. B. Thompson, The REL system and REL English, in A. Zampolli (ed.), “Computational and Mathematical Linguistics, Proc. Int. Conf. Computational Linguistics, Pisa, 1973,” Vol. 1, Casa Editrice Olschlki, Firenze (1974).

    Google Scholar 

  35. M. Kay, An assessment of the CODASYL DDL for use with a relational subschema, in “Proc. IFIP-TC-2 Special Working Conference, Namur, Belgium” (1975).

    Google Scholar 

  36. W. King, On the Selection of Indices for a File, IBM Research Report RJ1341, San Jose, California (January, 1974).

    Google Scholar 

  37. R. A. Lorie and A. J. Symonds, A Relational Access Method for Interactive Applications, in “Courant Symp. Data Base Systems,” Vol. 6, Prentice-Hall, Englewood Cliffs, New Jersey (1971).

    Google Scholar 

  38. R. A. Lorie, XRM — An Extended (n-ary) Relational Memory, IBM Cambridge Scientific Center, Technical Report, 320–2096 (January, 1974).

    Google Scholar 

  39. V. Y. Lum and H. Ling, An optimization problem on the selection of secondary keys, in “Proc. ACM National Conference,” pp. 349–356 (1971).

    Google Scholar 

  40. V. Y. Lum, P. S. T. Yuen, and M. Dodd, Keys-to-address transform techniques: a fundamental performance study on large existing formatted files, Commun. A.C.M. 17, 228–239 (1971).

    Google Scholar 

  41. N. McDonald and M. Stonebraker, CUPID — a friendly query language, in “Proc. ACM-PACIFIC-75,” San Francisco, California (1975).

    Google Scholar 

  42. F. K. Palermo, A data base search problem, in “Information systems, COINS IV,” Plenum Press, New York (1974).

    Google Scholar 

  43. Robert M. Pecherer, Efficient Evaluation of Expressions in a Relational Algebra, Electronics Research Laboratory, University of California, Berkeley, ERL-M510 (February, 1975).

    Google Scholar 

  44. W. J. Plath, The REQUEST System, IBM Research Report, RC-5604, Yorktown Heights, New York (August, 1975).

    Google Scholar 

  45. P. Reisner, R. F. Boyce, and D. D. Chamberlin, Human Factors Evaluation of Two Data Base Query Languages: SQUARE and SEQUEL, IBM Research Report RJ1478, San Jose, California (December, 1974).

    Google Scholar 

  46. J. Rothnie, An approach to implementing a relational data base management system, in “Proc. ACM-SIGFIDET Workshop on Data Description, Access and Control,” Ann Arbor, Michigan (1974).

    Google Scholar 

  47. M. Schkolnick, Secondary index optimization, in “Proc. ACM-SIGMOD Workshop on Management of Data,” San Jose, California (1974).

    Google Scholar 

  48. J. T. Schwartz, Abstract and concrete problems in the theory of files, in “Courant Symp. Data Base Systems,” Vol. 6, Prentice-Hall, Englewood Cliffs, New Jersey (1971).

    Google Scholar 

  49. M. E. Senko, Details of a scientific approach to information systems, in “Courant Symp. Data Base Systems,” Vol. 6, Prentice-Hall, Englewood Cliffs, New Jersey (1971).

    Google Scholar 

  50. M. E. Senko, E. B. Altman, M. M. Astrahan, and P. L. Fehder, Data structures and accessing in data base systems, IBM Syst. J. 12, 30–93 (1973).

    Article  Google Scholar 

  51. J. M. Smith and P. Y-T Chang, Optimizing the Performance of a Relational Algebra Data Base Interface, Research Report, Computer Science Department, University of Utah, Salt Lake City, Utah (1975).

    Google Scholar 

  52. K. Soop, P. Svensson, and L. Wiktorin, An experiment with a relational data base system in environmental research, in “Information Systems, COINS IV,” Plenum Press, New York (1974).

    Google Scholar 

  53. M. Stonebraker and E. Wang, INGRES — A Relational Data System, Electronics Research Laboratory, University of California, ERL-M472 (November, 1974).

    Google Scholar 

  54. M. Stonebraker and G. Held, Networks, Hierarchies and Relations in Data Base Management Systems, ERL, University of California, Berkeley, ERL-M504 (March, 1975).

    Google Scholar 

  55. F. D. Thompson, P. C. Lockemann, B. Dostert, and R. S. Deverill, REL: a rapidly extensible language system, in “Proc. 24th Conf. ACM,” pp. 399–419, New York (1969).

    Google Scholar 

  56. D. Tsichritzis, A network framework for relation implementation, in “Proc. IFIPS TC-2 Working Conf. Data Definition Language” (1975).

    Google Scholar 

  57. C. P. Wang and H. H. Wedekind, Segment synthesis in logical data base design, IBM J. Res. Dev. 1975 (Jan.), 71–77.

    Google Scholar 

  58. V. K. Whitney, A relational data management system, in “Information Systems, COINS IV,” Plenum Press, New York (1974).

    Google Scholar 

  59. M. M. Zloof, “Query by Example, Proc. National Computer Conf.” AFIPS Press, New York (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, University of Illinois at Chicago Circle, Chicago, Illinois, 60680, USA

    S. K. Chang

  2. Computer Sciences Department, IBM T. J. Watson Research Center, P. O. Box 218, 10598, Yorktown Heights, New York, USA

    C. N. Liu

Authors
  1. S. K. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. N. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Information Research, University of Florida, Gainesville, Florida, USA

    Julius T. Tou

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Plenum Press, New York

About this chapter

Cite this chapter

Chang, S.K., Liu, C.N. (1978). Modeling and Design of Distributed Information Systems. In: Tou, J.T. (eds) Advances in Information Systems Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9056-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-9056-9_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4615-9058-3

  • Online ISBN: 978-1-4615-9056-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation