Abstract
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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
