Game Theoretic Iterative Partitioning for Dynamic Load Balancing in Distributed Network Simulation
Explore this paper's citation graph
Summary
This work proposes game theoretic partitioning algorithms based on the two cost criteria and proves the existence of stable Nash equilibria in pure strategies and demonstrates the performance of the partitioning algorithm on an optimistic discrete event driven simulation platform that models an actual parallel simulator.
- Type
- preprint
- Published
- 2011-11-03
- Cited by
- 3
- References
- 39
- Access
- Open access
- OpenAlex
- https://openalex.org/W39544418
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:16264877
Keywords
Computer science, Distributed computing, Load balancing (electrical power), Parallel computing, Mathematics
References
- Asynchronous distributed simulation via a sequence of parallel computations
- Forwarding devices: From measurements to simulations
- Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs
- Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down
- Optimization by Simulated Annealing
- Parallel simulation today
- DieCast: Testing Distributed Systems with an Accurate Scale Model
- Iterative partitioning scheme for distributed simulation of dynamic networks
- On distinguishing between Internet power law topology generators
- PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
- Parssec: A Parallel Simulation Environment for Complex Systems
- The scaling hypothesis: simplifying the prediction of network performance using scaled-down simulations
- On a parallel partitioning technique for use with conservative parallel simulation
- Distributed multi-agent optimization with state-dependent communication
- Graph annotations in modeling complex network topologies
- Purposeful mobility for relaying and surveillance in mobile ad hoc sensor networks
- Performance Analysis of Synchronized Iterative Algorithms on Multiprocessor Systems
- Graph partitioning using annealed neural networks
- Study of BGP Peering Session Attacks and Their Impacts on Routing Performance
- An efficient heuristic procedure for partitioning graphs
Cited by
Related papers
- Nature Inspired Load Balancing Algorithms- A Review
- A QoS Based Load Balancing Framework for Large Scale Elastic Distributed Systems
- A Clustered Approach for Load Balancing in Distributed Systems
- A load balancing model for grid environment
- A model for resource-aware load balancing on heterogeneous and non-dedicated clusters
- Load Balancing in Cloud Computing: A Simulation-Based Evaluation
- A review analysis on load balancing as a crust of cloud computing
- Load balancing mechanism using Mobile agents