Cloud networking mean field games

Ahmed Farhan Hanif, Tembine Hamidou, 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 - Dec 1 2012
    Event2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Paris, France
    Duration: Nov 28 2012Nov 30 2012

    Other

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

    Fingerprint

    Feedback
    Parallel algorithms
    Large scale systems

    Keywords

    • Cloud Networking
    • Mean field game
    • Resource Sharing

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Software

    Cite this

    Hanif, A. F., Hamidou, T., Assaad, M., & Zeghlache, D. (2012). Cloud networking mean field games. In 2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings (pp. 46-50). [6483654] https://doi.org/10.1109/CloudNet.2012.6483654

    Cloud networking mean field games. / Hanif, Ahmed Farhan; Hamidou, Tembine; Assaad, Mohamad; Zeghlache, Djamal.

    2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings. 2012. p. 46-50 6483654.

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

    Hanif, AF, Hamidou, T, Assaad, M & Zeghlache, D 2012, Cloud networking mean field games. in 2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings., 6483654, pp. 46-50, 2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012, Paris, France, 11/28/12. https://doi.org/10.1109/CloudNet.2012.6483654
    Hanif AF, Hamidou T, Assaad M, Zeghlache D. Cloud networking mean field games. In 2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings. 2012. p. 46-50. 6483654 https://doi.org/10.1109/CloudNet.2012.6483654
    Hanif, Ahmed Farhan ; Hamidou, Tembine ; Assaad, Mohamad ; Zeghlache, Djamal. / Cloud networking mean field games. 2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings. 2012. pp. 46-50
    @inproceedings{b9de2c1b82e14040bd3a549a57325e87,
    title = "Cloud networking mean field games",
    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.",
    keywords = "Cloud Networking, Mean field game, Resource Sharing",
    author = "Hanif, {Ahmed Farhan} and Tembine Hamidou and Mohamad Assaad and Djamal Zeghlache",
    year = "2012",
    month = "12",
    day = "1",
    doi = "10.1109/CloudNet.2012.6483654",
    language = "English (US)",
    isbn = "9781467327985",
    pages = "46--50",
    booktitle = "2012 1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings",

    }

    TY - GEN

    T1 - Cloud networking mean field games

    AU - Hanif, Ahmed Farhan

    AU - Hamidou, Tembine

    AU - Assaad, Mohamad

    AU - Zeghlache, Djamal

    PY - 2012/12/1

    Y1 - 2012/12/1

    N2 - 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.

    AB - 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.

    KW - Cloud Networking

    KW - Mean field game

    KW - Resource Sharing

    UR - http://www.scopus.com/inward/record.url?scp=84876121781&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84876121781&partnerID=8YFLogxK

    U2 - 10.1109/CloudNet.2012.6483654

    DO - 10.1109/CloudNet.2012.6483654

    M3 - Conference contribution

    SN - 9781467327985

    SP - 46

    EP - 50

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

    ER -