Investigation of an intelligent personalised service recommendation system in an IMS based cellular mobile network

Success or failure of future information and communication services in general and mobile communications in particular is greatly dependent on the level of personalisations they can offer. While the provision of anytime, anywhere, anyhow services has been the focus of wireless telecommunications in recent years, personalisation however has gained more and more attention as the unique selling point of mobile devices. Smart phones should be intelligent enough to match user’s unique needs and preferences to provide a truly personalised service tailored for the individual user. In the first part of this thesis, the importance and role of personalisation in future mobile networks is studied. This is followed, by an agent based futuristic user scenario that addresses the provision of rich data services independent of location. Scenario analysis identifies the requirements and challenges to be solved for the realisation of a personalised service. An architecture based on IP Multimedia Subsystem is proposed for mobility and to provide service continuity whilst roaming between two different access standards. Another aspect of personalisation, which is user preference modelling, is investigated in the context of service selection in a multi 3rd party service provider environment. A model is proposed for the automatic acquisition of user preferences to assist in service selection decision-making. User preferences are modelled based on a two-level Bayesian Metanetwork. Personal agents incorporating the proposed model provide answers to preference related queries such as cost, QoS and service provider reputation. This allows users to have their preferences considered automatically

Software Defined Applications in Cellular and Optical Networks

abstract: Small wireless cells have the potential to overcome bottlenecks in wireless access through the sharing of spectrum resources. A novel access backhaul network architecture based on a Smart Gateway (Sm-GW) between the small cell base stations, e.g., LTE eNBs, and the conventional backhaul gateways, e.g., LTE Servicing/Packet Gateways (S/P-GWs) has been introduced to address the bottleneck. The Sm-GW flexibly schedules uplink transmissions for the eNBs. Based on software defined networking (SDN) a management mechanism that allows multiple operator to flexibly inter-operate via multiple Sm-GWs with a multitude of small cells has been proposed. This dissertation also comprehensively survey the studies that examine the SDN paradigm in optical networks. Along with the PHY functional split improvements, the performance of Distributed Converged Cable Access Platform (DCCAP) in the cable architectures especially for the Remote-PHY and Remote-MACPHY nodes has been evaluated. In the PHY functional split, in addition to the re-use of infrastructure with a common FFT module for multiple technologies, a novel cross functional split interaction to cache the repetitive QAM symbols across time at the remote node to reduce the transmission rate requirement of the fronthaul link has been proposed.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

Descubrimiento dinámico de servidores basado en información de localización usando una tabla de Hash distribuida balanceada

The current Internet includes a large number of distributed services. In order to guarantee the QoS of the communications in these services, a client has to select a close-by server with enough available resources. To achieve this objective, in this Thesis, we propose a simple and practical solution for Dynamic and Location Aware Server Discovery based on a Distributed Hash Table (DHT). Specifically, we decide to use a Chord DHT system (although any other DHT scheme can be used). In more detail, the solution works as follows. The servers offering a given service S form a Chord-like DHT. In addition, they register their location (topological and/or geographical) information in the DHT. Each client using the service S is connected to at least one server from the DHT. Eventually, a given client C realizes that it is connected to a server providing a bad QoS, then, it queries the DHT in order to find an appropriate server (i.e. a close-by server with enough available resources). We define 11 design criteria, and compare our solution to the Related Work based on them. We show that our solution is the most complete one. Furthermore, we validate the performance of our solution in two different scenarios: (i) NAT Traversal Server Discovery and (ii) Home Agent Discovery in Mobile IP scenarios. The former serves to validate our solution in a highly dynamic environment whereas the latter demonstrates the appropriateness of our solution in more classical environments where the servers are typically always-on hosts. The extra overhead suffered from the servers involved in our system comes from their participation in the Chord DHT. Therefore, it is critical to fairly balance the load among all the servers. In our system as well as in other P2P systems (e.g. P2PSIP) the stored objects are small, then routing dominates the cost of publishing and retrieving objects. Therefore, in the second part of this Thesis, we address the issue of fairly balancing the routing load in Chord DHTs. We present an analytical model to evaluate the routing fairness of Chord based on the well accepted Jain’s Fairness Index (FI). Our model shows that Chord performs poorly. Following this observation, we propose a simple enhancement to the Chord finger selection algorithm with the goal of mitigating this effect. The key advantage of our proposal as compared to previous approaches is that it adds a neglible overhead to the basic Chord algorithm. We validate the goodness of the proposed solution analytically and by large scale simulations.-------------------------------------------------------------------------------------------------------------------------------------------------------------En los últimos años un gran número de servicios distribuídos han aparecido en Internet. Para garantizar la Calidad de Servicio de las comunicaciones en estos servicios sus clientes deben conectarse a un servidor cercano con suficientes recursos disponibles. Para alcanzar este objetivo, en esta Tesis, se propone una solución simple y práctica para el Descubrimiento Dinámico de Servidores basado en Información de Localizació usando una Tabla de Hash Distribuída (DHT). En concreto, hemos decidido usar una DHT de tipo Chord (aunque cualquier otro tipo de DHT puede usarse). A continuación describimos brevemente nuestra solución. Los servidores que ofrecen un servicio específico S forman una DHT tipo Chord donde registran su información de localización (topológica y/o geográfica). Cada cliente que usa el servicio S está conectado al menos a un servidor de la DHT. En caso de que un cliente C perciba que el servidor al que está conectado está ofreciendo una mala Calidad de Servicio, C consulta la DHT para encontrar un servidor más apropiado (p.ej. un servidor cercano con suficientes recursos disponibles). En la Tesis se definen 11 criterios de diseño y se compara nuestra solución con las soluciones existentes en base a ellos, demostrando que la nuestra es la solución más completa. Además, validamos el rendimiento de nuestra solución en dos escenarios diferentes: (i) Descubrimiento de Servidores para atravesar Traductores de Direcciones de Red (NATs) y (ii) Descubrimiento de Agentes Hogar (HAs) en escenarios de Movilidad IP. El primero sirve para validar el rendimiento de nuestra solución en escenarios altamente dinámicos mientras que el segundo demuestra la validez de la solución en un escenario más clásico donde los servidores son máquinas que están ininterrumpidamente funcionando. Los servidores involucrados en nuestro sistema sufren una sobrecarga debido a su participación en la DHT tipo Chord. Desafortunadamente, esta sobrecarga es inherente al sistema anteriormente descrito y no se puede eliminar. En cambio lo que sí podemos hacer es balancear la carga de la manera más justa posible entre todos los servidores. En nuestro sistema, al igual que en otros sistemas P2P (p.ej. P2PSIP) los objetos almacenados tienen un tamaño pequeño, produciendo que sea la tarea de enrutamiento la que domina el coste de publicar y obtener objetos. Por lo tanto, en la segunda parte de esta Tesis abordamos el reparto equilibrado de la carga de enrutamiento en DHTs tipo Chord. En primer lugar, definimos un modelo analítico para evaluar el reparto de la carga de enrutamiento entre los nodos que forman una DHT tipo Chord. Para ello nos basamos en una métrica aceptada por la comunidad investigadora como es el Jain’s Fairness Index (FI). El modelo resultante demuestra que Chord tiene un rendimiento pobre en el reparto justo de la carga de enrutamiento. Basándonos en esta observación proponemos una modificación simple al algoritmo de selección de punteros de Chord para mejorar el reparto de la carga de enrutamiento. La ventaja fundamental de nuestra solución en comparación con otras propuestas anteriores es que nuestra solución añade un coste despreciable al algoritmo básico de Chord. Finalmente, validamos el rendimiento de nuestra solución analíticamente y por medio de simulaciones a gran escala

Network Neutrality, Consumers, and Innovation

In this Article, Professor Christopher Yoo directly engages claims that mandating network neutrality is essential to protect consumers and to promote innovation on the Internet. It begins by analyzing the forces that are placing pressure on the basic network architecture to evolve, such as the emergence of Internet video and peer-to-peer architectures and the increasing heterogeneity in business relationships and transmission technologies. It then draws on the insights of demand-side price discrimination (such as Ramsey pricing) and the two-sided markets, as well as the economics of product differentiation and congestion, to show how deviating from network neutrality can benefit consumers, a conclusion bolstered by the empirical literature showing that vertical restraints tend to increase rather than reduce consumer welfare. In fact, limiting network providers’ ability to vary the prices charged to content and applications providers may actually force consumers to bear a greater proportion of the costs to upgrade the network. Restricting network providers’ ability to experiment with different protocols may also reduce innovation by foreclosing applications and content that depend on a different network architecture and by dampening the price signals needed to stimulate investment in new applications and content. In the process, Professor Yoo draws on the distinction between generalizing and exemplifying theory to address some of the arguments advanced by his critics. While the exemplifying theories on which these critics rely are useful for rebutting calls for broad, categorical, ex ante rules, their restrictive nature leaves them ill suited to serve as the foundation for broad, categorical ex ante mandates pointing in the other direction. Thus, in the absence of some empirical showing that the factual preconditions of any particular exemplifying theory have been satisfied, the existence of exemplifying theories pointing in both directions actually supports an ex post, case-by-case approach that allows network providers to experiment with different pricing regimes unless and until a concrete harm to competition can be shown

Network Neutrality, Consumers, and Innovation

In this Article, Professor Christopher Yoo directly engages claims that mandating network neutrality is essential to protect consumers and to promote innovation on the Internet. It begins by analyzing the forces that are placing pressure on the basic network architecture to evolve, such as the emergence of Internet video and peer-to-peer architectures and the increasing heterogeneity in business relationships and transmission technologies. It then draws on the insights of demand-side price discrimination (such as Ramsey pricing) and the two-sided markets, as well as the economics of product differentiation and congestion, to show how deviating from network neutrality can benefit consumers, a conclusion bolstered by the empirical literature showing that vertical restraints tend to increase rather than reduce consumer welfare. In fact, limiting network providers’ ability to vary the prices charged to content and applications providers may actually force consumers to bear a greater proportion of the costs to upgrade the network. Restricting network providers’ ability to experiment with different protocols may also reduce innovation by foreclosing applications and content that depend on a different network architecture and by dampening the price signals needed to stimulate investment in new applications and content. In the process, Professor Yoo draws on the distinction between generalizing and exemplifying theory to address some of the arguments advanced by his critics. While the exemplifying theories on which these critics rely are useful for rebutting calls for broad, categorical, ex ante rules, their restrictive nature leaves them ill suited to serve as the foundation for broad, categorical ex ante mandates pointing in the other direction. Thus, in the absence of some empirical showing that the factual preconditions of any particular exemplifying theory have been satisfied, the existence of exemplifying theories pointing in both directions actually supports an ex post, case-by-case approach that allows network providers to experiment with different pricing regimes unless and until a concrete harm to competition can be shown

QoE-Centric Control and Management of Multimedia Services in Software Defined and Virtualized Networks

Multimedia services consumption has increased tremendously since the deployment of 4G/LTE networks. Mobile video services (e.g., YouTube and Mobile TV) on smart devices are expected to continue to grow with the emergence and evolution of future networks such as 5G. The end user’s demand for services with better quality from service providers has triggered a trend towards Quality of Experience (QoE) - centric network management through efficient utilization of network resources. However, existing network technologies are either unable to adapt to diverse changing network conditions or limited in available resources. This has posed challenges to service providers for provisioning of QoE-centric multimedia services. New networking solutions such as Software Defined Networking (SDN) and Network Function Virtualization (NFV) can provide better solutions in terms of QoE control and management of multimedia services in emerging and future networks. The features of SDN, such as adaptability, programmability and cost-effectiveness make it suitable for bandwidth-intensive multimedia applications such as live video streaming, 3D/HD video and video gaming. However, the delivery of multimedia services over SDN/NFV networks to achieve optimized QoE, and the overall QoE-centric network resource management remain an open question especially in the advent development of future softwarized networks. The work in this thesis intends to investigate, design and develop novel approaches for QoE-centric control and management of multimedia services (with a focus on video streaming services) over software defined and virtualized networks. First, a video quality management scheme based on the traffic intensity under Dynamic Adaptive Video Streaming over HTTP (DASH) using SDN is developed. The proposed scheme can mitigate virtual port queue congestion which may cause buffering or stalling events during video streaming, thus, reducing the video quality. A QoE-driven resource allocation mechanism is designed and developed for improving the end user’s QoE for video streaming services. The aim of this approach is to find the best combination of network node functions that can provide an optimized QoE level to end-users through network node cooperation. Furthermore, a novel QoE-centric management scheme is proposed and developed, which utilizes Multipath TCP (MPTCP) and Segment Routing (SR) to enhance QoE for video streaming services over SDN/NFV-based networks. The goal of this strategy is to enable service providers to route network traffic through multiple disjointed bandwidth-satisfying paths and meet specific service QoE guarantees to the end-users. Extensive experiments demonstrated that the proposed schemes in this work improve the video quality significantly compared with the state-of-the- art approaches. The thesis further proposes the path protections and link failure-free MPTCP/SR-based architecture that increases survivability, resilience, availability and robustness of future networks. The proposed path protection and dynamic link recovery scheme achieves a minimum time to recover from a failed link and avoids link congestion in softwarized networks