Game Theory for Cooperation in Multi-Access Edge Computing

2019 ◽  
pp. 100-149
Author(s):  
Jose Moura ◽  
Rui Neto Marinheiro ◽  
Joao Carlos Silva
Keyword(s):  
Game Theory ◽  
Large Scale ◽  
Network Performance ◽  
Theoretical Models ◽  
Spectrum Utilization ◽  
Open Problems ◽  
Cooperative Strategies ◽  
Complex Interactions ◽  
Management Policies ◽  
Multi Access

Cooperative strategies amongst network players can improve network performance and spectrum utilization in future networking environments. Game Theory is very suitable for these emerging scenarios, since it models high-complex interactions among distributed decision makers. It also finds the more convenient management policies for the diverse players (e.g., content providers, cloud providers, edge providers, brokers, network providers, or users). These management policies optimize the performance of the overall network infrastructure with a fair utilization of their resources. This chapter discusses relevant theoretical models that enable cooperation amongst the players in distinct ways through, namely, pricing or reputation. In addition, the authors highlight open problems, such as the lack of proper models for dynamic and incomplete information scenarios. These upcoming scenarios are associated to computing and storage at the network edge, as well as, the deployment of large-scale IoT systems. The chapter finalizes by discussing a business model for future networks.

Game Theory for Collaboration in Future Networks

2014 ◽  
pp. 94-123
Author(s):  
José André Moura ◽  
Rui Neto Marinheiro ◽  
João Carlos Silva
Keyword(s):  
Game Theory ◽  
Network Performance ◽  
Mathematical Tool ◽  
Spectrum Utilization ◽  
New Paradigm ◽  
Open Problems ◽  
Cooperative Strategies ◽  
Complex Interactions ◽  
Incomplete Information Games ◽  
Intelligent Decision

Cooperative strategies have the great potential of improving network performance and spectrum utilization in future networking environments. This new paradigm in terms of network management, however, requires a novel design and analysis framework targeting a highly flexible networking solution with a distributed architecture. Game Theory is very suitable for this task, since it is a comprehensive mathematical tool for modeling the highly complex interactions among distributed and intelligent decision makers. In this way, the more convenient management policies for the diverse players (e.g. content providers, cloud providers, home providers, brokers, network providers or users) should be found to optimize the performance of the overall network infrastructure. The authors discuss in this chapter several Game Theory models/concepts that are highly relevant for enabling collaboration among the diverse players, using different ways to incentivize it, namely through pricing or reputation. In addition, the authors highlight several related open problems, such as the lack of proper models for dynamic and incomplete information games in this area.

Game Theory for Collaboration in Future Networks

2016 ◽  
pp. 2061-2091
Author(s):  
José André Moura ◽  
Rui Neto Marinheiro ◽  
João Carlos Silva
Keyword(s):  
Game Theory ◽  
Network Performance ◽  
Mathematical Tool ◽  
Spectrum Utilization ◽  
New Paradigm ◽  
Open Problems ◽  
Cooperative Strategies ◽  
Complex Interactions ◽  
Incomplete Information Games ◽  
Intelligent Decision

Cooperative strategies have the great potential of improving network performance and spectrum utilization in future networking environments. This new paradigm in terms of network management, however, requires a novel design and analysis framework targeting a highly flexible networking solution with a distributed architecture. Game Theory is very suitable for this task, since it is a comprehensive mathematical tool for modeling the highly complex interactions among distributed and intelligent decision makers. In this way, the more convenient management policies for the diverse players (e.g. content providers, cloud providers, home providers, brokers, network providers or users) should be found to optimize the performance of the overall network infrastructure. The authors discuss in this chapter several Game Theory models/concepts that are highly relevant for enabling collaboration among the diverse players, using different ways to incentivize it, namely through pricing or reputation. In addition, the authors highlight several related open problems, such as the lack of proper models for dynamic and incomplete information games in this area.

scholarly journals THEORETICAL TOOLS FOR CMB PHYSICS

2005 ◽  
Vol 14 (03n04) ◽  
pp. 363-510 ◽  
Author(s):  
MASSIMO GIOVANNINI
Keyword(s):  
Early Universe ◽  
Large Scale ◽  
Theoretical Models ◽  
Unified Theory ◽  
Open Problems ◽  
Gauge Invariant ◽  
Origin And Evolution ◽  
Consistent Manner ◽  
Stochastic Backgrounds ◽  
Analytical Tools

This review presents, in a self–consistent manner, those analytical tools that are relevant for the analysis of the physics of CMB anisotropies generated in different theoretical models of the early Universe. After introducing the physical foundations of the Sachs–Wolfe effect, the origin and evolution of the scalar, tensor and vector modes of the geometry is treated in both gauge-invariant and gauge-dependent descriptions. Some of the recent progresses in the theory of cosmological perturbations are scrutinized with particular attention to their implications for the adiabatic and isocurvature paradigms, whose description is reviewed both within conventional fluid approaches and within the Einstein–Boltzmann treatment. Open problems and theoretical challenges for a unified theory of the early Universe are outlined in light of their implications for the generation of large-scale anisotropies in the CMB sky and in light of the generation of stochastic backgrounds of relic gravitons between few Hz and the GHz.

Flexible Spectrum Management: Approaches for India

2015 ◽  
Vol 8 (1) ◽  
Author(s):  
Arturo Basaure ◽  
Heikki Kokkinen ◽  
Heikki Hämmäinen ◽  
V. Sridhar
Keyword(s):  
Large Scale ◽  
Mobile Services ◽  
Radio Spectrum ◽  
Spectrum Management ◽  
Management Approach ◽  
Unlicensed Spectrum ◽  
Spectrum Band ◽  
Management Policies ◽  
Management Approaches ◽  
Lock In

Radio spectrum for commercial mobile services continues to be scarce. Countries around the world have recognized the importance of efficient utilization of this scarce resource and have initiated regulatory and policy steps towards flexible approaches to spectrum management, including sharing of licensed spectrum, and releasing unlicensed spectrum for mobile services. Technologies for shared access and the associated standardization activities have also progressed towards possible large scale deployments. In this paper, we analyze the evolution of spectrum management policies using a causal model and indicate how the markets can lock in to either centralized or flexible approach. We also cite a use case of a flexible spectrum management approach using spectrum band fill option and indicate its suitability to the Indian context.

scholarly journals HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Jiawei Huang ◽  
Shiqi Wang ◽  
Shuping Li ◽  
Shaojun Zou ◽  
Jinbin Hu ◽  
...  
Keyword(s):  
Data Center ◽  
Large Scale ◽  
Network Performance ◽  
Rooted Tree ◽  
Heterogeneous Traffic ◽  
Data Center Networks ◽  
Packet Reordering ◽  
Traffic Characteristics ◽  
Network Utilization ◽  
The Impact

AbstractModern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical to achieve low latency and high throughput. Although the per-packet schemes such as Random Packet Spraying (RPS) can achieve high network utilization and near-optimal tail latency in symmetric topologies, they are prone to cause significant packet reordering and degrade the network performance. Moreover, some coding-based schemes are proposed to alleviate the problem of packet reordering and loss. Unfortunately, these schemes ignore the traffic characteristics of data center network and cannot achieve good network performance. In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC to eliminate the impact of packet reordering and improve the performance of short and long flows. HTPC smoothly adjusts the number of redundant packets based on the multi-path congestion information and the traffic characteristics so that the tailing probability of short flows and the timeout probability of long flows can be reduced. Through a series of large-scale NS2 simulations, we demonstrate that HTPC reduces average flow completion time by up to 60% compared with the state-of-the-art mechanisms.

Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search

2021 ◽  
Vol 16 (2) ◽  
pp. 1-34
Author(s):  
Rediet Abebe ◽  
T.-H. HUBERT Chan ◽  
Jon Kleinberg ◽  
Zhibin Liang ◽  
David Parkes ◽  
...  
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Iterative Process ◽  
Large Scale ◽  
Opinion Dynamics ◽  
Theoretical Models ◽  
Global Optimum ◽  
Local Optimum ◽  
Opinion Formation ◽  
Long Line

A long line of work in social psychology has studied variations in people’s susceptibility to persuasion—the extent to which they are willing to modify their opinions on a topic. This body of literature suggests an interesting perspective on theoretical models of opinion formation by interacting parties in a network: in addition to considering interventions that directly modify people’s intrinsic opinions, it is also natural to consider interventions that modify people’s susceptibility to persuasion. In this work, motivated by this fact, we propose an influence optimization problem. Specifically, we adopt a popular model for social opinion dynamics, where each agent has some fixed innate opinion, and a resistance that measures the importance it places on its innate opinion; agents influence one another’s opinions through an iterative process. Under certain conditions, this iterative process converges to some equilibrium opinion vector. For the unbudgeted variant of the problem, the goal is to modify the resistance of any number of agents (within some given range) such that the sum of the equilibrium opinions is minimized; for the budgeted variant, in addition the algorithm is given upfront a restriction on the number of agents whose resistance may be modified. We prove that the objective function is in general non-convex. Hence, formulating the problem as a convex program as in an early version of this work (Abebe et al., KDD’18) might have potential correctness issues. We instead analyze the structure of the objective function, and show that any local optimum is also a global optimum, which is somehow surprising as the objective function might not be convex. Furthermore, we combine the iterative process and the local search paradigm to design very efficient algorithms that can solve the unbudgeted variant of the problem optimally on large-scale graphs containing millions of nodes. Finally, we propose and evaluate experimentally a family of heuristics for the budgeted variant of the problem.

Creep of frozen slopes and ice-filled rock joints under temperature variation

2006 ◽  
Vol 33 (6) ◽  
pp. 719-725 ◽  
Author(s):  
Branko Ladanyi
Keyword(s):  
Creep Behavior ◽  
Large Scale ◽  
Variable Temperature ◽  
Theoretical Models ◽  
Rock Joints ◽  
Interface Problems ◽  
Frozen Ground ◽  
Rock Glaciers ◽  
Rock Interface ◽  
Creep Temperature

Owing to climate warming trends, there has been an increasing interest in recent years in the accelerating creep of rock glaciers and frozen slopes. In the field of glaciology, the creep of glaciers has been extensively studied, observed, and analyzed for more than 100 years. Many valuable and detailed theoretical models have been proposed through the years for simulating the creep behavior of glaciers. This synthesis paper has no intention of proposing another one. Its purpose is only to supply to these models a potential geotechnical background, borrowed from the connected fields of frozen ground mechanics, rock mechanics, and the mechanics of mixtures. In particular, this paper attempts to extend some known models of mechanical behavior of unfrozen soil and rock masses to masses containing ice and to apply these models to large-scale creep of ice–rock mixtures and ice–rock interface problems under variable temperature and stress conditions.Key words: ice, rock, mixture, rock joints, slope stability, creep, temperature.

Changes in mechanisms and intensity of Western U.S. floods, 1960-2013

2021 ◽  
Author(s):  
Jessica Fayne ◽  
Huilin Huang ◽  
Mike Fischella ◽  
Yufei Liu ◽  
Zhaoxin Ban ◽  
...  
Keyword(s):  
Extreme Precipitation ◽  
Large Scale ◽  
Critical Factor ◽  
Flood Frequency ◽  
Atmospheric Rivers ◽  
Convective Storms ◽  
Noticeable Increase ◽  
Complex Interactions ◽  
Different Types ◽  
The Impact

<p>Extreme precipitation, a critical factor in flooding, has selectively increased with warmer temperatures in the Western U.S. Despite this, the streamflow measurements have captured no noticeable increase in large-scale flood frequency or intensity. As flood studies have mostly focused on specific flood events in particular areas, analyses of large-scale floods and their changes have been scarce. For floods during 1960-2013, we identify six flood generating mechanisms (FGMs) that are prominent across the Western U.S., including atmospheric rivers and non-atmospheric rivers, monsoons, convective storms, radiation-driven snowmelt, and rain-on-snow, in order to identify to what extent different types of floods are changing based on the dominant FGM. The inconsistency between extreme precipitation and lack of flood increase suggests that the impact of climate change on flood risk has been modulated by hydro-meteorological and physiographic processes such as sharp increases in temperature that drive increased evapotranspiration and decreased soil moisture. Our results emphasize the importance of FGMs in understanding the complex interactions of flooding and climatic changes and explain the broad spatiotemporal changes that have occurred across the vast Western U.S. for the past 50 years.</p>

Exploring host-pathogen interactions at the epithelial surface: application of transcriptomics in lung biology

2007 ◽  
Vol 292 (2) ◽  
pp. L367-L377 ◽  
Author(s):  
Joost B. Vos ◽  
Nicole A. Datson ◽  
Klaus F. Rabe ◽  
Pieter S. Hiemstra
Keyword(s):  
Gene Expression ◽  
Epithelial Cells ◽  
Large Scale ◽  
Brain Research ◽  
Airway Epithelial Cells ◽  
Airway Epithelial ◽  
Host Pathogen Interactions ◽  
Epithelial Surface ◽  
Complex Interactions ◽  
Host Pathogen

The epithelial surface of the airways is the largest barrier-forming interface between the human body and the outside world. It is now well recognized that, at this strategic position, airway epithelial cells play an eminent role in host defense by recognizing and responding to microbial exposure. Conversely, inhaled microorganisms also respond to contact with epithelial cells. Our understanding of this cross talk is limited, requiring sophisticated experimental approaches to analyze these complex interactions. High-throughput technologies, such as DNA microarray analysis and serial analysis of gene expression (SAGE), have been developed to screen for gene expression levels at large scale within single experiments. Since their introduction, these hypothesis-generating technologies have been widely used in diverse areas such as oncology and brain research. Successful application of these genomics-based technologies has also revealed novel insights in host-pathogen interactions in both the host and pathogen. This review aims to provide an overview of the SAGE and microarray technology illustrated by their application in the analysis of host-pathogen interactions. In particular, the interactions between epithelial cells in the human lungs and clinically relevant microorganisms are the central focus of this review.

scholarly journals Relationship-Oriented Software Defined AS-Level Fast Rerouting for Multiple Link Failures

2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Chunxiu Li ◽  
Xin Li ◽  
Ke Li ◽  
Jiafu Huang ◽  
Zhansheng Feng ◽  
...  
Keyword(s):  
Distributed Control ◽  
Large Scale ◽  
Network Performance ◽  
Failure Recovery ◽  
Internet Routing ◽  
Link Failures ◽  
Significant Control ◽  
Control Overhead ◽  
Fast Reroute ◽  
Multiple Link Failures

Large-scale deployments of mission-critical services have led to stringent demands on Internet routing, but frequently occurring network failures can dramatically degrade the network performance. However, Border Gateway Protocol (BGP) can not react quickly to recover from them. Although extensive research has been conducted to deal with the problem, the multiple failure scenarios have never been properly addressed due to the limit of distributed control plane. In this paper, we propose a local fast reroute approach to effectively recover from multiple link failures in one administrative domain. The principle of Software Defined Networking (SDN) is used to achieve the software defined AS-level fast rerouting. Considering AS relationships, efficient algorithms are proposed to automatically and dynamically find protection paths for multiple link failures; then OpenFlow forwarding rules are installed on routers to provide data forwarding continuity. Our approach is able to ensure applicability to ASes with flexibility and adaptability to multiple link failures, contributing toward improving the network performance. Through experimental results, we show that our proposal provides effective failure recovery and does not introduce significant control overhead to the network.

Sign in / Sign up

Export Citation Format

Share Document