Global dynamic load-balancing for decentralised distributed simulation

Bragard, Quentin; Ventresque, Anthony; Murphy, Liam

doi:10.1109/wsc.2014.7020207

Cited by 6 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Load changing is the most direct strategy for scaling out an application server establishment. If one server is over-trouble then the requesting are sent to another server to process with more prominent breaking point The inspiration driving burden changing is to upgrade the execution of a framework through a legitimate dispersal of the heap to the entire network [7]. A general meaning of this issue is given as takes after: for the given broad number of occupations, we ought to streamline the framework in perspective of load (e.g.…”

Section: Load Balancing Techniquementioning

confidence: 99%

Eslba Load Sharing Technique for Reputation Manager in Multiple Gateways

Antony¹,

Victor²

2018

IJET

View full text Add to dashboard Cite

Every node has the states of its neighbors such as Selfish, Unselfish and No Information state. The selfish node free path is constructed by avoiding selfish node in the route discovery process. Watch Dog mechanism helps to avoid such issues. Price and Reputation system (P&RS) helps to diminish the selfish nodes in a successful manner. Trustable node with low portability will go about as a Notoriety Manager and it keeps every one of the records of every node in a record system. The overload of RA leads to various problem and makes the communication very slow. In this paper we discuss about the RA affiliation and request in various possible ways. RA sends the affiliation to the nearest relay node to act as a RA for few nodes. Moreover we discuss the RA communication with Internet through Gateways and the load balancing algorithm – Energy Share Load Balancing Algorithm (ESLBA). The heap adjusting algorithm shares the heap between the nodes and channelizes the ideal course smarterly.

show abstract

Section: Load Balancing Techniquementioning

confidence: 99%

Eslba Load Sharing Technique for Reputation Manager in Multiple Gateways

Antony¹,

Victor²

2018

IJET

View full text Add to dashboard Cite

show abstract

“…The average time taken for a packet or the data to be transmitted across a network from source to the destination is called as the end-to-end delay [2]. …”

Section: End To End Delaymentioning

confidence: 99%

“…Load balancing is the most straightforward method of scaling out an application server infrastructure. If one server is overloaded then the requests are forwarded to another server to process with more capacity The purpose of load balancing is to improve the performance of a network through an appropriate distribution of the load to the entire network [2]. A general formulation of this problem is given as follows: for the given large number of jobs, we must optimize the network based on load (e.g.…”

Section: Load Balancingmentioning

confidence: 99%

“…Other than ECGT various algorithms like random and scheduling algorithm are being used to balance the load in the network [2,9]. In random load balancing algorithm the jobs are assigned to the nodes in the random or blind manner.…”

Section: Performance Analysis Of Ecgtmentioning

confidence: 99%

“…If the waiting time of the job is high then the energy is wasted. By conserving the energy the node life time can be increased so that the node can assign more jobs to other nodes [2].…”

Section: A Waiting Time Of Job In Queuementioning

confidence: 99%

See 2 more Smart Citations

Enhanced load balancing scheme in MANET by using Co-Operative Game Theory approach

Loganathan

Sathyaseelane

Ranjithkumar

et al. 2015

2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS)

View full text Add to dashboard Cite

MANETS are randomly distributed self configurable networks used in an ad-hoc fashion. Due to its increasing network data, load balancing becomes an unmanageable aspect in these networks. Various load balancing techniques though have been proposed; Random, Scheduling and Evolutionary load balancing models differentiates and allocates the load into different levels, providing a maximum network manageable load and non-distortable nodes in the network. Game Theory too is being stormed in QoS parameters like throughput and delay when handling a maximized load. We propose an Enhanced Co-Operative Game Theory (ECGT) based random stage based algorithm for load balancing to save the node from distortion at an earlier stage and can able to reduce the network delay. This co-operative random scalable GT minimizes the loss factor. Besides, an distributed Nash equilibrium approach, we can determine the amount of load the network can handle before it actually reaches the lowest level.Keywords-load balancin g , Manet, ECGT, Nash equilibrium, contention ener g y aware routin g , super nodes I.

show abstract