Communications networks
- 22 Downloads
INTRODUCTION
Communications networks are systems of electronic and optical devices that support information exchange among their subscribers. Examples of communications networks are abundant in everyday life: telephone networks, broadcast and cable television networks, and computer communications networks such as the Internet. The impacts of communications networking on the individual, society and the planet are staggering, rivaling that of the tall ship and the automobile. In just under two centuries, humanity has been transformed from myriad villages and towns isolated in obscure corners of the continents to one “global information village.” This transformation is no more evident than in the fact that the very boundaries between information transfer and information processing are increasingly hard to define. The integration of communications networks, computing technology, and end-user de-vices (e.g., the telephone, television, personal computer) is increasingly being referred to...
References
- [1]Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows. Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar
- [2]Bertsekas, D. and Gallager, R. (1987). Data Networks. Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar
- [3]Boorstyn, R. R. and Frank, H. (1977). “Large Scale Network Topological Optimization,” IEEE Transactions on Communications, COM-25, 29–47.Google Scholar
- [4]Cahn, R. S. (1998). Wide Area Network Design: Concepts and Tools for Optimization. Morgan Kaufmann, San Francisco.Google Scholar
- [5]Fischer, M. J., Swinsky, G. W., Garland, D. P., and Stanfel, L. E. (1993). “A Methodology for Designing Large Private Line Transmission Networks with Multiple Facilities,” Telecommunication Systems, 1, 243–261.Google Scholar
- [6]Gavish, B. (1986). “A General Model for the Topological Design of Communications Networks,” Proceedings GLOBCOM '86, 1584–1588. Google Scholar
- [7]Kershenbaum, A. (1993). Telecommunications Network Design Algorithms. McGraw-Hill, New York.Google Scholar
- [8]Kleinrock, L. (1975). Queueing Systems, Volume I: Theory. John Wiley, New York.Google Scholar
- [9]Kleinrock, L. (1976). Queueing Systems, Volume II: Computer Applications. John Wiley, New York.Google Scholar
- [10]Mirchandani, P. B. and Francis, R. L., eds. (1990). Discrete Location Theory. John Wiley, New York.Google Scholar
- [11]Monma, C. L., and Shallcross, D. F. (1989). “Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints,” Operations Research, 37, 531–541.Google Scholar
- [12]Partridge, C. (1994). Gigabit Networking. Addison-Wesley, Reading, Massachusetts.Google Scholar
- [13]Pattavina, A. (1998). Switching Theory: Architecture and Performance in Broadband ATM Networks. John Wiley, Chichester, UK.Google Scholar
- [14]Ross, K. W. (1995). Multiservice Loss Models for Broadband Telecommunication Networks. Springer, New York.Google Scholar
- [15]Sage, K. M. and Sykes, E. A. (1994). “Evaluation of Routing-Related Performance for Large Scale Packet-Switched Networks with Distributed, Adaptive Routing Policies,” Information and Decision Technologies, 19, 545–562.Google Scholar
- [16]Schmidt, A. G., and Minoli, D. (1998). Multiprotocol over ATM: Building State of the Art ATM Intranets. Manning, Greenwich, Connecticut.Google Scholar
- [17]Schwartz, M. (1987). Telecommunication Networks, Protocols, Modeling and Analysis. Addison-Wesley, Reading, Massachusetts.Google Scholar
- [18]Stiffler, J. A. and Sykes, E. A. (1990). “An AI/OR Hybrid Expert System for Data Network Design,” Proceedings of the 1990 IEEE International Conference on Systems, Man and Cybernetics, 307–313. Google Scholar
- [19]Tanenbaum, A. S. (1988). Computer Networks. Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar
- [20]Woodward, M. E. (1994). Communication and Computer Networks: Modeling with Discrete-time Queues. IEEE Computer Society Press, Los Alamitos, California.Google Scholar