Modeling the relationship between network operators and venue owners in public Wi-Fi deployment using non-cooperative game theory

Wireless data demands keep rising at a fast rate. In 2016, Cisco measured a global mobile data traffic volume of 7.2 Exabytes per month and projected a growth to 49 Exabytes per month in 2021. Wi-Fi plays an important role in this as well. Up to 60% of the total mobile traffic was off-loaded via Wi-Fi (and femtocells) in 2016. This is further expected to increase to 63% in 2021. In this publication, we look into the roll-out of public Wi-Fi networks, public meaning in a public or semi-public place (pubs, restaurants, sport stadiums, etc.). More concretely we look into the collaboration between two parties, a technical party and a venue owner, for the roll-out of a new Wi-Fi network. The technical party is interested in reducing load on its mobile network and generating additional direct revenues, while the venue owner wants to improve the attractiveness of the venue and consequentially generate additional indirect revenues. Three Wi-Fi pricing models are considered: entirely free, slow access with ads or fast access via paid access (freemium), and paid access only (premium). The technical party prefers a premium model with high direct revenues, the venue owner a free/freemium model which is attractive to its customers, meaning both parties have conflicting interests. This conflict has been modeled using non-cooperative game theory incorporating detailed cost and revenue models for all three Wi-Fi pricing models. The initial outcome of the game is a premium Wi-Fi network, which is not the optimal solution from an outsider's perspective as a freemium network yields highest total payoffs. By introducing an additional compensation scheme which corresponds with negotiation in real life, the outcome of the game is steered toward a freemium solution

Conception de réseaux optiques multi-bandes : Analyse polyédrale et algorithmes

In this thesis we consider two capacitated network design (CND) problems, using OFDM multi-band technology. The first problem is related to single-layer network design with specific requirements. We give an ILP formulation for this problem and study the polyhedra associated with its arc-set restriction. We describe two families of facet defining inequalities. We devise a Branch-and-Cut algorithm for the problem. Next, we investigate the multilayer version of CND using OFDM technology. We propose several ILP formulations and study the polyhedron associated with the first (cut) formulation. We identify several classes of facets and discuss the related separation problem. We devise a Branch-and-Cut algorithm embedding valid inequalities of both single-layer and multilayer problems. The second formulation is compact, and holds a polynomial number of constraints and variables. Two further path formulations are given which yield two efficient Branch-and-Price algorithms for the problem.Dans cette thèse, on s'intéresse à deux problèmes de conception de réseaux, utilisant la technologie OFDM multi-bandes. Le premier problème concerne la conception d'un réseau mono-couche avec contraintes spécifiques. Nous donnons une formulation en PLNE pour ce problème et étudions le polyèdre associé à sa restriction sur un arc. Nous introduisons deux familles d'inégalités valides définissant des facettes et développons un algorithme de coupes et branchements pour le problème. Nous étudions la variante multicouche du problème précédent et proposons plusieurs PLNE pour le modéliser. Nous identifions plusieurs familles de facettes et discutons des problèmes de séparation associés. Nous développons un algorithme de coupes et branchements utilisant l'ensemble des contraintes identifiées. Enfin, une formulation compacte et deux formulations basées sur des chemins sont proposées pour le problème. Nous présentons deux algorithmes de génération de colonnes et branchements pour le problème

Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem

In this paper, we consider the Delay Constrained Unsplittable Shortest Path Routing problem which arises in the field of traffic engineering for IP networks. This problem consists, given a directed graph and a set of commodities, to compute a set of routing paths and the associated administrative weights such that each commodity is routed along the unique shortest path between its origin and its destination, according to these weights. We present a compact MILP formulation for the problem, extending the work in [5] along with some valid inequalities to strengthen its linear relaxation. This formulation is used as the bulding block of an iterative approach that we develop to tackle large scale instances. We further propose a dynamic programming algorithm based on a tree decomposition of the graph. To the best of our knowledge, this is the first exact combinatorial algorithm for the problem. Finally, we assess the efficiency of our approaches through a set of experiments on state-of-the-art instances

Design of optical WDM networks

In this paper we consider the traffic Grooming, Routing and Wavelength Assignment problem in optical WDM mesh networks. This is a network design problem which consists in grooming the demands in lightpaths, assigning a wavelength to each lightpath and routing the traffic on these with minimum cost. We first give an Integer Linear Programming formulation for the problem. Then we discuss some pre-processing procedure and propose a fast heuristic which shows to be very efficient for solving large real instances of. We finally provide an illustrative application of the proposed heuristic for a real backhaul network instance.ou

Routing and Resource Assignment Problems in Future 5G Radio Access Networks

International audienceGiven a mobile network composed of a set of devices, a set of antennas (Base Stations) and a discrete set of radio resources, we define a domain as a subset of devices/antennas that communicate via radio transmission links in order to exchange data for a specific service. In this context, we are interested in the Domain Creation (DC) problem. It consists in finding an allocation of radio resources to the transmission links of the network so that different domains, each one related to a specific service (gaming, video streaming, content sharing, etc.), can be implemented simultaneously. Every domain has specific requirements in terms of quality of the transmission links (SINR) and hardware resources dedicated to carrying out the corresponding service. We give an integer linear programming formulation for the problem and propose two classes of valid inequalities to strengthen its linear relaxation. The resulting formulation is used within a branch-and-cut algorithm for the problem. We further propose an efficient heuristic obtained from solving the routing and resource assignment sub-problems separately. We assess the efficiency of our approaches through some experiments on instances of varying size and realistic input data from Orange mobile network

A Math-Heuristic for Network Slice Design

International audienceIn this paper, we address the Network Slice Design problem, which arises from blueprinting end-to-end communication networks using fifth-generation (5G) radio access technology. With regard to new sharing policies and radio-access integration, it shows peculiar requirements with respect to conventional function placement and routing problems. To address the underlying optimization problem, we propose an open-access framework based on a math-heuristic that encompasses control-plane and data-plane separation and novel mapping and decomposition dimensions influencing the placement and interconnection of slices. Our framework also incorporates flexible functional splitting, with possibly different splitting for different slices while taking into consideration dependency factors such as varying network latency and data volume throughout the virtual access networks. Numerical results are then presented to assess the efficiency of our approach

Profit and Strategic Analysis for MNO-MVNO Partnership

International audienceWe consider a mobile market driven by two Mobile Network Operators (MNOs) and a new competitor Mobile Virtual Network Operator (MVNO). The MNOs can partner with the entrant MVNO by leasing network resources; however, the MVNO can also rely on other technologies such as free WiFi access points. Moreover, in addition to its connectivity offer, the MVNO can also draw indirect revenues from services due to its brand. In that framework including many access technologies and several revenue sources, a possible partner MNO will then have to decide which wholesale price to charge the MVNO for its resources. This multi-actor context, added to the need to consider both wholesale and retail markets, represents a new challenge for the underlying decision-making process. In this paper, the optimal price setting is formulated as a multi-level optimization problem which enables us to derive closed-form expressions for the optimal MNOs wholesale prices and the optimal MVNO retail price. The price attractivity of the MVNO is also evaluated in terms of its indirect revenues and the proportion of resources leased from possible partner MNOs. Finally, through a game-theoretical approach, we characterize the scenario where both MNOs partner with the MVNO as the unique Nash equilibrium under appropriate conditions

On the impact of novel function mappings, sharing policies, and split settings in network slice design

International audienceIn this work, we model the network slice provi-sioning as an optimization problem including novel mapping and provisioning requirements rising with new 5G radio and core function placement policies. We propose an MILP-based formulation that joins different functional splitting strategies with different network function sharing policies and novel mapping continuity constraints from 5G specifications. We show by numerical simulations the impact of taking into full and partial consideration these peculiar sets of novel technical constraints

Mathematical Formulation for the Network Slice Design Problem

In this document, we provide a Mixed Integer Linear Program to the Network Slice Design problem, which includes novel mapping decision points rising with new 5G radio and core function placement policies. The model in particular encompasses flexible functional splitting, with possibly different splitting for different slices, and sub-slice and network function decomposition