Intelligent adaptive bandwidth provisioning for quality of service in umts core networks

Master'sMASTER OF ENGINEERIN

Profit-oriented resource allocation using online scheduling in flexible heterogeneous networks

In this paper, we discuss a generalized measurement-based adaptive scheduling framework for dynamic resource allocation in flexible heterogeneous networks, in order to ensure efficient service level performance under inherently variable traffic conditions. We formulate our generalized optimization model based on the notion of a “profit center” with an arbitrary number of service classes, nonlinear revenue and cost functions and general performance constraints. Subsequently, and under the assumption of a linear pricing model and average queue delay requirements, we develop a fast, low complexity algorithm for online dynamic resource allocation, and examine its properties. Finally, the proposed scheme is validated through an extensive simulation study.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47990/1/11235_2006_Article_6525.pd

Towards Wireless Virtualization for 5G Cellular Systems

Although it has been defined as one of the most promising key enabling technologies for the forthcoming fifth generation cellular networks, wireless virtualization still has several challenges remaining to be addressed. Amongst those, resource allocation, which decides how to embed the different wireless virtual networks on the physical relying infrastructure, is the one receiving maximum attention. This project aims at finding the optimal resource allocation for each virtual network, in terms of channel resources, power levels and radio access technologies so that the data rate requested by each virtual network can be guaranteed and the global throughput efficiency can be maximized.Aunque haya sido definida como una de las tecnologías clave para el desarrollo de la nueva generación de sistemas móviles, la virtualización del acceso radio aún tiene muchos retos a investigar. Entre ellos, la distribución de los recursos, que tiene por objetivo encontrar el mejor encaje de las distintas redes virtuales en la infraestructura física que comparten, es el que está recibiendo la mayor atención. Este proyecto, tiene por objetivo encontrar la repartición óptima de los recursos, tanto a nivel de canal como de potencia y de tecnologías de acceso radio, para que los requisitos de las redes virtuales puedan ser garantizadas y la eficiencia global sea maximizada.Malgrat ha estat definida com una de les tecnologies claus de cara al desenvolupament de la propera cinquena generació de xarxes mòbils, la virtualització de l'accés radio encara té molts reptes oberts a fer front. Entre ells, la distribució de recursos, que té per objectiu buscar el millor encaix de les diferents xarxes virtuals en la infraestructura física que comparteixen, és la que està centrant la màxima atenció. Aquest projecte té per objectiu aconseguir la repartició òptima de recursos, pel que fa al canal, als nivells de potència i a les tecnologies radio disponibles, de manera que els requisits de cada xarxa virtual puguin ser garantits i que l'eficiència global pugui ser maximitzada

Traffic Scheduling in Point-to-Multipoint OFDMA-based Systems

The new generation of wireless networks (e.g., WiMAX, LTE-Advanced, Cognitive Radio) support many high resource-consuming services (e.g., VoIP, video conference, multiplayer interactive gaming, multimedia streaming, digital video broadcasting, mobile commerce). The main problem of such networks is that the bandwidth is limited, besides to be subject to fading process, and shared among multiple users. Therefore, a combination of sophisticated transmission techniques (e.g., OFDMA) and proper packet scheduling algorithms is necessary, in order to provide applications with suitable quality of service. This Thesis addresses the problem of traffic scheduling in Point-to-Multipoint OFDMA-based systems. We formally prove that in such systems, even a simple scheduling problem of a Service Class at a time, is NP-complete, therefore, computationally intractable. An optimal solution is unfeasible in term of time, thus, fast and simple scheduling heuristics are needed. First, we address the Best Effort traffic scheduling issue, in a system adopting variable-length Frames, with the objective of producing a legal schedule (i.e., the one meeting all system constraints) of minimum length. Besides, we present fast and simple heuristics, which generate suboptimal solutions, and evaluate their performance in the average case, as in the worst one. Then, we investigate the scheduling of Real Time traffic, with the objective of meeting as many deadlines as possible, or equivalently, minimizing the packet drop ratio. Specifically, we propose two scheduling heuristics, which apply two different resource allocation mechanisms, and evaluate their average-case performance by means of a simulation experiment

Enhancing end-to-end quality of service provisioning in wireless ad hoc networks using service vectors

A cross-layer architecture that achieves significant power savings, while enhancing the end-to-end QoS provisioning and granularity in wireless ad hoc networks is proposed in this thesis. Recently, a new concept called service vector has been introduced, which enables an end host to choose different service classes along its data path. This scheme enhances the user benefits from the network services and network resource utilization, while maintaining the simplicity and scalability of the current Differentiated Services (DiffServ) network architecture. This thesis explores the application of this concept on wireless ad hoc networks and provides a cross-layer architecture based on the combination of delay-bounded wireless link level scheduling and the network layer service vector concept, which enables a wireless ad hoc network to achieve significant power savings and finer end-to-end QoS granularity. The impact of various traffic arrival distributions and flows with different QoS requirements on the performance of this cross-layer architecture is also investigated and evaluated

Algoritam alokacije resursa s dinamičkim pridruživanjem podnosioca u bežičnim mrežama zasnovanim na OFDMA-u

The allocation of available resources is one of the main issues in multi-user systems. Dependence of system capacity on radio link quality is an additional obstacle of efficient resource allocation in wireless networks. Combinations of two opposite approaches -- fair resource allocation and system capacity maximization are used to solve this problem in practice.This paper proposes a resource allocation method that is primarily based on assigning almost an equal bandwidth to all users. System capacity maximization is achieved by selecting the subcarriers with the best SNR values. This algorithm was developed for orthogonal frequency division multiple access (OFDMA) wireless systems. Resource allocation is done at the subcarrier level according to the weight factor that had been calculated for each user. Frequency hopping was used to increase frequency diversity and to make the system more robust to disturbance. Frequency hopping pattern is determined dynamically on the basis of SNR value of each subcarrier.The results of the proposed algorithm are compared with the water filling (WF) and proportional fairness (PF) methods. The influence of various data traffic classes on system throughput and resource allocation is also described.U sustavima s više korisnika jedno od glavnih pitanja je kako podijeliti raspoložive resurse. Kod radio mreža dodatni otežavajući faktor predstavlja promjenjivost kapaciteta sustava ovisno o kvaliteti radio veze. U praksi se za raspodjelu resursaobično koriste algoritmi koji su kombinacija dvaju oprečnih pristupa, fer raspodjele resursa i maksimizacije kapaciteta sustava.U ovom radu predložena je metoda primarno bazirana na fer raspodjeli resursa. Maksimizacija kapaciteta sustava ostvarena je odabirom podnosilaca s najboljim mogućim SNR-om. Algoritam je razvijen za sustave bazirane na OFDMA. Dodjela resursa korisnicima vrši se na razini pojedinog podnosioca prema izračunatom težinskom faktoru za svakog korisnika posebno. Kako bi se povećao frekvencijski diverziti i sustav učinio otpornijim na smetnje, uvedeno je frekvencijsko skakanje prema dinamički određenom predlošku. Predložak se formira na osnovu SNRvrijednosti određene po svakom podnosiocu. Rezultati predloženog algoritma uspoređeni su s WF (water filling) i PF(proportional fairness) algoritmima. Prikazan je utjecaj različitih klasa prometa na prijenosni kapacitet i raspodjelu resursa sustava

Resource management in QoS-aware wireless cellular networks

2011 Summer.Includes bibliographical references.Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study two types of resource allocation problems in QoS-aware wireless cellular networks. First, we develop a rigorous framework to study opportunistic scheduling in multiuser OFDM systems. We derive optimal opportunistic scheduling policies under three common QoS/fairness constraints for multiuser OFDM systems--temporal fairness, utilitarian fairness, and minimum-performance guarantees. To implement these optimal policies efficiently, we provide a modified Hungarian algorithm and a simple suboptimal algorithm. We then propose a generalized opportunistic scheduling framework that incorporates multiple mixed QoS/fairness constraints, including providing both lower and upper bound constraints. Next, taking input queues and channel memory into consideration, we reformulate the transmission scheduling problem as a new class of Markov decision processes (MDPs) with fairness constraints. We investigate the throughput maximization and the delay minimization problems in this context. We study two categories of fairness constraints, namely temporal fairness and utilitarian fairness. We consider two criteria: infinite horizon expected total discounted reward and expected average reward. We derive and prove explicit dynamic programming equations for the above constrained MDPs, and characterize optimal scheduling policies based on those equations. An attractive feature of our proposed schemes is that they can easily be extended to fit different objective functions and other fairness measures. Although we only focus on uplink scheduling, the scheme is equally applicable to the downlink case. Furthermore, we develop an efficient approximation method--temporal fair rollout--to reduce the computational cost

Enhancing QoS provisioning and granularity in next generation internet

Next Generation IP technology has the potential to prevail, both in the access and in the core networks, as we are moving towards a multi-service, multimedia and high-speed networking environment. Many new applications, including the multimedia applications, have been developed and deployed, and demand Quality of Service (QoS) support from the Internet, in addition to the current best effort service. Therefore, QoS provisioning techniques in the Internet to guarantee some specific QoS parameters are more a requirement than a desire. Due to the large amount of data flows and bandwidth demand, as well as the various QoS requirements, scalability and fine granularity in QoS provisioning are required. In this dissertation, the end-to-end QoS provisioning mechanisms are mainly studied, in order to provide scalable services with fine granularity to the users, so that both users and network service providers can achieve more benefits from the QoS provisioned in the network. To provide the end-to-end QoS guarantee, single-node QoS provisioning schemes have to be deployed at each router, and therefore, in this dissertation, such schemes are studied prior to the study of the end-to-end QoS provisioning mechanisms. Specifically, the effective sharing of the output bandwidth among the large amount of data flows is studied, so that fairness in the bandwidth allocation among the flows can be achieved in a scalable fashion. A dual-rate grouping architecture is proposed in this dissertation, in which the granularity in rate allocation can be enhanced, while the scalability of the one-rate grouping architecture is still maintained. It is demonstrated that the dual-rate grouping architecture approximates the ideal per-flow based PFQ architecture better than the one-rate grouping architecture, and provides better immunity capability. On the end-to-end QoS provisioning, a new Endpoint Admission Control scheme for Diffserv networks, referred to as Explicit Endpoint Admission Control (EEAC), is proposed, in which the admission control decision is made by the end hosts based on the end-to-end performance of the network. A novel concept, namely the service vector, is introduced, by which an end host can choose different services at different routers along its data path. Thus, the proposed service provisioning paradigm decouples the end-to-end QoS provisioning from the service provisioning at each router, and the end-to-end QoS granularity in the Diffserv networks can be enhanced, while the implementation complexity of the Diffserv model is maintained. Furthermore, several aspects of the implementation of the EEAC and service vector paradigm, referred to as EEAC-SV, in the Diffserv architecture are also investigated. The performance analysis and simulation results demonstrate that the proposed EEAC-SV scheme, not only increases the benefit to the service users, but also enhances the benefit to the network service provider in terms of network resource utilization. The study also indicates that the proposed EEAC-SV scheme can provide a compatible and friendly networking environment to the conventional TCP flows, and the scheme can be deployed in the current Internet in an incremental and gradual fashion

Intelligent based Packet Scheduling Scheme using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) Technology for 5G. Design and Investigation of Bandwidth Management Technique for Service-Aware Traffic Engineering using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) for 5G

Multi-Protocol Label Switching (MPLS) makes use of traffic engineering (TE) techniques and a variety of protocols to establish pre-determined highly efficient routes in Wide Area Network (WAN). Unlike IP networks in which routing decision has to be made through header analysis on a hop-by-hop basis, MPLS makes use of a short bit sequence that indicates the forwarding equivalence class (FEC) of a packet and utilises a predefined routing table to handle packets of a specific FEC type. Thus header analysis of packets is not required, resulting in lower latency. In addition, packets of similar characteristics can be routed in a consistent manner. For example, packets carrying real-time information can be routed to low latency paths across the networks. Thus the key success to MPLS is to efficiently control and distribute the bandwidth available between applications across the networks. A lot of research effort on bandwidth management in MPLS networks has already been devoted in the past. However, with the imminent roll out of 5G, MPLS is seen as a key technology for mobile backhaul. To cope with the 5G demands of rich, context aware and multimedia-based user applications, more efficient bandwidth management solutions need to be derived. This thesis focuses on the design of bandwidth management algorithms, more specifically QoS scheduling, in MPLS network for 5G mobile backhaul. The aim is to ensure the reliability and the speed of packet transfer across the network. As 5G is expected to greatly improve the user experience with innovative and high quality services, users’ perceived quality of service (QoS) needs to be taken into account when deriving such bandwidth management solutions. QoS expectation from users are often subjective and vague. Thus this thesis proposes the use of fuzzy logic based solution to provide service aware and user-centric bandwidth management in order to satisfy requirements imposed by the network and users. Unfortunately, the disadvantage of fuzzy logic is scalability since dependable fuzzy rules and membership functions increase when the complexity of being modelled increases. To resolve this issue, this thesis proposes the use of neuro-fuzzy to solicit interpretable IF-THEN rules.The algorithms are implemented and tested through NS2 and Matlab simulations. The performance of the algorithms are evaluated and compared with other conventional algorithms in terms of average throughput, delay, reliability, cost, packet loss ratio, and utilization rate. Simulation results show that the neuro-fuzzy based algorithm perform better than fuzzy and other conventional packet scheduling algorithms using IP and IP over MPLS technologies.Tertiary Education Trust Fund (TETFUND