On aggregate data link throughput of star network
Star network with <i>M</i>+1 data links is considered. Entering traffic from <i>M </i>links comes in to the central through node and is aggregated to outgoing link. Assume that error-free transfer probabilities are <i>F</i><sub><i>m</i></sub><i>,m=1,M </i>for input links and <i>F - </i>for output link. It is assumed that input links performance is homogeneous unit and outgoing link performance is <i>S ≥ </i>1. In addition, the central node buffer memory is <i>K≥M. </i>Then star network model is Markov queuing system with discrete time, finite buffer memory, grouped demands and batch service. Major operational performance of queuing system is data throughput: