Computer Science – Information Theory
Scientific paper
Jan 1997
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1997aipc..387..951t&link_type=abstract
Space technology and applications international forum (STAIF - 97). AIP Conference Proceedings, Volume 387, pp. 951-956 (1997).
Computer Science
Information Theory
Telecommunications: Signal Transmission And Processing, Communication Satellites, Information Theory And Communication Theory, Bolometers, Infrared, Submillimeter Wave, Microwave, And Radiowave Receivers And Detectors
Scientific paper
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.
No associations
LandOfFree
Scheduling and performance limits of networks with constantly changing topology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Scheduling and performance limits of networks with constantly changing topology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling and performance limits of networks with constantly changing topology will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1784615