Satellite-based internet: A tutorial

In a satellite-based Internet system, satellites are used to interconnect heterogeneous network segments and to provide ubiquitous direct Internet access to homes and businesses. This article presents satellite-based Internet architectures and discusses multiple access control, routing, satellite transport, and integrating satellite networks into the global Internet.published_or_final_versio

Satellite-based internet: A tutorial

In a satellite-based Internet system, satellites are used to interconnect heterogeneous network segments and to provide ubiquitous direct Internet access to homes and businesses. This article presents satellite-based Internet architectures and discusses multiple access control, routing, satellite transport, and integrating satellite networks into the global Internet.published_or_final_versio

An analytical framework in LEO mobile satellite systems servicing batched Poisson traffic

The authors consider a low earth orbit (LEO) mobile satellite system (MSS) that accepts new and handover calls of multirate service-classes. New calls arrive in the system as batches, following the batched Poisson process. A batch has a generally distributed number of calls. Each call is treated separately from the others and its acceptance is decided according to the availability of the requested number of channels. Handover calls follow also a batched Poisson process. All calls compete for the available channels under the complete sharing policy. By considering the LEO-MSS as a multirate loss system with ‘satellite-fixed’ cells, it can be analysed via a multi-dimensional Markov chain, which yields to a product form solution (PFS) for the steady-state distribution. Based on the PFS, they propose a recursive and yet efficient formula for the determination of the channel occupancy distribution, and consequently, for the calculation of various performance measures including call blocking and handover failure probabilities. The latter are much higher compared to the corresponding probabilities in the case of the classical (and less bursty) Poisson process. Simulation results verify the accuracy of the proposed formulas. Furthermore, they discuss the applicability of the proposed model in software-defined LEO-MSS

QoS Provisioning for Multi-Class Traffic in Wireless Networks

Physical constraints, bandwidth constraints and host mobility all contribute to the difficulty of providing Quality of Service (QoS) guarantees in wireless networks. There is a growing demand for wireless networks to support all the services that are available on wired networks. These diverse services, such as email, instant messaging, web browsing, video conferencing, telephony and paging all place different demands on the network, making QoS provisioning for wireless networks that carry multiple classes of traffic a complex problem. We have developed a set of admission control and resource reservation schemes for QoS provisioning in multi-class wireless networks. We present three variations of a novel resource borrowing scheme for cellular networks that exploits the ability of some multimedia applications to adapt to transient fluctuations in the supplied resources. The first of the schemes is shown to be proportionally fair: the second scheme is max-min fair. The third scheme for cellular networks uses knowledge about the relationship between streams that together comprise a multimedia session in order to further improve performance. We also present a predictive resource reservation scheme for LEO satellite networks that exploits the regularity of the movement patterns of mobile hosts in LEO satellite networks. We have developed the cellular network simulator (CNS) for evaluating call-level QoS provisioning schemes. QoS at the call-level is concerned with call blocking probability (CBP), call dropping probability (CDP), and supplied bandwidth. We introduce two novel QoS parameters that relate to supplied bandwidth—the average percent of desired bandwidth supplied (DBS), and the percent of time spent operating at the desired bandwidth level (DBT)

A probabilistic threshold-based bandwidth sharing policy for wireless multirate loss networks

We propose a probabilistic bandwidth sharing policy, based on the threshold (TH) policy, for a single cell of fixed capacity in a homogeneous wireless cellular network. The cell accommodates random input-traffic originated from K service-classes. We distinguish call requests to new and handover, and therefore, the cell supports 2K types of arrivals. If the number of in-service calls (new or handover) of a service-class exceeds a threshold (different for new and handover calls of a service-class), a new or handover arriving call of the same service-class is not always blocked, as it happens in the TH policy, but it is accepted in the system with a predefined state-dependent probability. The cell is analyzed as a multirate loss system, via a reversible continuous-time Markov chain, which leads to a product form solution (PFS) for the steady state distribution. Thanks to the PFS, the calculation of performance measures is accurate, but complex. To reduce the computational complexity, we determine performance measures via a convolution algorithm

Call blocking probabilities for Poisson traffic under the Multiple Fractional Channel Reservation policy

In this paper, we study the performance of the Multiple Fractional Channel Reservation (MFCR) policy, which is a bandwidth reservation policy that allows the reservation of real (not integer) number of channels in order to favor calls of high channel (bandwidth) requirements. We consider a link of fixed capacity that accommodates Poisson arriving calls of different service-classes with different bandwidth-per-call requirements. Calls compete for the available bandwidth under the MFCR policy. To determine call blocking probabilities, we propose approximate but recursive formulas based on the notion of reserve transition rates. The accuracy of the proposed method is verified through simulation

A random access MAC protocol for MPR satellite networks

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e TecnologiaRandom access approaches for Low Earth Orbit (LEO) satellite networks are usually incompatible with the Quality of Service (QoS) requirements of multimedia tra c, especially when hand-held devices must operate with very low power. Cross-Layered optimization architectures, combined with Multipacket Reception (MPR)schemes are a good choice to enhance the overall performance of a wireless system. Hybrid Network-assisted Diversity Multiple Access (H-NDMA) protocol, exhibits high energy e ciency, with MPR capability, but its use with satellites is limited by the high round trip time. This protocol was adapted to satellites, in Satellite-NDMA, but it required a pre-reservation mechanism that introduces a signi cant delay. This dissertation proposes a random access protocol that uses H-NDMA, for Low Earth Orbit (LEO) satellite networks, named Satellite Random-NDMA (SR-NDMA). The protocol addresses the problem inherent to satellite networks (large round trip time and signi cant energy consumption) de ning a hybrid approach with an initial random access plus possible additional scheduled retransmissions. An MPR receiver combines the multiple copies received, gradually reducing the error rate. Analytical performance models are proposed for the throughput, delay, jitter and energy e ciency considering nite queues at the terminals. It is also addressed the energy e ciency optimization, where the system parameters are calculated to guarantee the QoS requirements. The proposed system's performance is evaluated for a Single-Carrier with Frequency Domain Equalization (SC-FDE) receiver. Results show that the proposed system is energy e cient and can provide enough QoS to support services such as video telephony