Front Inner Page - Volume 3 No.6 December 2016

  • » Back to Index

  • Title

    :

    Enhancing Load Sharing (Elshare) Method In Mobile Cloud Computing Environment

    Authors

    :

    A.Mumtaj1, Dr.S.Srinivasan2

    Keywords

    :

    Mobile cloud Computing, Nash equilibrium, load sharing, auction theory, bandwidth distribution.

    Issue Date

    :

    December 2016

    Abstract

    :

    With uptrend of smartphones and an increasing number of services are provided by cloud computing. In mobile cloud computing (MCCs), a mobile user is integrated with a cloud server through a network gateway. The quality-of-service (QoS) is an essential factors for the cloud providers success in mobile cloud computing. The network gateway is responsible for providing required QoS to the users. By increasing load in one gateway, the sharing of load among all the gateways is one of the better solutions for providing QoS-guaranteed services to the mobile users. When a mobile device changes its location from one place to another, the interfacing gateway also changes. After the change of location of a user, the current interfacing gateway may go through with additional service load and also node mobility causes rapid changes in network topology. The major aspect of cloud computing atmosphere is the load sharing. The load sharing needs to do properly because if any one of the node gets failed, leads to data unavailability. In order to overcome these drawbacks, Enhancing Load Sharing (ELShare) method and find its ideal solution using auction theory is proposed. In ELShare, the overloaded gateway detects the misbehaving gateways and prevents them from participating in the auction process. It characterises both the problem and solution approaches in MCC environment. Then analyse the essential of Nash Equilibrium and elongated the solution for the multiple users by theoretical analysis. In order to give safe and secure operation, firewall and access control are used here. Finally, Numerical analysis establishes the correctness of the proposed algorithms.

    Page(s)

    :

    1-7

    ISSN

    :

    2347- 4734

    Source

    :

    Vol. 3, No.6, December 2016

    Download

    :


  • » Back index