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

State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks

We consider a reference cell of fixed capacity in a wireless cellular network while concentrating on next-generation network architectures. The cell accommodates new and handover calls from different service-classes. Arriving calls follow a random or quasi-random process and compete for service in the cell under two bandwidth sharing policies: 1) a probabilistic threshold (PrTH) policy or 2) the multiple fractional channel reservation (MFCR) policy. In the PrTH policy, if the number of in-service calls (new or handover) of a service-class exceeds a threshold (difference between new and handover calls), then an arriving call of the same service-class is accepted in the cell with a predefined state-dependent probability. In the MFCR policy, a real number of channels is reserved to benefit calls of certain service-classes; thus, a service priority is introduced. The cell is modeled as a multirate loss system. Under the PrTH policy, call-level performance measures are determined via accurate convolution algorithms, while under the MFCR policy, via approximate but efficient models. Furthermore, we discuss the applicability of the proposed models in 4G/5G networks. The accuracy of the proposed models is verified through simulation. Comparison against other models reveals the necessity of the new models and policies

Performance Evaluation in Single or Multi-Cluster C-RAN Supporting Quasi-Random Traffic

In this paper, a cloud radio access network (C-RAN) is considered where the remote radio heads (RRHs) are separated from the baseband units (BBUs). The RRHs in the C-RAN are grouped in different clusters according to their capacity while the BBUs form a centralized pool of computational resource units. Each RRH services a finite number of mobile users, i.e., the call arrival process is the quasi-random process. A new call of a single service-class requires a radio and a computational resource unit in order to be accepted in the C-RAN for a generally distributed service time. If these resource units are unavailable, then the call is blocked and lost. To analyze the multi-cluster C-RAN, we model it as a single-rate loss system, show that a product form solution exists for the steady state probabilities and propose a convolution algorithm for the accurate determination of congestion probabilities. The accuracy of this algorithm is verified via simulation. The proposed model generalizes our recent model where the RRHs in the C-RAN are grouped in a single cluster and each RRH accommodates quasi-random traffic

Bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation for wireless networks

Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications pose special channel-specific problems such as time-varying link capacities and location-dependent errors. These problems make designing efficient and effective traffic scheduling algorithms for wireless networks very challenging. Although many wireless packet scheduling algorithms have been proposed in recent years, issues such as how to improve bandwidth efficiency and maintain goodput fairness with various link qualities for power-constrained mobile hosts remain unresolved. In this paper, we devise a simple wireless packet scheduling algorithm called bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation (BGFS-EBA), which addresses these issues. Our studies reveal that BGFS-EBA effectively distributes excess bandwidth, strikes a balance between effort-fair and outcome-fair, and provides a delay bound for error-free flows and transmission effort guarantees for error-prone flows. © 2008 IEEE.published_or_final_versio

Journal of Telecommunications and Information Technology, 2018, nr 1

We consider a two-link system that accommodates Poisson arriving calls from different service-classes and propose a multirate teletraffic loss model for its analysis. Each link has two thresholds, which refer to the number of in-service calls in the link. The lowest threshold, named support threshold, defines up to which point the link can support calls offloaded from the other link. The highest threshold, named offloading threshold, defines the point where the link starts offloading calls to the other link. The adopted bandwidth sharing policy is the complete sharing policy, in which a call can be accepted in a link if there exist enough available bandwidth units. The model does not have a product form solution for the steady state probabilities. However, we propose approximate formulas, based on a convolution algorithm, for the calculation of call blocking probabilities. The accuracy of the formulas is verified through simulation and found to be quite satisfactory

On Channel Sharing Policies in LEO Mobile Satellite Systems

We consider a low earth orbit (LEO) mobile satellite system with "satellite-fixed" cells that accommodates new and handover calls of different service-classes. We provide an analytical framework for the efficient calculation of call blocking and handover failure probabilities under two channel sharing policies, namely the fixed channel reservation and the threshold call admission policies. Simulation results verify the accuracy of the proposed formulas. Furthermore, we discuss the applicability of the policies in software-defined LEO satellites

Design and implementation of event-based multi-rate controllers for networked control systems

Tesis por compendio[ES] Con esta tesis se pretende dar solución a algunos de los problemas más habituales que aparecen en los Sistemas de control basados en red (NCS) como son los retardos variables en el tiempo, las pérdidas y el desorden de paquetes, y la restricción de ancho de banda y de recursos computacionales y energéticos de los dispositivos que forman parte del sistema de control. Para ello se ha planteado la integración de técnicas de control multifrecuencial, de control basado en paquetes, de control basado en predictor y de control basado en eventos. Los diseños de control realizados se han simulado utilizando Matlab-Simulink y Truetime, se ha analizado su estabilidad mediante LMIs y QFT, y se han validado experimentalmente en un péndulo invertido, un robot cartesiano 3D y en robots móviles de bajo coste. El artículo 1 aborda el control basado en eventos, el cual minimiza el ancho de banda consumido en el NCS mediante un control basado en eventos periódicos y presenta un método para obtener sus parámetros óptimos para el sistema específico en que se utilice. Los artículos 2, 4 y 6 añaden el control basado en paquetes, así como el control multifrecuencia, que aborda problemas de falta de datos por bajo uso del sensor y los retardos, pérdidas y desórdenes de paquetes en la red. También afrontan, mediante tecnicas de predicción basadas en un filtro de Kalman multifrecuencia variable en el tiempo, los problemas de ruido y perturbaciones, así como la observación de los estados completos del sistema. El artículo 7 hace frente a un modelo no lineal que utiliza las anteriores soluciones junto con un filtro de Kalman extendido para presentar otro tipo de estructura para un vehículo autónomo que, gracias a la información futura obtenida mediante estas técnicas, puede realizar de forma remota tareas de alto nivel como es la toma de decisiones y la monitorización de variables. Los artículos 3 y 5, presentan una forma de obtener y analizar la respuesta en frecuencia de sistemas SISO multifrecuencia y estudian su comportamiento ante ciertas incertidumbres o problemas en la red haciendo uso de procedimientos QFT.[CA] Amb aquesta tesi es pretén donar solució a alguns dels problemes més habituals que apareixen als Sistemes de Control Basats en xarxa (NCS) com son els retards d'accés i transferència variables en el temps, les pèrdues y desordenament de paquets, i la restricció d'ampli de banda així com de recursos computacionals i energètics dels dispositius que foment part del sistema de control. Per tal de resoldre'ls s'ha plantejat la integració de tècniques de control multifreqüencial, de control basat en paquets, de control basat en predictor i de control basat en events. Els dissenys de control realitzats s'han simulat fent ús de Matlab-Simulink i de TrueTime, s'ha analitzat la seua estabilitat mitjançant LMIs i QFT, i s'han validat experimentalment en un pèndul invertit, un robot cartesià 3D i en robots mòbils de baix cost. L'article 1 aborda el control basat en events, el qual minimitza l'ampli de banda consumit a l'NCS mitjançant un control basat en events periòdics i presenta un mètode per a obtindré els seus paràmetres òptims per al sistema específic en el qual s'utilitza. Els articles 2, 4 i 6 afegeixen el control basat en paquets, així com el control multifreqüència, que aborda problemes de falta de dades per el baix us del sensor i els retards, pèrdues i desordre de paquets en la xarxa. També afronten, mitjançant tècniques de predicció basades en un filtre de Kalman multifreqüència variable en el temps. Els problemes de soroll i pertorbacions, així com la observació dels estats complets del sistema. L'article 7 fa referència a un model no lineal que utilitza les anteriors solucions junt a un filtre de Kalman estès per a presentar altre tipus d'estructura per a un vehicle autònom que, gracies a la informació futura obtinguda mitjançant aquestes tècniques, pot realitzar de manera remota tasques d'alt nivell com son la presa de decisions i la monitorització de variables. Els articles 3 y 5 presenten la manera d'obtindre i analitzar la resposta en frequencia de sistemes SISO multifreqüència i estudien el seu comportament front a certes incerteses o problemes en la xarxa fent us de procediments QFT.[EN] This thesis attempts to solve some of the most frequent issues that appear in Networked Control Systems (NCS), such as time-varying delays, packet losses and packet disorders and the bandwidth limitation. Other frequent problems are scarce computational and energy resources of the local system devices. Thus, it is proposed to integrate multirate control, packet-based control, predictor-based control and event-based control techniques. The control designs have been simulated using Matlab-Simulink and Truetime, the stability has been analysed by LMIs and QFT, and the experimental validation has been done on an inverted pendulum, a 3D cartesian robot and in low-cost mobile robots. Paper 1 addresses event-based control, which minimizes the bandwidth consumed in NCS through a periodic event-triggered control and presents a method to obtain the optimal parameters for the specific system used. Papers 2, 4 and 6 include packet-based control and multirate control, addressing problems such as network delays, packet dropouts and packet disorders, and the scarce data due to low sensor usage in order to save battery in sensing tasks and transmissions of the sensed data. Also addressed, is how despite the existence of measurement noise and disturbances, time-varying dual-rate Kalman filter based prediction techniques observe the complete state of the system. Paper 7 tackles a non-linear model that uses all the previous solutions together with an extended Kalman filter to present another type of structure for an autonomous vehicle that, due to future information obtained through these techniques, can remotely carry out high level tasks, such as decision making and monitoring of variables. Papers 3 and 5, present a method for obtaining and analyzing the SISO dual-rate frequency response and using QFT procedures to study its behavior when faced with specific uncertainties or network problems.This work was supported by the Spanish Ministerio de Economía y Competitividad under Grant referenced TEC2012-31506.Alcaina Acosta, JJ. (2020). Design and implementation of event-based multi-rate controllers for networked control systems [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/159884TESISCompendi

Efficient radio resource allocation in SDN/NFV based mobile cellular networks under the complete sharing policy

Novel networking paradigms, such as software-defined networking (SDN) and network function virtualisation (NFV), introduce new opportunities in the design of next-generation mobile networks. The present work investigates the benefits of the emerging SDN and NFV technologies on the radio resource management (RRM) in mobile cellular networks. In particular, the aim of the proposed RRM scheme is to enable an efficient and flexible radio resource allocation in order to assure quality of experience of mobile users. The authors consider the orthogonal frequency division multiple access scheme and the complete radio resource sharing policy. To enable time- and space-efficient resource allocation, the authors investigate the applicability of the well-known Kaufman–Roberts recursion in the context of new architectural and functional changes of SDN/NFV based mobile environments. Finally, they discuss the applicability of the proposed approach for more complicated resource sharing policies