Data NetworksBased on an extremely popular short course conducted by the authors for several Fortune 500 companies, this volume is designed to help professionals develop a deeper understanding of data networks and evolving integrated networks, and to explore today's various analysis and design tools. KEY TOPICS: It begins with an overview of the principles behind data networks, then develops an understanding of the modeling issues and mathematical analysis needed to compare the effectiveness of different networks. An ideal reference for Communication, Network, and Research and Development Engineers. |
Contents
INTRODUCTION AND LAYERED NETWORK ARCHITECTURE | 1 |
A Simple Distributed Algorithm Problem | 32 |
4 | 92 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
allocation interval area networks ARPANET arrival rate assume assumption average delay average number backlogged Bellman-Ford algorithm broadband ISDN buffer bytes collision communication congestion Consider corresponding CSMA data networks datagram destination detect discussed error recovery example expected number exponentially distributed feedback Figure flow control frame given header idle slot independent initial input interarrival iteration Jackson's Theorem Little's Theorem local area networks Markov chain maximum module multiaccess multiplexing network layer node number of customers number of packets optimal packet length packet transmission packets arrive Poisson process priority probability problem propagation delay protocol received reservation interval retransmission round-trip delay routing algorithm Section sequence number session shortest path slotted Aloha spanning tree splitting stationary distribution statistical multiplexing steady-state sublayer subset switching throughput token topology transmitted transport layer update virtual channel virtual circuit waiting window