Power Aware Routing in Mobile Ad Hoc Networks

To support bursty traffic on the Internet (and especially WWW) efficiently, optical burst switching (OBS) is proposed as a way to streamline both protocols and hardware in building the future gener...

Optical burst switching (OBS) - a new paradigm for an optical Internet

Computer communications

In the fifth-generation (5G) mobile communication system, various service requirements of different communication environments are expected to be satisfied. As a new evolution network structure, heterogeneous network (HetNet) has been studied in recent years. Compared with homogeneous networks, HetNets can increase the opportunity in the spatial resource reuse and improve users’ quality of service by developing small cells into the coverage of macrocells. Since there is mutual interference among different users and the limited spectrum resource in HetNets, however, efficient resource allocation (RA) algorithms are vitally important to reduce the mutual interference and achieve spectrum sharing. In this article, we provide a comprehensive survey on RA in HetNets for 5G communications. Specifically, we first introduce the definition and different network scenarios of HetNets. Second, RA models are discussed. Then, we present a classification to analyze current RA algorithms for the existing works. Finally, some challenging issues and future research trends are discussed. Accordingly, we provide two potential structures for 6G communications to solve the RA problems of the next-generation HetNets, such as a learning-based RA structure and a control-based RA structure. The goal of this article is to provide important information on HetNets, which could be used to guide the development of more efficient techniques in this research area.

/pdf/a-survey-on-resource-allocation-for-5g-heterogeneous-4gmdtz8zbn.pdf

A Survey on Resource Allocation for 5G Heterogeneous Networks: Current Research, Future Trends, and Challenges

Next-generation wireless networks must support ultra-reliable, low-latency communication and intelligently manage a massive number of Internet of Things (IoT) devices in real-time, within a highly dynamic environment. This need for stringent communication quality-of-service (QoS) requirements as well as mobile edge and core intelligence can only be realized by integrating fundamental notions of artificial intelligence (AI) and machine learning across the wireless infrastructure and end-user devices. In this context, this paper provides a comprehensive tutorial that introduces the main concepts of machine learning, in general, and artificial neural networks (ANNs), in particular, and their potential applications in wireless communications. For this purpose, we present a comprehensive overview on a number of key types of neural networks that include feed-forward, recurrent, spiking, and deep neural networks. For each type of neural network, we present the basic architecture and training procedure, as well as the associated challenges and opportunities. Then, we provide an in-depth overview on the variety of wireless communication problems that can be addressed using ANNs, ranging from communication using unmanned aerial vehicles to virtual reality and edge caching.For each individual application, we present the main motivation for using ANNs along with the associated challenges while also providing a detailed example for a use case scenario and outlining future works that can be addressed using ANNs. In a nutshell, this article constitutes one of the first holistic tutorials on the development of machine learning techniques tailored to the needs of future wireless networks.

Artificial Neural Networks-Based Machine Learning for Wireless Networks: A Tutorial

In this article, the routing and wavelength assignment (RWA) problem for supporting multipoint-to-point communications in all-optical WDM mesh networks is investigated. Two efficient algorithms, namely reverse shortest path tree routing (RSPT) and k-bounded edge disjoint path routing (EDPR), are proposed. We proved that the problem of minimizing the total cost while establishing a multipoint-to-point session can be solved in polynomial time of O(|V|log|V| + |V| + |E|) by the RSPT algorithm, where |V| and |E| denote the number of nodes and the number of edges in the network, respectively. Nevertheless, the solution provided by the EDPR algorithm produces a significant reduction in the maximum number of wavelengths required per link (i.e., the link stress) for a multipoint-to-point session compared to RSPT algorithm. EDPR algorithm can also approximate to the optimal total cost with a ratio of k. Simulations are done to assess these two algorithms. Numerical results demonstrate their efficiencies in supporting multipoint-to-point communications in all-optical WDM networks.

/pdf/all-optical-multipoint-to-point-routing-in-wdm-mesh-networks-3a8ezme1tm.pdf

All-optical multipoint-to-point routing in WDM mesh networks

In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed multi-protocol label switching-traffic engineering (MPLS-TE) path computation, where requests are handled one by one, in an uncoordinated manner without any knowledge of future and other requests. Our solution is motivated by the considerable impact of the tunnel setup order on the network load and blocking probability. If it is not possible to control this order, in return it is possible, in some cases, to reorder requests using the pre-emption function. After evaluating the impact of the tunnel setup order, we study the use of preemption to reorder LSP setup, with various algorithms, including shortest path first (SPF), widest shortest path (WSP) and shortest widest path (SWP). We show that the preemption is well suited to shortest path based algorithms and the performances in terms of blocking rate are significantly improved.

/pdf/lsp-setup-arrival-reordering-approach-for-mpls-te-routing-2q88yml0u7.pdf

LSP Setup Arrival Reordering Approach for MPLS-TE Routing

Achieving an energy-efficient home network while providing high quality user service is and will continue to be a significant need for the future residential environment. In this home network environment, numerous home appliances are widely used and also integrally turned on to contribute to the home network service. But these appliances are used partially in different service requirements. Therefore, in this paper, we propose a collaborative overlay power management system in which appliances can be partially turned on depending on the request of the services. Moreover, by learning a users behavior, the collaborative overlay power management could trend to minimize power consumption or trend to minimize the waiting delay. Regarding research on the different power consumption and waiting delay tradeoffs, our proposition allows for satisfying different user requirements on power consumption and waiting delay.

/pdf/collaborative-overlay-power-management-based-on-the-delay-2p3s12vihx.pdf

Collaborative overlay power management based on the delay-power tradeoffs

Energy saving is a really interesting topic in today's networks. Indeed, Information and Communication Technologies (ICT) systems are energy greedy, they require more and more energy and as energy is more and more expensive, thus we seek to save it. Accordingly, energy saving has recently received considerable attention as a promising approach for delivering ICT services with environmentally conscious use of smart technology. Thus, this paper addresses the issue of energy consumption in broadband and carrier networks and especially in Carrier-Ethernet networks. We review and describe relevant works currently proposed for energy-efficient operation of wired network infrastructure. Accordingly, in this paper we survey and discuss different technical issues related to energy saving. Furthermore, we have classified energy aware strategies in two main categories. Research proposals related to each category are deeply discussed. In addition, this paper identifies some of the remaining key research challenges. Besides that, we have analyzed the adaptation and the suitability of approaches that have been proposed for IP networks to carrier Ethernet networks.

/pdf/study-of-energy-saving-in-carrier-ethernet-network-54og4ukb9y.pdf

Study of Energy Saving in Carrier-Ethernet Network

Les reseaux pair-a-pair (P2P) jouent aujourd'hui un role primordial dans la livraison de la video a grande echelle. La perte des paquets sur les reseaux IP, peut affecter defavorablement la qualite de la video recue. Differents mecanismes de reparation de perte sont utilises aujourd'hui. Ces mecanismes ont ete proposes initialement pour des applications n'ayant pas de contraintes de delai de reparation. Ils ne peuvent pas, donc, garantir la qualite de la video en cas de perte. Nous proposons dans ce papier un nouveau mecanisme de reparation de perte. Il permet d'optimiser la qualite de la video transmise sur les reseaux P2P. Son principe consiste a demander les paquets perdus a un pair selectionne aleatoirement parmi les pairs du reseau ayant ces paquets. Ce pair ne sera pas systematiquement leur fournisseur initial. Ce mecanisme vise a augmenter la probabilite de choisir un pair disponible pour faire la retransmission. Ceci peut augmenter la probabilite de recevoir les paquets retransmis avant leur temps de visualisation. Ce qui ameliore la qualite de la video recue. Nos etudes par simulations ont montre l'efficacite de ce mecanisme par rapport aux mecanismes actuels de retransmission.

https://hal.inria.fr/inria-00470547/document

Bernard Cousin

Papers

All-optical multipoint-to-point routing in WDM mesh networks

LSP Setup Arrival Reordering Approach for MPLS-TE Routing

Collaborative overlay power management based on the delay-power tradeoffs

Study of Energy Saving in Carrier-Ethernet Network

Optimisation de la retransmission des paquets perdus en streaming P2P