Nodal Blocking in Large Networks

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1971
Accession Number
AD0741647

Entities

People

  • Jack F. Ziegler

Organizations

  • University of California, Los Angeles

Tags

Communities of Interest

  • Advanced Electronics
  • Cyber
  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Accuracy
  • Air Force
  • Computational Science
  • Computer Networks
  • Computer Science
  • Computers
  • Differential Equations
  • Eigenvalues
  • Markov Chains
  • Markov Models
  • Markov Processes
  • Mathematical Models
  • Models
  • Operations Research
  • Probabilistic Models
  • Probability
  • Probability Distributions

Fields of Study

  • Computer science

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Mathematical Modeling and Probability Theory.
  • Radio communications and signal processing.