Scheduling and performance limits of networks with constantly changing topology
- Electrical Engineering Dept. and Institute for Systems Research University of Maryland College Park, Maryland20742 (United States)
A communication network with time-varying topology is considered. The network consists of M receivers and N transmitters that may access in principle every receiver. An underlying network state process with Markovian statistics is considered, that reflects the physical characteristics of the network affecting the link service capacity. The transmissions are scheduled dynamically, based on information about the link capacities and the backlog in the network. The region of achievable throughputs is characterized. A transmission scheduling policy is proposed, that utilizes current topology state information and achieves all throughput vectors achievable by any anticipative policy. The changing topology model applies to networks of Low Earth Orbit (LEO) satellites, meteor-burst communication networks and networks with mobile users. {copyright} {ital 1997 American Institute of Physics.}
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 627597
- Report Number(s):
- CONF-970115-; ISSN 0094-243X; TRN: 9808M0013
- Journal Information:
- AIP Conference Proceedings, Vol. 387, Issue 1; Conference: Space technology and applications international forum (STAIF - 97), Albuquerque, NM (United States), 26-30 Jan 1997; Other Information: PBD: Jan 1997
- Country of Publication:
- United States
- Language:
- English
Similar Records
Design and analysis of high-speed common channel computer networks
Wireless Fading Channel Models: From Classical to Stochastic Differential Equations