Communication Nets: Stochastic Message Flow and Delay |
Contents
introduction | 1 |
summary of results | 19 |
the problems of an exact | 35 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
alternate routing procedure Appendix average message delay average number average path length birth and death C₁ channel capacity assignment Chap circulant matrix communication net communication nets conservation law consider constraint define delay-dependent priority system described destination equation establishes Eq expected number expected value exponential distribution first-come first-served fixed routing procedure fixed-priority system flow fully connected function independence assumption interarrival ith channel K-connected Markov process message enters message lengths message spends minimizes n-tuples n₁ n₂ network topology node number of messages number of steps obtain P₁ Poisson preemption priority discipline priority group probability problem Proof Theorem queue discipline queueing process queueing theory random routing procedures service facility simulation solution square root T₁ tagged unit tion topology total capacity total number traffic matrix transmission transmitted type i units V₁ waiting line λι