Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
IP-based protocols for mobile internetworking
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
Routing in the Internet
Implementation of decentralized load sharing in networked workstations using the Condor package
Journal of Parallel and Distributed Computing
Second moment resource allocation in multi-service networks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Load-balancing heuristics and process behavior
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Route Optimization for Mobile IP
Cluster Computing
IEEE Communications Magazine
Design and analysis of a replicated server architecture for supporting IP-Host mobility
ACM SIGMOBILE Mobile Computing and Communications Review
Hi-index | 0.00 |
Mobility support in IP networks requires servers to forward packets to mobile hosts and to maintain information pertaining to a mobile host’s location in the network. In the mobile Internet Protocol (mobile-IP), location and packet forwarding functions are provided by servers referred to as home agents. These home agents may become the bottleneck when there are a large number of mobile hosts in the network. In this paper, we consider the design and analysis of a replicated server architecture in which multiple home agents are used to provide mobility support. In order to minimize the delay across the home agents, one of the key aspects is the design of load balancing schemes in which a home agent may transfer the control of a mobile host to another home agent in the same network. The methods for triggering the transfer and the policy for selecting the next home agent define various load balancing schemes which have different performance characteristics. In this paper, we design a protocol that forms the building block for implementing such load balancing schemes, and we then study the performance characteristics of three selection schemes, namely, random, round-robin, and join the shortest queue (JSQ), and three transfers policies, namely, timer-, counter- and threshold-based. The key results of this study are as follows: (1) The results show that both random and round-robin selection policies can yield modest load balancing gains, and that these gains increase when the traffic is more bursty (burstiness is defined as the ratio of the peak arrival rate to the mean arrival rate) as well as when there are more home agents. (2) The threshold-based transfer policy performs better than timer-based and counter-based policies, since in threshold-based policies transfers are made only when the queue is overloaded, unlike counter- and timer-based policies in which transfers can be made from an unloaded home agent to an overloaded home agent.