Queuing Analysis of Satellite Networks

This paper models satellite communications systems by means of bipartite graphs. It assumes stochastic inputs and time delay is the factor of interest. The paper formulates the model and describes the routing and digital transmission schemes, assuming the network links to be synchronized. Messages may be transmitted only in the synchronized time slots, on a first-come first-served basis. The queuing problem is discussed for the single branch and for the satellite network cases, and approximate solutions are obtained for the case of satellites with finite memories.