Some aspects of traffic control and performance evaluation of ATM networks

The emerging high-speed Asynchronous Transfer Mode (ATM) networks are expected to integrate through statistical multiplexing large numbers of traffic sources having a broad range of statistical characteristics and different Quality of Service (QOS) requirements. To achieve high utilisation of network resources while maintaining the QOS, efficient traffic management strategies have to be developed. This thesis considers the problem of traffic control for ATM networks. The thesis studies the application of neural networks to various ATM traffic control issues such as feedback congestion control, traffic characterization, bandwidth estimation, and Call Admission Control (CAC). A novel adaptive congestion control approach based on a neural network that uses reinforcement learning is developed. It is shown that the neural controller is very effective in providing general QOS control. A Finite Impulse Response (FIR) neural network is proposed to adaptively predict the traffic arrival process by learning the relationship between the past and future traffic variations. On the basis of this prediction, a feedback flow control scheme at input access nodes of the network is presented. Simulation results demonstrate significant performance improvement over conventional control mechanisms. In addition, an accurate yet computationally efficient approach to effective bandwidth estimation for multiplexed connections is investigated. In this method, a feed forward neural network is employed to model the nonlinear relationship between the effective bandwidth and the traffic situations and a QOS measure. Applications of this approach to admission control, bandwidth allocation and dynamic routing are also discussed. A detailed investigation has indicated that CAC schemes based on effective bandwidth approximation can be very conservative and prevent optimal use of network resources. A modified effective bandwidth CAC approach is therefore proposed to overcome the drawback of conventional methods. Considering statistical multiplexing between traffic sources, we directly calculate the effective bandwidth of the aggregate traffic which is modelled by a two-state Markov modulated Poisson process via matching four important statistics. We use the theory of large deviations to provide a unified description of effective bandwidths for various traffic sources and the associated ATM multiplexer queueing performance approximations, illustrating their strengths and limitations. In addition, a more accurate estimation method for ATM QOS parameters based on the Bahadur-Rao theorem is proposed, which is a refinement of the original effective bandwidth approximation and can lead to higher link utilisation

Application of learning algorithms to traffic management in integrated services networks.

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN027131 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Learning algorithms for the control of routing in integrated service communication networks

There is a high degree of uncertainty regarding the nature of traffic on future integrated service networks. This uncertainty motivates the use of adaptive resource allocation policies that can take advantage of the statistical fluctuations in the traffic demands. The adaptive control mechanisms must be 'lightweight', in terms of their overheads, and scale to potentially large networks with many traffic flows. Adaptive routing is one form of adaptive resource allocation, and this thesis considers the application of Stochastic Learning Automata (SLA) for distributed, lightweight adaptive routing in future integrated service communication networks. The thesis begins with a broad critical review of the use of Artificial Intelligence (AI) techniques applied to the control of communication networks. Detailed simulation models of integrated service networks are then constructed, and learning automata based routing is compared with traditional techniques on large scale networks. Learning automata are examined for the 'Quality-of-Service' (QoS) routing problem in realistic network topologies, where flows may be routed in the network subject to multiple QoS metrics, such as bandwidth and delay. It is found that learning automata based routing gives considerable blocking probability improvements over shortest path routing, despite only using local connectivity information and a simple probabilistic updating strategy. Furthermore, automata are considered for routing in more complex environments spanning issues such as multi-rate traffic, trunk reservation, routing over multiple domains, routing in high bandwidth-delay product networks and the use of learning automata as a background learning process. Automata are also examined for routing of both 'real-time' and 'non-real-time' traffics in an integrated traffic environment, where the non-real-time traffic has access to the bandwidth 'left over' by the real-time traffic. It is found that adopting learning automata for the routing of the real-time traffic may improve the performance to both real and non-real-time traffics under certain conditions. In addition, it is found that one set of learning automata may route both traffic types satisfactorily. Automata are considered for the routing of multicast connections in receiver-oriented, dynamic environments, where receivers may join and leave the multicast sessions dynamically. Automata are shown to be able to minimise the average delay or the total cost of the resulting trees using the appropriate feedback from the environment. Automata provide a distributed solution to the dynamic multicast problem, requiring purely local connectivity information and a simple updating strategy. Finally, automata are considered for the routing of multicast connections that require QoS guarantees, again in receiver-oriented dynamic environments. It is found that the distributed application of learning automata leads to considerably lower blocking probabilities than a shortest path tree approach, due to a combination of load balancing and minimum cost behaviour

Admission Control Optimisation for QoS and QoE Enhancement in Future Networks

Recent exponential growth in demand for traffic heterogeneity support and the number of associated devices has considerably increased demand for network resources and induced numerous challenges for the networks, such as bottleneck congestion, and inefficient admission control and resource allocation. Challenges such as these degrade network Quality of Service (QoS) and user-perceived Quality of Experience (QoE). This work studies admission control from various perspectives. For example, two novel single-objective optimisation-based admission control models, Dynamica Slice Allocation and Admission Control (DSAAC) and Signalling and Admission Control (SAC), are presented to enhance future limited-capacity network Grade of Service (GoS), and for control signalling optimisation, respectively. DSAAC is an integrated model whereby a cost-estimation function based on user demand and network capacity quantifies resource allocation among users. Moreover, to maximise resource utility, adjustable minimum and maximum slice resource bounds have also been derived. In the case of user blocking from the primary slice due to congestion or resource scarcity, a set of optimisation algorithms on inter-slice admission control and resource allocation and adaptability of slice elasticity have been proposed. A novel SAC model uses an unsupervised learning technique (i.e. Ranking-based clustering) for optimal clustering based on users’ homogeneous demand characteristics to minimise signalling redundancy in the access network. The redundant signalling reduction reduces the additional burden on the network in terms of unnecessary resource utilisation and computational time. Moreover, dynamically reconfigurable QoE-based slice performance bounds are also derived in the SAC model from multiple demand characteristics for clustered user admission to the optimal network. A set of optimisation algorithms are also proposed to attain efficient slice allocation and users’ QoE enhancement via assessing the capability of slice QoE elasticity. An enhancement of the SAC model is proposed through a novel multi-objective optimisation model named Edge Redundancy Minimisation and Admission Control (E-RMAC). A novel E-RMAC model for the first time considers the issue of redundant signalling between the edge and core networks. This model minimises redundant signalling using two classical unsupervised learning algorithms, K-mean and Ranking-based clustering, and maximises the efficiency of the link (bandwidth resources) between the edge and core networks. For multi-operator environments such as Open-RAN, a novel Forecasting and Admission Control (FAC) model for tenant-aware network selection and configuration is proposed. The model features a dynamic demand-estimation scheme embedded with fuzzy-logic-based optimisation for optimal network selection and admission control. FAC for the first time considers the coexistence of the various heterogeneous cellular technologies (2G, 3G,4G, and 5G) and their integration to enhance overall network throughput by efficient resource allocation and utilisation within a multi-operator environment. A QoS/QoE-based service monitoring feature is also presented to update the demand estimates with the support of a forecasting modifier. he provided service monitoring feature helps resource allocation to tenants, approximately closer to the actual demand of the tenants, to improve tenant-acquired QoE and overall network performance. Foremost, a novel and dynamic admission control model named Slice Congestion and Admission Control (SCAC) is also presented in this thesis. SCAC employs machine learning (i.e. unsupervised, reinforcement, and transfer learning) and multi-objective optimisation techniques (i.e. Non-dominated Sorting Genetic Algorithm II ) to minimise bottleneck and intra-slice congestion. Knowledge transfer among requests in form of coefficients has been employed for the first time for optimal slice requests queuing. A unified cost estimation function is also derived in this model for slice selection to ensure fairness among slice request admission. In view of instantaneous network circumstances and load, a reinforcement learning-based admission control policy is established for taking appropriate action on guaranteed soft and best-effort slice requests admissions. Intra-slice, as well as inter-slice resource allocation, along with the adaptability of slice elasticity, are also proposed for maximising slice acceptance ratio and resource utilisation. Extensive simulation results are obtained and compared with similar models found in the literature. The proposed E-RMAC model is 35% superior at reducing redundant signalling between the edge and core networks compared to recent work. The E-RMAC model reduces the complexity from O(U) to O(R) for service signalling and O(N) for resource signalling. This represents a significant saving in the uplink control plane signalling and link capacity compared to the results found in the existing literature. Similarly, the SCAC model reduces bottleneck congestion by approximately 56% over the entire load compared to ground truth and increases the slice acceptance ratio. Inter-slice admission and resource allocation offer admission gain of 25% and 51% over cooperative slice- and intra-slice-based admission control and resource allocation, respectively. Detailed analysis of the results obtained suggests that the proposed models can efficiently manage future heterogeneous traffic flow in terms of enhanced throughput, maximum network resources utilisation, better admission gain, and congestion control

Distributed Cognitive RAT Selection in 5G Heterogeneous Networks: A Machine Learning Approach

The leading role of the HetNet (Heterogeneous Networks) strategy as the key Radio Access Network (RAN) architecture for future 5G networks poses serious challenges to the current cell selection mechanisms used in cellular networks. The max-SINR algorithm, although effective historically for performing the most essential networking function of wireless networks, is inefficient at best and obsolete at worst in 5G HetNets. The foreseen embarrassment of riches and diversified propagation characteristics of network attachment points spanning multiple Radio Access Technologies (RAT) requires novel and creative context-aware system designs. The association and routing decisions, in the context of single-RAT or multi-RAT connections, need to be optimized to efficiently exploit the benefits of the architecture. However, the high computational complexity required for multi-parametric optimization of utility functions, the difficulty of modeling and solving Markov Decision Processes, the lack of guarantees of stability of Game Theory algorithms, and the rigidness of simpler methods like Cell Range Expansion and operator policies managed by the Access Network Discovery and Selection Function (ANDSF), makes neither of these state-of-the-art approaches a favorite. This Thesis proposes a framework that relies on Machine Learning techniques at the terminal device-level for Cognitive RAT Selection. The use of cognition allows the terminal device to learn both a multi-parametric state model and effective decision policies, based on the experience of the device itself. This implies that a terminal, after observing its environment during a learning period, may formulate a system characterization and optimize its own association decisions without any external intervention. In our proposal, this is achieved through clustering of appropriately defined feature vectors for building a system state model, supervised classification to obtain the current system state, and reinforcement learning for learning good policies. This Thesis describes the above framework in detail and recommends adaptations based on the experimentation with the X-means, k-Nearest Neighbors, and Q-learning algorithms, the building blocks of the solution. The network performance of the proposed framework is evaluated in a multi-agent environment implemented in MATLAB where it is compared with alternative RAT selection mechanisms

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Radio resource management for V2X in cellular systems

The thesis focuses on the provision of cellular vehicle-to-everything (V2X) communications, which have attracted great interest for 5G due to the potential of improving traffic safety and enabling new services related to intelligent transportation systems. These types of services have strict requirements on reliability, access availability, and end-to-end (E2E) latency. V2X requires advanced network management techniques that must be developed based on the characteristics of the networks and traffic requirements. The integration of the Sidelink (SL), which enables the direct communication between vehicles (i.e., vehicle-to-vehicle (V2V)) without passing through the base station into cellular networks is a promising solution for enhancing the performance of V2X in cellular systems. In this thesis, we addressed some of the challenges arising from the integration of V2V communication in cellular systems and validated the potential of this technology by providing appropriate resource management solutions. Our main contributions have been in the context of radio access network slicing, mode selection, and radio resource allocation mechanisms. With regard to the first research direction that focuses on the RAN slicing management, a novel strategy based on offline Q-learning and softmax decision-making has been proposed as an enhanced solution to determine the adequate split of resources between a slice for eMBB communications and a slice for V2X. Then, starting from the outcome of the off-line Q-learning algorithm, a low-complexity heuristic strategy has been proposed to achieve further improvements in the use of resources. The proposed solution has been compared against proportional and fixed reference schemes. The extensive performance assessment have revealed the ability of the proposed algorithms to improve network performance compared to the reference schemes, especially in terms of resource utilization, throughput, latency and outage probability. Regarding the second research direction that focuses on the mode selection, two different mode selection solutions referred to as MSSB and MS-RBRS strategies have been proposed for V2V communication over a cellular network. The MSSB strategy decides when it is appropriate to use one or the other mode, i.e. sidelink or cellular, for the involved vehicles, taking into account the quality of the links between V2V users, the available resources, and the network traffic load situation. Moreover, the MS-RBRS strategy not only selects the appropriate mode of operation but also decides efficiently the amount of resources needed by V2V links in each mode and allows reusing RBs between different SL users while guaranteeing the minimum signal to interference requirements. The conducted simulations have revealed that the MS-RBRS and MSSB strategies are beneficial in terms of throughput, radio resource utilization, outage probability and latency under different offered loads comparing to the reference scheme. Last, we have focused on the resource allocation problem including jointly mode selection and radio resource scheduling. For the mode selection, a novel mode selection has been presented to decide when it is appropriate to select sidelink mode and use a distributed approach for radio resource allocation or cellular mode and use a centralized radio resource allocation. It takes into account three aspects: the quality of the links between V2V users, the available resources, and the latency. As for the radio resource allocation, the proposed approach includes a distributed radio resource allocation for sidelink mode and a centralized radio resource allocation for cellular mode. The proposed strategy supports dynamic assignments by allowing transmission over mini-slots. A simulation-based analysis has shown that the proposed strategies improved the network performance in terms of latency of V2V services, packet success rate and resource utilization under different network loads.La tesis se centra en la provisión de comunicaciones para vehículos sistemas celulares (V2X: Vehicle to Everything), que han atraído un gran interés en el contexto de 5G debido a su potencial de mejorar la seguridad del tráfico y habilitar nuevos servicios relacionados con los sistemas inteligentes de transporte. Estos tipos de servicios tienen requisitos estrictos en términos fiabilidad, disponibilidad de acceso y latencia de extremo a extremo (E2E). Para ello, V2X requiere técnicas avanzadas de gestión de red que deben desarrollarse en función de las características de las redes y los requisitos de tráfico. La integración del Sidelink (SL), que permite la comunicación directa entre vehículos (es decir, vehículo a vehículo (V2V)) sin pasar por la estación base de las redes celulares, es una solución prometedora para mejorar el rendimiento de V2X en el sistema celular. En esta tesis, abordamos algunos de los desafíos derivados de la integración de la comunicación V2V en los sistemas celulares y validamos el potencial de esta tecnología al proporcionar soluciones de gestión de recursos adecuadas. Nuestras principales contribuciones han sido en el contexto del denominado "slicing" de redes de acceso radio, la selección de modo y los mecanismos de asignación de recursos radio. Respecto a la primera dirección de investigación que se centra en la gestión del RAN slicing, se ha propuesto una estrategia novedosa basada en Q-learning y toma de decisiones softmax como una solución para determinar la división adecuada de recursos entre un slice para comunicaciones eMBB y un slice para V2X. Luego, a partir del resultado del algoritmo de Q-learning, se ha propuesto una estrategia heurística de baja complejidad para lograr mejoras adicionales en el uso de los recursos. La solución propuesta se ha comparado con esquemas de referencia proporcionales y fijos. La evaluación ha revelado la capacidad de los algoritmos propuestos para mejorar el rendimiento de la red en comparación con los esquemas de referencia, especialmente en términos de utilización de recursos, rendimiento, y latencia . Con respecto a la segunda dirección de investigación que se centra en la selección de modo, se han propuesto dos soluciones de diferentes llamadas estrategias MSSB y MS-RBRS para la comunicación V2V a través de una red celular. La estrategia MSSB decide cuándo es apropiado usar el modo SL o el modo celular, para los vehículos involucrados, teniendo en cuenta la calidad de los enlaces entre los usuarios de V2V, los recursos disponibles y la situación de carga de tráfico de la red. Además, la estrategia MS-RBRS no solo selecciona el modo de operación apropiado, sino que también decide eficientemente la cantidad de recursos que los enlaces V2V necesitan en cada modo, y permite que los RB se reutilicen entre diferentes usuarios de SL al tiempo que garantiza requisitos mínimos de señal a interferencia. Se ha presentado un análisis basado en simulación para evaluar el desempeño de las estrategias propuestas. Finalmente, nos hemos centrado en el problema conjunto de la selección de modo y la asignación de recursos de radio. Para la selección de modo, se ha presentado una nueva estrategia para decidir cuándo es apropiado seleccionar el modo SL y usar un enfoque distribuido para la asignación de recursos de radio o el modo celular y usar la asignación de recursos de radio centralizada. Tiene en cuenta tres aspectos: la calidad de los enlaces entre los usuarios de V2V, los recursos disponibles y la latencia. En términos de asignación de recursos de radio, el enfoque propuesto incluye una asignación de recursos de radio distribuida para el modo SL y una asignación de recursos de radio centralizada para el modo celular. La estrategia propuesta admite asignaciones dinámicas al permitir la transmisión a través de mini-slots. Los resultados muestran las mejoras en términos de latencia, tasa de recepción y la utilización de recursos bajo diferentes cargas de red.Postprint (published version

An intelligent approach to quality of service for MPEG-4 video transmission in IEEE 802.15.1

Nowadays, wireless connectivity is becoming ubiquitous spreading to companies and in domestic areas. IEEE 802.15.1 commonly known as Bluetooth is high-quality, high-security, high-speed and low-cost radio signal technology. This wireless technology allows a maximum access range of 100 meters yet needs power as low as 1mW. Regrettably, IEEE 802.15.1 has a very limited bandwidth. This limitation can become a real problem If the user wishes to transmit a large amount of data in a very short time. The version 1.2 which is used in this project could only carry a maximum download rate of 724Kbps and an upload rate of 54Kbps In its asynchronous mode. But video needs a very large bandwidth to be transmitted with a sufficient level of quality. Video transmission over IEEE 802.15.1 networks would therefore be difficult to achieve, due to the limited bandwidth. Hence, a solution to transmit digital video with a sufficient quality of picture to arrive at the receiving end is required. A hybrid scheme has been developed in this thesis, comprises of a fuzzy logic set of rules and an artificial neural network algorithms. MPEG-4 video compression has been used in this work to optimise the transmission. This research further utilises an ‘added-buffer’ to prevent excessive data loss of MPEG-4 video over IEEE 802.15.1transmission and subsequently increase picture quality. The neural-fuzzy scheme regulates the output rate of the added-buffer to ensure that MPEG-4 video stream conforms to the traffic conditions of the IEEE 802.15.1 channel during the transmission period, that is to send more data when the bandwidth is not fully used and keep the data in the buffers if the bandwidth is overused. Computer simulation results confirm that intelligence techniques and added-buffer do improve quality of picture, reduce data loss and communication delay, as compared with conventional MPEG video transmission over IEEE 802.15.1