Nodal Blocking in Large Networks
CALIFORNIA UNIV LOS ANGELES SCHOOL OF ENGINEERING AND APPLIED SCIENCE
Pagination or Media Count:
A theoretical study is given for store-and-forward communication networks in which the nodes have finite storage capacity for messages. A node is blocked when its storage is filled, otherwise it is free. A two-state Markov model is proposed for each node, and the fraction of blocked nodes in the network is shown also to have a two-state Markov process representation. The time-dependent probability that any given node in the network is blocked is obtained for some uniform networks of arbitrary dimension, and various results describe the clumping phenomena in these networks. Through a modification of the basic Markovian network model, the fraction of blocked nodes in a computer- simulated store-and-forward communication network is predicted with reasonable accuracy.
- Computer Programming and Software
- Computer Hardware
- Computer Systems
- Non-Radio Communications