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
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
IEEE Communications Magazine
Simulation Study on Load Balanced Multiple Home Agents for Mobile IP Networks
DNIS '00 Proceedings of the International Workshop on Databases in Networked Information Systems
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 random, round-robin, and join the shortest queue (JSQ) selection policies, and timer-, counter- and threshold-based transfer policies.