Cost-aware caching: optimizing cache provisioning and object placement in ICN

Caching is frequently used by Internet Service Providers as a viable technique to reduce the latency perceived by end users, while jointly offloading network traffic. While the cache hit-ratio is generally considered in the literature as the dominant performance metric for such type of systems, in this paper we argue that a critical missing piece has so far been neglected. Adopting a radically different perspective, in this paper we explicitly account for the cost of content retrieval, i.e. the cost associated to the external bandwidth needed by an ISP to retrieve the contents requested by its customers. Interestingly, we discover that classical cache provisioning techniques that maximize cache efficiency (i.e., the hit-ratio), lead to suboptimal solutions with higher overall cost. To show this mismatch, we propose two optimization models that either minimize the overall costs or maximize the hit-ratio, jointly providing cache sizing, object placement and path selection. We formulate a polynomial-time greedy algorithm to solve the two problems and analytically prove its optimality. We provide numerical results and show that significant cost savings are attainable via a cost-aware design

A Distributed Demand-Side Management Framework for the Smart Grid

This paper proposes a fully distributed Demand-Side Management system for Smart Grid infrastructures, especially tailored to reduce the peak demand of residential users. In particular, we use a dynamic pricing strategy, where energy tariffs are function of the overall power demand of customers. We consider two practical cases: (1) a fully distributed approach, where each appliance decides autonomously its own scheduling, and (2) a hybrid approach, where each user must schedule all his appliances. We analyze numerically these two approaches, showing that they are characterized practically by the same performance level in all the considered grid scenarios. We model the proposed system using a non-cooperative game theoretical approach, and demonstrate that our game is a generalized ordinal potential one under general conditions. Furthermore, we propose a simple yet effective best response strategy that is proved to converge in a few steps to a pure Nash Equilibrium, thus demonstrating the robustness of the power scheduling plan obtained without any central coordination of the operator or the customers. Numerical results, obtained using real load profiles and appliance models, show that the system-wide peak absorption achieved in a completely distributed fashion can be reduced up to 55%, thus decreasing the capital expenditure (CAPEX) necessary to meet the growing energy demand

Defeating jamming with the power of silence: a game-theoretic analysis

The timing channel is a logical communication channel in which information is encoded in the timing between events. Recently, the use of the timing channel has been proposed as a countermeasure to reactive jamming attacks performed by an energy-constrained malicious node. In fact, whilst a jammer is able to disrupt the information contained in the attacked packets, timing information cannot be jammed and, therefore, timing channels can be exploited to deliver information to the receiver even on a jammed channel. Since the nodes under attack and the jammer have conflicting interests, their interactions can be modeled by means of game theory. Accordingly, in this paper a game-theoretic model of the interactions between nodes exploiting the timing channel to achieve resilience to jamming attacks and a jammer is derived and analyzed. More specifically, the Nash equilibrium is studied in the terms of existence, uniqueness, and convergence under best response dynamics. Furthermore, the case in which the communication nodes set their strategy and the jammer reacts accordingly is modeled and analyzed as a Stackelberg game, by considering both perfect and imperfect knowledge of the jammer's utility function. Extensive numerical results are presented, showing the impact of network parameters on the system performance.Comment: Anti-jamming, Timing Channel, Game-Theoretic Models, Nash Equilibriu

A dataset for mobile edge computing network topologies

Mobile Edge Computing (MEC) is vital to support the numerous, future applications that are envisioned in the 5G and beyond mobile networks. Since computation capabilities are available at the edge of the network, applications that need ultra low-latency, high bandwidth and reliability can be deployed more easily. This opens up the possibility of developing smart resource allocation approaches that can exploit the MEC infrastructure in an optimized way and, at the same time, fulfill the requirements of applications. However, up to date, the progress of research in this area is limited by the unavailability of publicly available true MEC topologies that could be used to run extensive experiments and to compare the performance on different solutions concerning planning, scheduling, routing etc. For this reason, we decided to infer and make publicly available several synthetic MEC topologies and scenarios. Specifically, based on the experience we have gathered with our experiments Xiang et al. [1], we provide data related to 3 randomly generated topologies, with increasing network size (from 25 to 100 nodes). Moreover, we propose a MEC topology generated from OpenCellID [2] real data and concerning the Base Stations’ location of 234 LTE cells owned by a mobile operator (Vodafone) in the center of Milan. We also provide realistic reference parameters (link bandwidth, computation and storage capacity, offered traffic), derived from real services provided by MEC in the deployment of 5G networks

Resource Calendaring for Mobile Edge Computing in 5G Networks

Mobile Edge Computing (MEC) is a key technology for the deployment of next generation (5G and beyond) mobile networks, specifically for reducing the latency experienced by mobile users which require ultra-low latency, high bandwidth, as well as real-time access to the radio network. In this paper, we propose an optimization framework that considers several key aspects of the resource allocation problem for MEC, by carefully modeling and optimizing the allocation of network resources including computation and storage capacity available on network nodes as well as link capacity. Specifically, both an exact optimization model and an effective heuristic are provided, jointly optimizing (1) the connections admission decision (2) their scheduling, also called calendaring (3) and routing as well as (4) the decision of which nodes will serve such connections and (5) the amount of processing and storage capacity reserved on the chosen nodes. Numerical experiments are conducted in several real-size network scenarios, which demonstrate that the heuristic performs close to the optimum in all the considered network scenarios, while exhibiting a low computing time

Semi-distributed Traffic Engineering for Elastic Flows in Software Defined Networks

Software-Defined Networking (SDN) is becoming the reference paradigm to provide advanced Traffic Engineering (TE) solutions for future networks. However, taking all TE decisions at the controller, in a centralized fashion, may require long delays to react to network changes. With the most recent advancements in SDN programmability some decisions can (and should indeed) be offloaded to switches. In this paper we present a model to route elastic demands in a general network topology adopting a semi-distributed approach of the control plane to deal with path congestion. Specifically, we envision a Stackelberg approach where the SDN controller takes the role of Leader, choosing the most appropriate subset of routing paths for the selfish users (network switches), which behave as Followers, making local routing decisions based on path congestion. To overcome the complexity of the problem and meet the time requirements of real-life settings, we propose effective heuristic procedures which take into accurate account traffic dynamics, considering a stochastic scenario where both the number and size of flows change over time. We test our framework with a custom-developed simulator in different network topologies and instance sizes. Numerical results show how our model and heuristics achieve the desired balance between making global decisions and reacting rapidly to congestion events

Socially-Aware Network Design Games

In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, where connectivity is due to Autonomous Systems' choices, but also of overlay networks, where each user client can decide the set of connections to establish. Recent works have used game theory, and in particular the concept of Nash Equilibrium, to characterize stable networks created by a set of selfish agents. The majority of these works assume that users are completely non-cooperative, leading, in most cases, to inefficient equilibria. To improve efficiency, in this paper we propose two novel socially-aware network design games. In the first game we incorporate a socially-aware component in the users' utility functions, while in the second game we use additionally a Stackelberg (leader-follower) approach, where a leader (e.g., the network administrator) architects the desired network buying an appropriate subset of network's links, driving in this way the users to overall efficient Nash equilibria. We provide bounds on the Price of Anarchy and other efficiency measures, and study the performance of the proposed schemes in several network scenarios, including realistic topologies where players build an overlay on top of real Internet Service Provider networks. Numerical results demonstrate that (1) introducing some incentives to make users more socially-aware is an effective solution to achieve stable and efficient networks in a distributed way, and (2) the proposed Stackelberg approach permits to achieve dramatic performance improvements, designing almost always the socially optimal network

Concurrent metaboreflex activation increases chronotropic and ventilatory responses to passive leg movement without sex-related differences

Previous studies in animal models showed that exercise-induced metabolites accumulation may sensitize the mechanoreflex-induced response. The aim of this study was to assess whether the magnitude of the central hemodynamic and ventilatory adjustments evoked by isolated stimulation of the mechanoreceptors in humans are influenced by the prior accumulation of metabolic byproducts in the muscle. 10 males and 10 females performed two exercise bouts consisting of 5-min of intermittent isometric knee-extensions performed 10% above the previously determined critical force. Post-exercise, the subjects recovered for 5 min either with a suprasystolic circulatory occlusion applied to the exercised quadriceps (PECO) or under freely-perfused conditions (CON). Afterwards, 1-min of continuous passive leg movement was performed. Central hemodynamics, pulmonary data, and electromyography from exercising/passively-moved leg were recorded throughout the trial. Root mean square of successive differences (RMSSD, index of vagal tone) was also calculated. Δpeak responses of heart rate (ΔHR) and ventilation ([Formula: see text]) to passive leg movement were higher in PECO compared to CON (ΔHR: 6 ± 5 vs 2 ± 4 bpm, p = 0.01; 3.9 ± 3.4 vs 1.9 ± 1.7 L min-1, p = 0.02). Δpeak of mean arterial pressure (ΔMAP) was significantly different between conditions (5 ± 3 vs  - 3 ± 3 mmHg, p < 0.01). Changes in RMSSD with passive leg movement were different between PECO and CON (p < 0.01), with a decrease only in the former (39 ± 18 to 32 ± 15 ms, p = 0.04). No difference was found in all the other measured variables between conditions (p > 0.05). These findings suggest that mechanoreflex-mediated increases in HR and [Formula: see text] are sensitized by metabolites accumulation. These responses were not influenced by biological sex