We develop and analyze a class of CAC algorithms for resource management in wireless networks with the goal not only to satisfy QoS constraints, but also to maximize a value or reward objective function specified by the system. We demonstrate through analytical modeling and simulation validation that the CAC algorithms developed in this research for resource management can greatly improve the system reward obtainable with QoS guarantees, when compared with existing CAC algorithms designed for QoS satisfaction only. We design hybrid partitioning-threshold, spillover and elastic CAC algorithms based on the design techniques of partitioning, setting thresholds and probabilistic call acceptance to use channel resources for servicing distinct QoS classes. For each CAC algorithm developed, we identify optimal resource management policies in terms of partitioning or threshold settings to use channel resources. By comparing these CAC algorithms head-to-head under identical conditions, we determine the best algorithm to be used at runtime to maximize system reward with QoS guarantees for servicing multiple service classes in wireless networks. We study solution correctness, solution optimality and solution efficiency of the class of CAC algorithms developed. We ensure solution optimality by comparing optimal solutions achieved with those obtained by ideal CAC algorithms via exhaustive search. We study solution efficiency properties by performing complexity analyses and ensure solution correctness by simulation validation based on real human mobility data. Further, we analyze the tradeoff between solution optimality vs. solution efficiency and suggest the best CAC algorithm used to best tradeoff solution optimality for solution efficiency, or vice versa, to satisfy the system's solution requirements. Moreover, we develop design principles that remain applicable despite rapidly evolving wireless network technologies since they can be generalized to deal with management of 'resources' (e.g., wireless channel bandwidth), 'cells' (e.g., cellular networks), "connections" (e.g., service calls with QoS constraints), and "reward optimization" (e.g., revenue optimization in optimal pricing determination) for future wireless service networks. To apply the CAC algorithms developed, we propose an application framework consisting of three stages: workload characterization, call admission control, and application deployment. We demonstrate the applicability with the optimal pricing determination application and the intelligent switch routing application. / Ph. D.

Yes / Fifth generation (5G) cellular networks will be comprised of millions of connected devices like wearable devices, Androids, iPhones, tablets and the Internet of Things (IoT) with a plethora of applications generating requests to the network. The 5G cellular networks need to cope with such sky-rocketing tra c requests from these devices to avoid network congestion. As such, cloud radio access networks (C-RAN) has been considered as a paradigm shift for 5G in which requests from mobile devices are processed in the cloud with shared baseband processing. Despite call admission control (CAC) being one of radio resource management techniques to avoid the network congestion, it has recently been overlooked by the community. The CAC technique in 5G C-RAN has a direct impact on the quality of service (QoS) for individual connections and overall system e ciency. In this paper, a novel Fuzzy-Logic based CAC scheme with pre-emption in C-RAN is proposed. In this scheme, cloud bursting technique is proposed to be used during congestion, where some delay tolerant low-priority connections are pre-empted and outsourced to a public cloud with a penalty charge. Simulation results show that the proposed scheme has low blocking probability below 5%, high throughput, low energy consumption and up to 95% of return on revenue.

Tesis por compendio / [EN] Vehicular Ad-hoc Networks (VANET) are a special type of networks where the nodes involved in the communication are vehicles. VANETs are created when several vehicles connect among themselves without the use of any infrastructure. In certain situations the absence of infrastructure is an advantage, but it also creates several challenges that should be overcome. One of the main problems related with the absence of infrastructure is the lack of a coordinator that can ensure a certain level of quality in order to enable the correct transmission of video and audio. Video transmission can be extremely useful in this type of networks as it can be used for videoconferencing of by traffic authorities to monitor the scene of an accident. In this thesis we focused on real time video transmission, providing solutions for both unicast and multicast environments. Specifically, we built a real-world testbed scenario and made a comparison with simulation results to validate the behavior of the simulation models. Using that testbed we implemented and improved DACME, an admission control module able to provide Quality of Service (QoS) to unicast video transmissions. DACME proved to be a valid solution to obtain a certain level of QoS in multi-hop environments. Concerning multicast video transmission, we developed and simulated several flooding schemes, focusing specifically on VANET environments. In this scope, the main contribution of this thesis is the Automatic Copies Distance Based (ACDB) flooding scheme. Thanks to the use of the perceived vehicular density, ACDB is a zeroconf scheme able to achieve good video quality in both urban and highway environments, being specially effective in highway environments. / [ES] Las redes vehiculares ad-hoc (VANET) son un tipo especial de redes en las que los nodos que participan de la comunicación son vehículos. Las VANETs se crean cuando diversos vehículos se conectan entre ellos sin el uso de ninguna infraestructura. En determinadas situaciones, la ausencia de infraestructura es una ventaja, pero también crea una gran cantidad de desafíos que se deben superar. Uno de los principales problemas relacionados con la ausencia de infraestructura, es la ausencia de un coordinador que pueda asegurar un determinado nivel de calidad, para poder asegurar la correcta transmisión de audio y vídeo. La transmisión de vídeo puede ser de extrema utilidad en este tipo de redes ya que puede ser empleada para videoconferencias o por las autoridades de tráfico para monitorizar el estado de un accidente. En esta tesis nos centramos en la transmisión de vídeo en tiempo real, proveyendo soluciones tanto para entornos unicast como multicast. En particular construimos un banco de pruebas real y comparamos los resultados obtenidos con resultados obtenidos en un entorno simulado para comprobar la fiabilidad de estos modelos. Usando el mismo banco de pruebas, implementamos y mejoramos DACME, un módulo de control de admisión capaz de proveer de calidad de servicio a transmisiones de vídeo unicast. DACME probó ser una solución válida para obtener ciertos niveles de calidad de servicio en entornos multisalto. En lo referente a la transmisión de vídeo multicast, desarrollamos y simulamos diversos esquemas de difusión diseñados específicamente para entornos VANET. En este campo, la principal contribución de esta tesis es el esquema de difusión "Automatic Copies Distance Based" (ACDB). Gracias al uso de la densidad vehicular percibida, ACDB es un esquema, que sin necesidad de configuración, permite alcanzar una buena calidad de vídeo tanto en entornos urbanos como en autopistas, siendo especialmente efectivo en este último entorno. / [CA] Les xarxes vehiculars ad-hoc (VANET) son un tipus de xarxes especials a les que els diferents nodes que formen part d'una comunicació son vehicles. Les VANETs es formen quan diversos vehicles es connecten sense fer ús de cap infraestructura. A certes situacions l'absència d'una infraestructura suposa un avantatge, encara que també genera una gran quantitat de desafiaments que s'han de superar. U dels principals problemes relacionats amb l'absència d'infraestructura, és la manca d'un coordinador que puga garantir una correcta transmissió tant de video com d'àudio. La transmissió de video pot ser d'extrema utilitat a aquest tipus de xarxes, ja que es por emprar tant per a videoconferències com per part de les autoritats de trànsit per monitoritzar l'estat d'un accident. A aquesta tesi ens centrem en transmissió de video en temps real, proporcionant solucions tant a entorns unicast como a entorns multicast. Particularment, vam construir un banc de proves i obtinguérem resultats que comparàrem amb resultats obtinguts mitjançant simulació. D'aquesta manera validarem la fiabilitat dels resultats simulats. Fent ús del mateix banc de proves, vàrem implementar i millorar DACME, un mòdul de control d'admissió, capaç de proveir de qualitat de servici a transmissions de video unicast. DACME va provar ser una bona solució per obtindré un bon nivell de qualitat de servici en entorns de xarxes ad-hoc amb diversos salts. Si ens centrem a la transmissió de video multicast, vàrem implementar i simular diferents esquemes de difusió, específicament dissenyats per al seu ús a entorns VANET. La principal contribució d'aquesta tesi es l'esquema de difusió ACDB (Automatic Copies Distance Based). Fent ús de la densitat vehicular, ACDB es capaç d'obtindre una bona qualitat de video tant a ciutats com a vies interurbanes, sent a especialment efectiu a aquestes últimes. A més a més no es necessària cap configuració per part de l'usuari. / Torres Cortés, Á. (2016). Efficient real-time video delivery in vehicular networks [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/62685 / Compendio

[pt] As disciplinas de Controle de Admissão constituem um recurso importante para a obtenção de Qualidade de Serviço em redes de comunicação. Nesse trabalho, é feito um estudo a respeito da aplicação do Controle de Admissão à Internet. Utilizando- se o software ns-2, é avaliado o desempenho de alguns desses mecanismos em cenários distintos e sob diversas condições de tráfego. / [en] Admission control disciplines are un important resource in the search for Quality of Service on communications networks. In this work, we studt the Admission control applications on the Internet. Using the ns-2 networks simulation software, we evaluate the performance of some of these mechanisms on distinct scenarios, and under several circunstances and traffic conditions.

Software Defined Networking (SDN) provides centralized control by separating the control plane from the data plane on network devices. Subareas of networking such as Quality of Service (QoS) can greatly benefit from this separation as QoS policies can be provided globally for the network. One way of providing QoS is to reserve and monitor network resources to guarantee a specific data rate for a requested transmission end-to-end. The presented thesis looks into possible ways of controlling the wireless medium using SDN to provide QoS. A method for providing QoS in a multihop SDN network supporting wired and wireless communication was implemented. The method was evaluated using network performance metrics such as throughput and packet jitter. The results of the experiments showed that the implemented method could limit bandwidth utilization and prioritize bandwidth usage for higher priority nodes. The performance of the network was concluded to have severe issues with dropped packets and irregular packet jitter spikes.

nÃo hà / O crescimento do nÃmero dos usuÃrios do serviÃo de Voice over IP(VoIP) faz dele o serviÃo com o maior interesse de ser provido por operadoras de telefonia celular. Por outro lado, este demanda um controle de Quality of Service (QoS) bastante rÃgido, o que torna-se mais complicado em redes sem fio, porque alÃm de congestionamentos na rede, os pacotes podem ser perdidos devido à erros nas transmissÃes no enlace de rÃdio. Dentro deste paradigma, estratÃgias de controle de congestionamento aparecem como uma boa soluÃÃo para lidar com as garantias de QoS em situaÃÃes de sobrecarga do sistema, onde os recursos se encontram exauridos e os requerimentos de qualidade se encontram ameaÃados. Este trabalho consiste na avaliaÃÃo de algoritmos de controle de congestionamento objetivando um aumento de capacidade e das garantias de QoS para serviÃos de voz. Os algoritmos avaliados neste trabalho sÃo os escalonamentos de pacotes e os controles de admissÃo. A anÃlise em cenÃrios de serviÃos mistos composto por usuÃrios VoIP e Web tambÃm està contida neste trabalho. O maior foco està no controle do atraso de pacote, jà que este à um requerimento crucial para serviÃos de tempo-real, como o VoIP. Os resultados mostram que um arcabouÃo de controle de congestionamento projetado para este serviÃo à capaz de melhorar o desempenho do sistema e mitigar os efeitos de congestionamento da rede. No cenÃrio de serviÃos mistos, os algoritmos sÃo capazes de efetuar reserva de recursos dependendo da prioridade definida para cada serviÃo, levando a um aumento na qualidade percebida pelo serviÃo mais sensÃvel atravÃs de uma leve degradaÃÃo no serviÃo mais robusto. / The growth in the number of Voice over IP(VoIP) users on the internet makes it the service with the highest interest to be provided by cellular operators. On the other hand, it demands very strict Quality of Service (QoS) control, which becomes even more complicated in wireless networks, because packets can be lost due to radio link transmission erros, as well as networks congestion. Within this paradigm, congestion control strategies appear as a good solution to cope with QoS guarantees under high loads, where the resources are exhausted and the service quality is threatened. This works comprises the evaluation of congestion control algorithms aiming to improve system capacity and QoS guarantees for speech users. The evaluated alagorithms within this work are packet scheduling and admission control. The analysys in mixed services scenarios composed of VoIP and Web users is also provid in this works. The main focus of the framework is to control the packet delay, since it is a crucial requirement for real-time services. The results show thata suitable congestion control framework is able to provid perfomace improvements and mitigation of the the effects from overloaded conditions. In the mixed services scenario, the algorithms are capable to perform resource reservation depending on the priority defined to each service, leanding to an increase in the quality of more sensitive service by degrading the more robust service

This dissertation argues that admission control should be applied as early as possible within a system. To that end, this dissertation examines the benefits and trade-offs involved in applying admission control to a networked computer system at the level of the network interface hardware. Admission control has traditionally been applied in software, after significant resources have already been expended on processing a request. This design decision leads to systems whose algorithmic cost is a function of the load applied to the system, rather than the load admitted to the system. By performing admission control at the network interface, it is possible to develop systems whose algorithmic cost is a function of load admitted to the system, rather than load applied to the system. Such systems are able to deal with excessive applied loads without exhibiting performance degradation. This dissertation first examines existing admission control approaches, focussing on the cost of admission control within those systems. It then goes on to develop a model of system behaviour under overload, and the impact of admission control on that behaviour. A new class of admission control mechanisms which are able to perform load rejection using the network interface hardware are then described, along with a prototype implementation using commodity hardware. A prototype implementation in the FreeBSD operating system is evaluated for a variety of network protocols and performance is compared to the standard FreeBSD implementation. Performance and scalability under overload is significantly improved.

<p>Revenue maximization for network operators is considered as a criterion for resource allocation in wireless cellular networks. A business model encompassing service level agreements between network operators and service providers is presented. Admission control, through price model aware admission policing and service level control, is critical for the provisioning of useful services over a general purpose wireless network. A technical solution consisting of a fast resource scheduler taking into account service requirements and wireless channel properties, a service level controller that provides the scheduler with a reasonable load, and an admission policy to uphold the service level agreements and maximize revenue, is presented.</p><p>Two different types of service level controllers are presented and implemented. One is based on a scalar PID controller, that adjusts the admitted data rates for all active clients. The other one is obtained with linear programming methods, that optimally assign data rates to clients, given their channel qualities and price models.</p><p>Two new scheduling criteria, and algorithms based on them, are presented and evaluated in a simulated wireless environment. One is based on a quadratic criterion, and is implemented through approximative algorithms, encompassing a search based algorithm and two different linearizations of the criterion. The second one is based on statistical measures of the service rates and channel states, and is implemented as an approximation of the joint probability of achieving the delay limits while utilizing the available resources efficiently.</p><p>Two scheduling algorithms, one based on each criterion, are tested in combination with each of the service level controllers, and evaluated in terms of throughput, delay, and computational complexity, using a target test system. Results show that both schedulers can, when feasible, meet explicit throughput and delay requirements, while at the same time allowing the service level controller to maximize revenue by allocating the surplus resources to less demanding services.</p>

Revenue maximization for network operators is considered as a criterion for resource allocation in wireless cellular networks. A business model encompassing service level agreements between network operators and service providers is presented. Admission control, through price model aware admission policing and service level control, is critical for the provisioning of useful services over a general purpose wireless network. A technical solution consisting of a fast resource scheduler taking into account service requirements and wireless channel properties, a service level controller that provides the scheduler with a reasonable load, and an admission policy to uphold the service level agreements and maximize revenue, is presented. Two different types of service level controllers are presented and implemented. One is based on a scalar PID controller, that adjusts the admitted data rates for all active clients. The other one is obtained with linear programming methods, that optimally assign data rates to clients, given their channel qualities and price models. Two new scheduling criteria, and algorithms based on them, are presented and evaluated in a simulated wireless environment. One is based on a quadratic criterion, and is implemented through approximative algorithms, encompassing a search based algorithm and two different linearizations of the criterion. The second one is based on statistical measures of the service rates and channel states, and is implemented as an approximation of the joint probability of achieving the delay limits while utilizing the available resources efficiently. Two scheduling algorithms, one based on each criterion, are tested in combination with each of the service level controllers, and evaluated in terms of throughput, delay, and computational complexity, using a target test system. Results show that both schedulers can, when feasible, meet explicit throughput and delay requirements, while at the same time allowing the service level controller to maximize revenue by allocating the surplus resources to less demanding services.

We design, implement and evaluate statistical methods for managing uncertainty when consuming and provisioning resources in a federated computational market. To enable efficient allocation of resources in this environment, providers need to know consumers' risk preferences, and the expected future demand. The guarantee levels to offer thus depend on techniques to forecast future usage and to accurately capture and model uncertainties. Our main contribution in this thesis is threefold; first, we evaluate a set of techniques to forecast demand in computational markets; second, we design a scalable method which captures a succinct summary of usage statistics and allows consumers to express risk preferences; and finally we propose a method for providers to set resource prices and determine guarantee levels to offer. The methods employed are based on fundamental concepts in probability theory, and are thus easy to implement, as well as to analyze and evaluate. The key component of our solution is a predictor that dynamically constructs approximations of the price probability density and quantile functions for arbitrary resources in a computational market. Because highly fluctuating and skewed demand is common in these markets, it is difficult to accurately and automatically construct representations of arbitrary demand distributions. We discovered that a technique based on the Chebyshev inequality and empirical prediction bounds, which estimates worst case bounds on deviations from the mean given a variance, provided the most reliable forecasts for a set of representative high performance and shared cluster workload traces. We further show how these forecasts can help the consumers determine how much to spend given a risk preference and how providers can offer admission control services with different guarantee levels given a recent history of resource prices. / QC 20100909