Communication Nets: Stochastic Message Flow and DelayConsiderable research has been devoted to the formulation and solution of problems involving flow within connected networks. Independent of these surveys, an extensive body of knowledge has accumulated on the subject of queues, particularly in regard to stochastic flow through single-node servicing facilities. This text combines studies of connected networks with those of stochastic flow, providing a basis for understanding the general behavior and operation of communication networks in realistic situations. Author Leonard Kleinrock of the Computer Science Department at UCLA created the basic principle of packet switching, the technology underpinning the Internet. In this text, he develops a queuing theory model of communications nets. Its networks are channel-capacity limited; consequently, the measure of performance is taken to be the average delay encountered by a message in passing through the net. Topics include questions pertaining to optimal channel capacity assignment, effect of priority and other queue disciplines, choice of routine procedure, fixed-cost restraint, and design of topological structures. Many separate facets are brought into focus in the concluding discussion of the simulation of communication nets, and six appendices offer valuable supplementary information. |
Other editions - View all
Common terms and phrases
alternate routing procedure Appendix average arrival rate average message delay average number average path length behavior channel capacity assignment Chap circulant matrix communication net communication nets conservation law consider constraint define definition delay-dependent priority system described destination equation expected number expected value exponential distribution figure find first first-come first-served fixed routing procedure fixed-priority system fully connected function independence assumption interarrival ith channel K-connected Leonard Kleinrock Markov process message arrives message enters message lengths message spends message’s minimizes network topology node nth message number of messages number of steps obtain Poisson priority discipline priority group priority structure probability problem Proof Theorem quantities queue discipline queueing process queueing theory random routing procedures root channel capacity satisfies service facility shown in Fig simulation solution Specifically square root channel steady flow tagged unit Theorem tion total capacity total channel capacity total number traffic matrix trafiic transmission transmitted