Distributed radio resource management in LTE-advanced networks with type 1 relay

Long Term Evolution (LTE)-Advanced is proposed as a candidate of the 4th generation (4G) mobile telecommunication systems. As an evolved version of LTE, LTE- Advanced is also based on Orthogonal Frequency Division Multiplexing (OFDM) and in addition, it adopts some emerging technologies, such as relaying. Type I relay nodes, de_ned in LTE-Advanced standards, can control their cells with their own reference signals and have Radio Resource Management (RRM) functionalities. The rationale of RRM is to decide which resources are allocated to which users for optimising performance metrics, such as throughput, fairness, power consumption and Quality of Service (QoS). The RRM techniques in LTE-Advanced networks, including route selection, resource partitioning and resource scheduling, are facing new challenges brought by Type 1 relay nodes and increasingly becoming research focuses in recent years. The research work presented in this thesis has made the following contributions. A service-aware adaptive bidirectional optimisation route selection strategy is proposed to consider both uplink optimisation and downlink optimisation according to service type. The load between di_erent serving nodes, including eNBs and relay nodes, are rebalanced under the _xed resource partitioning. The simulation results show that larger uplink throughputs and bidirectional throughputs can be achieved, compared with existing route selection strategies. A distributed two-hop proportional fair resource allocation scheme is proposed in order to provide better two-hop end-to-end proportional fairness for all the User Equipments (UEs), especially for the relay UEs. The resource partitioning is based on the cases of none Frequency Reuse (FR) pattern, full FR pattern and partial FR patterns. The resource scheduling in access links and backhaul links are considered jointly. A proportional fair joint route selection and resource partitioning algorithm isproposed to obtain an improved solution to the two-hop Adaptive Partial Frequency Reusing (APFR) problem with one relay node per cell. In addition, two special situations of APFR, full FR and no FR, are utilised to narrow the iterative search range of the proposed algorithm and reduce its complexity

A Survey on the Contributions of Software-Defined Networking to Traffic Engineering

Since the appearance of OpenFlow back in 2008, software-defined networking (SDN) has gained momentum. Although there are some discrepancies between the standards developing organizations working with SDN about what SDN is and how it is defined, they all outline traffic engineering (TE) as a key application. One of the most common objectives of TE is the congestion minimization, where techniques such as traffic splitting among multiple paths or advanced reservation systems are used. In such a scenario, this manuscript surveys the role of a comprehensive list of SDN protocols in TE solutions, in order to assess how these protocols can benefit TE. The SDN protocols have been categorized using the SDN architecture proposed by the open networking foundation, which differentiates among data-controller plane interfaces, application-controller plane interfaces, and management interfaces, in order to state how the interface type in which they operate influences TE. In addition, the impact of the SDN protocols on TE has been evaluated by comparing them with the path computation element (PCE)-based architecture. The PCE-based architecture has been selected to measure the impact of SDN on TE because it is the most novel TE architecture until the date, and because it already defines a set of metrics to measure the performance of TE solutions. We conclude that using the three types of interfaces simultaneously will result in more powerful and enhanced TE solutions, since they benefit TE in complementary ways.European Commission through the Horizon 2020 Research and Innovation Programme (GN4) under Grant 691567 Spanish Ministry of Economy and Competitiveness under the Secure Deployment of Services Over SDN and NFV-based Networks Project S&NSEC under Grant TEC2013-47960-C4-3-

CERN openlab Whitepaper on Future IT Challenges in Scientific Research

This whitepaper describes the major IT challenges in scientific research at CERN and several other European and international research laboratories and projects. Each challenge is exemplified through a set of concrete use cases drawn from the requirements of large-scale scientific programs. The paper is based on contributions from many researchers and IT experts of the participating laboratories and also input from the existing CERN openlab industrial sponsors. The views expressed in this document are those of the individual contributors and do not necessarily reflect the view of their organisations and/or affiliates

Auto-bandwidth control in dynamically reconfigured hybrid-SDN MPLS networks

The proposition of this work is based on the steady evolution of bandwidth demanding technology, which currently and more so in future, requires operators to use expensive infrastructure capability smartly to maximise its use in a very competitive environment. In this thesis, a traffic engineering control loop is proposed that dynamically adjusts the bandwidth and route of flows of Multi-Protocol Label Switching (MPLS) tunnels in response to changes in traffic demand. Available bandwidth is shifted to where the demand is, and where the demand requirement has dropped, unused allocated bandwidth is returned to the network. An MPLS network enhanced with Software-defined Networking (SDN) features is implemented. The technology known as hybrid SDN combines the programmability features of SDN with the robust MPLS label switched path features along with traffic engineering enhancements introduced by routing protocols such as Border Gateway Patrol-Traffic Engineering (BGP-TE) and Open Shortest Path First-Traffic Engineering (OSPF-TE). The implemented mixed-integer linear programming formulation using the minimisation of maximum link utilisation and minimum link cost objective functions, combined with the programmability of the hybrid SDN network allows for source to destination demand fluctuations. A key driver to this research is the programmability of the MPLS network, enhanced by the contributions that the SDN controller technology introduced. The centralised view of the network provides the network state information needed to drive the mathematical modelling of the network. The path computation element further enables control of the label switched path's bandwidths, which is adjusted based on current demand and optimisation method used. The hose model is used to specify a range of traffic conditions. The most important benefit of the hose model is the flexibility that is allowed in how the traffic matrix can change if the aggregate traffic demand does not exceed the hose maximum bandwidth specification. To this end, reserved hose bandwidth can now be released to the core network to service demands from other sites

Performance evaluation of synergic operation of algorithms enabling opportunistic networks - D4.3

Deliverable D4.3 del projecte OneFITPreprin

Design issues in quality of service routing

The range of applications and services which can be successfully deployed in packet-switched networks such as the Internet is limited when the network does nor provide Quality of Service (QoS). This is the typical situation in today's Internet. A key aspect in providing QoS support is the requirement for an optimised and intelligent mapping of customer traffic flows onto a physical network topology. The problem of selecting such paths is the task of QoS routing QoS routing algorithms are intrinsically complex and need careful study before being implemented in real networks. Our aim is to address some of the challenges present m the deployment of QoS routing methods. This thesis considers a number of practical limitations of existing QoS routing algorithms and presents solutions to the problems identified. Many QoS routing algorithms are inherently unstable and induce traffic fluctuations in the network. We describe two new routing algorithms which address this problem The first method - ALCFRA (Adaptive Link Cost Function Routing Algorithm) - can be used in networks with sparse connectivity, while the second algorithm - CAR (Connectivity Aware Routing) - is designed to work well in other network topologies. We also describe how to ensure co-operative interaction of the routing algorithms in multiple domains when hierarchial routing is used and also present a solution to the problems of how to provide QoS support m a network where not all nodes are QoS-aware. Our solutions are supported by extensive simulations over a wide range of network topologies and their performance is compared to existing algorithms. It is shown that our solutions advance the state of the art in QoS routing and facilitate the deployment of QoS support in tomorrow's Internet