Cloud networking mean field games

Ahmed Farhan Hanif, Hamidou Tembine, Mohamad Assaad, Djamal Zeghlache

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we analyze a distributed resource sharing problem for cloud networking. Each user would like to maximize a given payoff based on its demand and the total demand on the cloud. The problem is formulated as a game where the action of each player is represented by its requested demand. We develop a distributed algorithm for each node which only requires mean demand from the cloud to update its respective demand, thus reducing overhead. We also prove the convergence of our algorithm to Nash equilibrium. For large scale systems, we analyze the performance for 'selfish' and 'social' user strategies with symmetric price, and present a non feedback based distributed algorithm. We compare the performance of our algorithm with existing algorithms. Finally we present numerical results which compares the convergence of feedback vs non feedback algorithms.

Original languageEnglish (US)
Title of host publication2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings
Pages46-50
Number of pages5
DOIs
StatePublished - 2012
Event2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Paris, France
Duration: Nov 28 2012Nov 30 2012

Publication series

Name2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings

Other

Other2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012
CountryFrance
CityParis
Period11/28/1211/30/12

Keywords

  • Cloud Networking
  • Mean field game
  • Resource Sharing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'Cloud networking mean field games'. Together they form a unique fingerprint.

Cite this