Static and dynamic resource allocation in a multiservice satellite network with fading

A control architecture for resource allocation in satellite networks is proposed, along with the specification of performance indexes and control strategies. The latter, besides being based on information on traffic statistics and network status, rely upon some knowledge of the fading conditions over the satellite network channels. The resource allocation problem consists of the assignment, by a master station, of a total available bandwidth among traffic earth stations in the presence of different traffic types. Traffic stations are assumed to measure continuously their signal fade level, but this information may either be used only locally or also communicated to the master station. According to the information made available on-line to the master station on the level of the fading attenuation of the traffic stations, the assignment can be made static, based on the a priori knowledge of long-term fading statistics, or dynamic, based on the updated measurements. In any case, the decisions can be adapted to slowly time-varying traffic characteristics. At each earth station, two basic traffic types are assumed to be present, namely guaranteed bandwidth, real time, synchronous data (stream traffic) and best-effort traffic (datagram traffic). Numerical results are provided for a specific architecture in the dynamic case, in a real environment, based on the Italsat satellite national coverage payload characteristics. Copyright © 2003 John Wiley & Sons, Ltd.

[1]  F. Carassa,et al.  Adaptative methods to counteract rain attenuation effects in the 20/30 GHz band , 1984 .

[2]  Vincent W. S. Chan,et al.  Predicting and adapting satellite channels with weather-induced impairments , 2002 .

[3]  Malur K. Sundareshan,et al.  Optimal channel allocation policies for access control of circuit-switched traffic in ISDN environments , 1993, IEEE Trans. Commun..

[4]  Nicolas D. Georganas,et al.  Self-Similar Traffic and Upper Bounds to Buffer-Overflow Probability in an ATM Queue , 1998, Perform. Evaluation.

[5]  Anthony Ephremides,et al.  Fixed- and movable-boundary channel-access schemes for integrated voice/data wireless networks , 1995, IEEE Trans. Commun..

[6]  Franco Davoli,et al.  A two-level stochastic approximation for admission control and bandwidth allocation , 2000, IEEE Journal on Selected Areas in Communications.

[7]  Nedo Celandroni,et al.  FODA/IBEA‐TDMA: A flexible fade countermeasure system for integrated services in user‐oriented networks , 1992 .

[8]  Nicolas D. Georganas,et al.  On self-similar traffic in ATM queues: definitions, overflow probability bound, and cell delay distribution , 1997, TNET.

[9]  Mischa Schwartz,et al.  A decomposition approximation for the analysis of voice/data integration , 1994, IEEE Trans. Commun..

[10]  F. Carducci,et al.  The ITALSAT satellite system , 1995 .

[11]  Jean C. Walrand,et al.  High-performance communication networks , 1999 .

[12]  Keith W. Ross,et al.  Optimal circuit access policies in an ISDN environment: a Markov decision approach , 1989, IEEE Trans. Commun..

[13]  Pravin Varaiya,et al.  High-performance communication networks (2nd ed.) , 1999 .

[14]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[15]  Ccir Propagation Data and Prediction Methods Required for Earth-Space Telecommunication Systems , 1990 .

[16]  Nedo Celandroni,et al.  Bandwidth allocation in a multiservice satellite network based on long-term weather forecast scenarios , 2002, Comput. Commun..

[17]  Franco Davoli,et al.  Control of multirate synchronous streams in hybrid TDM access networks , 1997, TNET.

[18]  Nedo Celandroni,et al.  EXPERIMENTAL RESULTS OF A DEMAND‐ASSIGNMENT THIN ROUTE TDMA SYSTEM , 1996 .

[19]  Ness B. Shroff,et al.  Loss probability calculations and asymptotic analysis for finite buffer multiplexers , 2001, TNET.

[20]  Christos G. Cassandras,et al.  Adaptive call admission control in circuit-switched networks , 2002, IEEE Trans. Autom. Control..

[21]  C. Cassandras,et al.  Online Surrogate Problem Methodology for Stochastic Discrete Resource Allocation Problems , 2001 .