606 research outputs found
A Game-Theoretic Approach to Strategic Resource Allocation Mechanisms in Edge and Fog Computing
With the rapid growth of Internet of Things (IoT), cloud-centric application management raises
questions related to quality of service for real-time applications. Fog and edge computing
(FEC) provide a complement to the cloud by filling the gap between cloud and IoT. Resource
management on multiple resources from distributed and administrative FEC nodes is a key
challenge to ensure the quality of end-userâs experience. To improve resource utilisation and
system performance, researchers have been proposed many fair allocation mechanisms for
resource management. Dominant Resource Fairness (DRF), a resource allocation policy for
multiple resource types, meets most of the required fair allocation characteristics. However,
DRF is suitable for centralised resource allocation without considering the effects (or
feedbacks) of large-scale distributed environments like multi-controller software defined
networking (SDN). Nash bargaining from micro-economic theory or competitive equilibrium
equal incomes (CEEI) are well suited to solving dynamic optimisation problems proposing to
âproportionatelyâ share resources among distributed participants. Although CEEIâs
decentralised policy guarantees load balancing for performance isolation, they are not faultproof
for computation offloading.
The thesis aims to propose a hybrid and fair allocation mechanism for rejuvenation of
decentralised SDN controller deployment. We apply multi-agent reinforcement learning
(MARL) with robustness against adversarial controllers to enable efficient priority scheduling
for FEC. Motivated by software cybernetics and homeostasis, weighted DRF is generalised by
applying the principles of feedback (positive or/and negative network effects) in reverse game
theory (GT) to design hybrid scheduling schemes for joint multi-resource and multitask
offloading/forwarding in FEC environments.
In the first piece of study, monotonic scheduling for joint offloading at the federated edge is
addressed by proposing truthful mechanism (algorithmic) to neutralise harmful negative and
positive distributive bargain externalities respectively. The IP-DRF scheme is a MARL
approach applying partition form game (PFG) to guarantee second-best Pareto optimality
viii | P a g e
(SBPO) in allocation of multi-resources from deterministic policy in both population and
resource non-monotonicity settings. In the second study, we propose DFog-DRF scheme to
address truthful fog scheduling with bottleneck fairness in fault-probable wireless hierarchical
networks by applying constrained coalition formation (CCF) games to implement MARL. The
multi-objective optimisation problem for fog throughput maximisation is solved via a
constraint dimensionality reduction methodology using fairness constraints for efficient
gateway and low-level controllerâs placement.
For evaluation, we develop an agent-based framework to implement fair allocation policies in
distributed data centre environments. In empirical results, the deterministic policy of IP-DRF
scheme provides SBPO and reduces the average execution and turnaround time by 19% and
11.52% as compared to the Nash bargaining or CEEI deterministic policy for 57,445 cloudlets
in population non-monotonic settings. The processing cost of tasks shows significant
improvement (6.89% and 9.03% for fixed and variable pricing) for the resource non-monotonic
setting - using 38,000 cloudlets. The DFog-DRF scheme when benchmarked against asset fair
(MIP) policy shows superior performance (less than 1% in time complexity) for up to 30 FEC
nodes. Furthermore, empirical results using 210 mobiles and 420 applications prove the
efficacy of our hybrid scheduling scheme for hierarchical clustering considering latency and
network usage for throughput maximisation.Abubakar Tafawa Balewa University, Bauchi (Tetfund, Nigeria
Conception des réseaux maillés sans fil à multiples-radios multiples-canaux
Généralement, les problÚmes de conception de réseaux consistent à sélectionner les arcs et
les sommets dâun graphe G de sorte que la fonction coĂ»t est optimisĂ©e et lâensemble de
contraintes impliquant les liens et les sommets dans G sont respectĂ©es. Une modification dans le critĂšre dâoptimisation et/ou dans lâensemble de contraintes mĂšne Ă une nouvelle reprĂ©sentation dâun problĂšme diffĂ©rent. Dans cette thĂšse, nous nous intĂ©ressons au problĂšme de conception dâinfrastructure de rĂ©seaux maillĂ©s sans fil (WMN- Wireless Mesh Network en Anglais) oĂč nous montrons que la conception de tels rĂ©seaux se transforme dâun
problĂšme dâoptimisation standard (la fonction coĂ»t est optimisĂ©e) Ă un problĂšme
dâoptimisation Ă plusieurs objectifs, pour tenir en compte de nombreux aspects, souvent
contradictoires, mais néanmoins incontournables dans la réalité. Cette thÚse, composée de
trois volets, propose de nouveaux modĂšles et algorithmes pour la conception de WMNs oĂč
rien nâest connu Ă lâ avance.
Le premiervolet est consacrĂ© Ă lâoptimisation simultanĂ©e de deux objectifs
équitablement importants : le coût et la performance du réseau en termes de débit. Trois
modĂšles bi-objectifs qui se diffĂ©rent principalement par lâapproche utilisĂ©e pour maximiser
la performance du réseau sont proposés, résolus et comparés.
Le deuxiĂšme volet traite le problĂšme de placement de passerelles vu son impact sur la
performance et lâextensibilitĂ© du rĂ©seau. La notion de contraintes de sauts (hop constraints)
est introduite dans la conception du réseau pour limiter le délai de transmission. Un nouvel
algorithme basé sur une approche de groupage est proposé afin de trouver les positions
stratĂ©giques des passerelles qui favorisent lâextensibilitĂ© du rĂ©seau et augmentent sa
performance sans augmenter considérablement le coût total de son installation.
Le dernier volet adresse le problÚme de fiabilité du réseau dans la présence de pannes
simples. PrĂ©voir lâinstallation des composants redondants lors de la phase de conception
peut garantir des communications fiables, mais au détriment du coût et de la performance
du rĂ©seau. Un nouvel algorithme, basĂ© sur lâapproche thĂ©orique de dĂ©composition en
oreilles afin dâinstaller le minimum nombre de routeurs additionnels pour tolĂ©rer les pannes
simples, est développé.
Afin de résoudre les modÚles proposés pour des réseaux de taille réelle, un algorithme
évolutionnaire (méta-heuristique), inspiré de la nature, est développé. Finalement, les
méthodes et modÚles proposés on été évalués par des simulations empiriques et
dâĂ©vĂ©nements discrets.Generally, network design problems consist of selecting links and vertices of a graph G so
that a cost function is optimized and all constraints involving links and the vertices in G are
met. A change in the criterion of optimization and/or the set of constraints leads to a new
representation of a different problem. In this thesis, we consider the problem of designing
infrastructure Wireless Mesh Networks (WMNs) where we show that the design of such
networks becomes an optimization problem with multiple objectives instead of a standard
optimization problem (a cost function is optimized) to take into account many aspects, often
contradictory, but nevertheless essential in the reality.
This thesis, composed of three parts, introduces new models and algorithms for
designing WMNs from scratch.
The first part is devoted to the simultaneous optimization of two equally important
objectives: cost and network performance in terms of throughput. Three bi-objective models
which differ mainly by the approach used to maximize network performance are proposed,
solved and compared.
The second part deals with the problem of gateways placement, given its impact on
network performance and scalability. The concept of hop constraints is introduced into the
network design to reduce the transmission delay. A novel algorithm based on a clustering
approach is also proposed to find the strategic positions of gateways that support network
scalability and increase its performance without significantly increasing the cost of installation.
The final section addresses the problem of reliability in the presence of single failures.
Allowing the installation of redundant components in the design phase can ensure reliable
communications, but at the expense of cost and network performance. A new algorithm is
developed based on the theoretical approach of "ear decomposition" to install the minimum
number of additional routers to tolerate single failures.
In order to solve the proposed models for real-size networks, an evolutionary algorithm
(meta-heuristics), inspired from nature, is developed. Finally, the proposed models and
methods have been evaluated through empirical and discrete events based simulations
Gateway placement optimization in LEO satellite networks based on traffic estimation
â© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Adopting satellite constellations to provide global Internet access services has recently drawn increasing attention. A Low Earth Orbit (LEO) satellite network with multiple satellites has global coverage ability, low latency and independent operation, so it can be an effective complement to terrestrial IP networks. Satellite gateways are placed on the ground and can serve as data exchange points between satellite networks and the Internet. As the placement scheme can affect the network performance, it is a fundamental problem to find appropriate sites for gateways. In this paper, a Gateway Placement Optimization (GPO) method in LEO satellite networks is proposed to solve the problem, which is modeled as a combination optimization problem. Our aim is to select the best places for gateways that can balance the traffic loads with as few gateways as possible. The constraints come from the physical links between gateways and satellites including the link interference, the satellite bandwidth and the number of satellite antennas. The gravity model is used to estimate the traffic matrix from/to gateways and satellites, and then the discrete Particle Swarm Optimization (PSO) algorithm is adopted and modified to solve this problem. Finally, the GPO method is applied to numerical tests involving real satellite constellation networks. Results indicate that our method has good performance and effectiveness.Objectius de Desenvolupament Sostenible::9 - IndĂșstria, InnovaciĂł i InfraestructuraObjectius de Desenvolupament Sostenible::9 - IndĂșstria, InnovaciĂł i Infraestructura::9.1 - Desenvolupar infraestructures fiables, sostenibles, resilients i de qualitat, incloent infraestructures regionals i transfrontereres, per tal de donar suport al desenvolupament econĂČmic i al benestar humĂ , amb especial atenciĂł a lâaccĂ©s assequible i equitatiu per a totes les personesObjectius de Desenvolupament Sostenible::9 - IndĂșstria, InnovaciĂł i Infraestructura::9.c - Augmentar de forma significativa lâaccĂ©s a les tecnologies de la informaciĂł i la comunicaciĂł i esforçar-se a proporcionar accĂ©s universal i assequible a Internet als paĂŻsos menys avançats a tot tardar el 2020Postprint (author's final draft
Recommended from our members
Multimedia delivery in the future internet
The term âNetworked Mediaâ implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizensâ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications âon the moveâ, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
Joint Satellite Gateway Placement and Routing for Integrated Satellite-Terrestrial Networks
With the increasing attention to the integrated satellite-terrestrial
networks (ISTNs), the satellite gateway placement problem becomes of paramount
importance. The resulting network performance may vary depending on the
different design strategies. In this paper, a joint satellite gateway placement
and routing strategy for the terrestrial network is proposed to minimize the
overall cost of gateway deployment and traffic routing, while adhering to the
average delay requirement for traffic demands. Although traffic routing and
gateway placement can be solved independently, the dependence between the
routing decisions for different demands makes it more realistic to solve an
aggregated model instead. We develop a mixed-integer linear program (MILP)
formulation for the problem. We relax the integrality constraints to achieve a
linear program (LP) which reduces time-complexity at the expense of a
sub-optimal solution. We further propose a variant of the proposed model to
balance the load between the selected gateways.Comment: 6 pages, In Proceedings of IEEE ICC 2020.
https://ieeexplore.ieee.org/document/9149175 N. Torkzaban, A. Gholami, J. S.
Baras and C. Papagianni, "Joint Satellite Gateway Placement and Routing for
Integrated Satellite-Terrestrial Networks," ICC 2020 - 2020 IEEE
International Conference on Communications (ICC), Dublin, Ireland, 2020, pp.
1-6. doi: 10.1109/ICC40277.2020.914917
QUALITY-OF-SERVICE PROVISIONING FOR SMART CITY APPLICATIONS USING SOFTWARE-DEFINED NETWORKING
In the current world, most cities have WiFi Access Points (AP) in every nook and corner. Hence upraising these cities to the status of a smart city is a more easily achievable task than before. Internet-of-Things (IoT) connections primarily use WiFi standards to form the veins of a smart city. Unfortunately, this vast potential of WiFi technology in the genesis of smart cities is somehow compromised due to its failure in meeting unique Quality-of-Service (QoS) demands of smart city applications. Out of the following QoS factors; transmission link bandwidth, packet transmission delay, jitter, and packet loss rate, not all applications call for the all of the factors at the same time. Since smart city is a pool of drastically unrelated services, this variable demand can actually be advantageous to optimize the network performance. This thesis work is an attempt to achieve one of those QoS demands, namely packet delivery latency. Three algorithms are developed to alleviate traffic load imbalance at APs so as to reduce packet forwarding delay. Software-Defined Networking (SDN) is making its way in the network world to be of great use and practicality. The algorithms make use of SDN features to control the connections to APs in order to achieve the delay requirements of smart city services. Real hardware devices are used to imitate a real-life scenario of citywide coverage consisting of WiFi devices and APs that are currently available in the market with neither of those having any additional requirements such as support for specific roaming protocol, running a software agent or sending probe packets. Extensive hardware experimentation proves the efficacy of the proposed algorithms
- âŠ