Abstract

In this paper we present an efficient approximate analysis of asymmetric LAN communication systems, consisting of N nodes with non-homogeneous finite buffer sizes, arrival rates and transmission probabilities, interconnected through C channels. Due to the finite number of buffers and channels and the system asymmetry, an exact analysis becomes prohibitively complex for large values of N. We, therefore, propose to approximate the exact system behavior by analyzing each node separately and assuming that the competition for the common communication resource is reflected only in the calculation of the successful transmission probabilities. This calculation uses the other nodes' marginal state probabilities and not any joint probabilities, thus substantially reducing the computational complexity. In spite of the reduced complexity, the presented approach produces very accurate results and can be applied to a wide range of communication systems. We demonstrate its use for analyzing systems with constant transmi...

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call