EUROPEAN CONFERENCE ON QUEUEING THEORY 2016

International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the Takács Award for outstanding PhD thesis on "Queueing Theory and its Applications"

Intelligent spectrum management techniques for wireless cognitive radio networks

PhD ThesisThis thesis addresses many of the unique spectrum management chal- lenges in CR networks for the rst time. These challenges have a vital e ect on the network performance and are particularly di cult to solve due to the unique characteristics of CR networks. Speci cally, this thesis proposes and investigates three intelligent spectrum management tech- niques for CR networks. The issues investigated in this thesis have a fundamental impact on the establishment, functionality and security of CR networks. First, an intelligent primary receiver-aware message exchange protocol for CR ad hoc networks is proposed. It considers the problem of alleviat- ing the interference collision risk to primary user communication, explic- itly to protect primary receivers that are not detected during spectrum sensing. The proposed protocol achieves a higher measure of safeguard- ing. A practical scenario is considered where no global network topology is known and no common control channel is assumed to exist. Second, a novel CR broadcast protocol (CRBP) to reliably disseminate the broadcast messages to all or most of the possible CR nodes in the network is proposed. The CRBP formulates the broadcast problem as a bipartite-graph problem. Thus, CRBP achieves a signi cant successful delivery ratio by connecting di erent local topologies, which is a unique feature in CR ad hoc networks. Finally, a new defence strategy to defend against spectrum sensing data falsi cation attacks in CR networks is proposed. In order to identify malicious users, the proposed scheme performs multiple veri cations of sensory data with the assistance of trusted nodes.Higher Committee For Education Devel- opment in Iraq (HCED-Iraq

Learning Augmented Optimization for Network Softwarization in 5G

The rapid uptake of mobile devices and applications are posing unprecedented traffic burdens on the existing networking infrastructures. In order to maximize both user experience and investment return, the networking and communications systems are evolving to the next gen- eration – 5G, which is expected to support more flexibility, agility, and intelligence towards provisioned services and infrastructure management. Fulfilling these tasks is challenging, as nowadays networks are increasingly heterogeneous, dynamic and expanded with large sizes. Network softwarization is one of the critical enabling technologies to implement these requirements in 5G. In addition to these problems investigated in preliminary researches about this technology, many new emerging application requirements and advanced opti- mization & learning technologies are introducing more challenges & opportunities for its fully application in practical production environment. This motivates this thesis to develop a new learning augmented optimization technology, which merges both the advanced opti- mization and learning techniques to meet the distinct characteristics of the new application environment. To be more specific, the abstracts of the key contents in this thesis are listed as follows: • We first develop a stochastic solution to augment the optimization of the Network Function Virtualization (NFV) services in dynamical networks. In contrast to the dominant NFV solutions applied for the deterministic networking environments, the inherent network dynamics and uncertainties from 5G infrastructure are impeding the rollout of NFV in many emerging networking applications. Therefore, Chapter 3 investigates the issues of network utility degradation when implementing NFV in dynamical networks, and proposes a robust NFV solution with full respect to the underlying stochastic features. By exploiting the hierarchical decision structures in this problem, a distributed computing framework with two-level decomposition is designed to facilitate a distributed implementation of the proposed model in large-scale networks. • Next, Chapter 4 aims to intertwin the traditional optimization and learning technologies. In order to reap the merits of both optimization and learning technologies but avoid their limitations, promissing integrative approaches are investigated to combine the traditional optimization theories with advanced learning methods. Subsequently, an online optimization process is designed to learn the system dynamics for the network slicing problem, another critical challenge for network softwarization. Specifically, we first present a two-stage slicing optimization model with time-averaged constraints and objective to safeguard the network slicing operations in time-varying networks. Directly solving an off-line solution to this problem is intractable since the future system realizations are unknown before decisions. To address this, we combine the historical learning and Lyapunov stability theories, and develop a learning augmented online optimization approach. This facilitates the system to learn a safe slicing solution from both historical records and real-time observations. We prove that the proposed solution is always feasible and nearly optimal, up to a constant additive factor. Finally, simulation experiments are also provided to demonstrate the considerable improvement of the proposals. • The success of traditional solutions to optimizing the stochastic systems often requires solving a base optimization program repeatedly until convergence. For each iteration, the base program exhibits the same model structure, but only differing in their input data. Such properties of the stochastic optimization systems encourage the work of Chapter 5, in which we apply the latest deep learning technologies to abstract the core structures of an optimization model and then use the learned deep learning model to directly generate the solutions to the equivalent optimization model. In this respect, an encoder-decoder based learning model is developed in Chapter 5 to improve the optimization of network slices. In order to facilitate the solving of the constrained combinatorial optimization program in a deep learning manner, we design a problem-specific decoding process by integrating program constraints and problem context information into the training process. The deep learning model, once trained, can be used to directly generate the solution to any specific problem instance. This avoids the extensive computation in traditional approaches, which re-solve the whole combinatorial optimization problem for every instance from the scratch. With the help of the REINFORCE gradient estimator, the obtained deep learning model in the experiments achieves significantly reduced computation time and optimality loss

Optimal and Suboptimal Policies for Opportunistic Spectrum Access: A Resource Allocation Approach.

In recent years there has been significant research in increasing efficiency of using spectrum. This concept known as smart radios or Cognitive radio has received widespread attention by companies such as Google and Motorola looking for making contracts with FCC and designing smart radios which can effectively use the unused bandwidth and spectrum in order to transmit their signals without interference with signals of primary users. In this thesis, we study several problems related to resource allocation in wireless networks through modeling and studying them as game theory and stochastic control problems. In the first problem we looked at methods for designing optimal cognitive radios which use optimal and suboptimal sensing policies in order to maximize their long-term expected reward within a finite or infinite horizon. We proved in the case that channels are bursty and user can select only one channel and probe it, the optimal policy for the radio is to use a greedy policy in probing channels and select the channel at each moment that has the highest probability of being available for transmission. In second problem we modeled resource allocation as a congestion game and studied existence of Nash equilibrium for such game. In the last problem, we studied a more general case of the first problem where primary user can select multiple channels at a time in order to sense them. Again the goal of the cognitive radio in this case is to select those channels for sensing that provide him with the highest expected reward in the respective horizon where reward comes from successfully probing a channel and transmitting through it. We summarized all results in the conclusion chapter.Ph.D.Electrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/78778/1/shajiali_1.pd

Network performance & Quality of service in data networks involving spectrum utilization techniques

This research has developed technique to improve the quality of service in wireless data networks that employ spectrum utilization techniques based on Cognitive Radio. Most multiple dimension implementations focus on maximizing the Successful Communication Probability SCP in order to improve the wireless network utilization. However this usually has a negative impact on the Quality of Service, since increasing the SCP leads to increasing signal interference and Packet Loss, and thus network performance deterioration. The Multiple Dimension Cognitive Radio technique is a new technique, proposed in this thesis, that improves the Cognitive Radio Networks (CRN) efficiency by giving opportunity to secondary users (Unlicensed users) to use several dimension such as time, frequency, modulation, coding, and antenna directionality to increase their opportunity in finding spectrum hole. In order to draw a balance between improving the networking utilization and keeping the network performance at an acceptable level, this thesis proposes a new model of multiple dimension CR which provides a compromise between maximizing the SCP and network throughput from one side and keeping the QoS within the accepted thresholds from the other side. This is important so as to avoid network performance degradation which may result from the high user density in single wireless domain as a result of maximizing the SCP. In this research, a full Cognitive Radio model has been implemented in the OPNET simulator by developing modified nodes with the appropriate coding which include basic functionality. The Purpose of this model is to simulate the CR environment and study the network performance after applying the controlled multi dimension technique presented here. The proposed technique observes the channel throughput on TCP (Transmission Control Protocol) level, also QoS KPIs (Key Performance Index) like Packet Loss and Bit Error rate, during the operation of the CR multi dimension technique and alerts the system when the throughput degrades below a certain level. The proposed technique has interactive cautious nature which keeps monitoring the network performance and once find evident on network performance deterioration it takes corrective action, terminates low priority connections and releases over utilized channels, in order to keep the performance accepted

Energy and Delay Efficient Computation Offloading Solutions for Edge Computing

This thesis collects a selective set of outcomes of a PhD course in Electronics, Telecommunications, and Information Technologies Engineering and it is focused on designing techniques to optimize computational resources in different wireless communication environments. Mobile Edge Computing (MEC) is a novel and distributed computational paradigm that has emerged to address the high users demand in 5G. In MEC, edge devices can share their resources to collaborate in terms of storage and computation. One of the computational sharing techniques is computation offloading, which brings a lot of advantages to the network edge, from lower communication, to lower energy consumption for computation. However, the communication among the devices should be managed such that the resources are exploited efficiently. To this aim, in this dissertation, computation offloading in different wireless environments with different number of users, network traffic, resource availability and devices' location are analyzed in order to optimize the resource allocation at the network edge. To better organize the dissertation, the studies are classified in four main sections. In the first section, an introduction on computational sharing technologies is given. Later, the problem of computation offloading is defined, and the challenges are introduced. In the second section, two partial offloading techniques are proposed. While in the first one, centralized and distributed architectures are proposed, in the second work, an Evolutionary Algorithm for task offloading is proposed. In the third section, the offloading problem is seen from a different perspective where the end users can harvest energy from either renewable sources of energy or through Wireless Power Transfer. In the fourth section, the MEC in vehicular environments is studied. In one work a heuristic is introduced in order to perform the computation offloading in Internet of Vehicles and in the other a learning-based approach based on bandit theory is proposed