Advertisement

Cluster Computing

, Volume 1, Issue 2, pp 249–260 | Cite as

Design and analysis of a replicated server architecture for supporting IP–host mobility

  • Jason P. Jue
  • Dipak Ghosal
Article

Abstract

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.

Keywords

Packet Delay Mobile Host Home Agent Foreign Agent Home Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Deering, ICMP router discovery message, RFC 1256 (September 1991).Google Scholar
  2. [2]
    D. Eager, E. Lazowska and J. Zahorjan, Adaptive load sharing in homogeneous distributed systems, IEEE Trans. Software Engineering 12 (1986) 662-675.Google Scholar
  3. [3]
    W. Fischer and K. Meier-Hellstern, The Markov-modulated Poisson process (MMPP) cookbook, Performance Evaluation 18 (1992) 149-171.CrossRefGoogle Scholar
  4. [4]
    A. Giovanardi and G. Mazzini, Transparent mobile IP: an approach and implementation, in: IEEE GLOBECOM' 97, Pheonix, AZ (November 1997).Google Scholar
  5. [5]
    C.-J. Hou and K.F. Shin, Implementation of decentralized load sharing in networked workstations using the Condor package, Journal of Parallel and Distributed Computing 40(2) (1997) 173-184.CrossRefGoogle Scholar
  6. [6]
    C. Huitema, Routing in the Internet(Prentice-Hall, Englewood Cliffs, NJ, 1995).Google Scholar
  7. [7]
    J. Ioannidis, D. Duchamp and G.Q. Maguire Jr., IP-based protocols for mobile internetworking, in: ACM SIGCOMM' 91(September 1991).Google Scholar
  8. [8]
    E.W. Knightly, Second moment resource allocation in multi-service networks, in: 1997 ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS' 97), Seattle, WA (June 1997).Google Scholar
  9. [9]
    LAN Emulation SWG Drafting Group, LAN emulation over ATM: draft specification - revision 2, ATM Forum/94-0035R2+ (April 15, 1994).Google Scholar
  10. [10]
    W.E. Leland and T.J. Ott, Load-balancing heuristics and process behavior, in: Proceedings of Performance' 86 and ACM SIGMETRICS' 86, Raleigh, NC (May 1986).Google Scholar
  11. [11]
    R. Mirchandaney, D. Towsley and J.A. Stankovic, Analysis of the effect of delays on load sharing, IEEE Transactions on Computers 38(11) (1989) 1513-1525.CrossRefGoogle Scholar
  12. [12]
    C.E. Perkins, Mobile IP, IEEE Communications Magazine 35(5) (1997) 84-99.CrossRefGoogle Scholar
  13. [13]
    C.E. Perkins and D.B. Johnson, Route optimization in mobile-IP, draft-IETF-mobileip-optim-06.txt (July 1997).Google Scholar
  14. [14]
    K.C. Sevcik, Priority scheduling disciplines in queueing network models for computer systems, in: Proc. IFIP Congress(North-Holland, Amsterdam, 1977).Google Scholar
  15. [15]
    W.R. Stevens, TCP/IP Illustrated, Vol. 1: The Protocols(Addison-Wesley, Reading, MA, 1994).Google Scholar
  16. [16]
    A.N. Tantawi and D. Towsley, Optimal static load balancing in distributed computer systems, Journal of the ACM 32(2) (1985) 445-465.zbMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Jason P. Jue
    • 1
  • Dipak Ghosal
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of CaliforniaDavisUSA
  2. 2.Department of Computer ScienceUniversity of CaliforniaDavisUSA

Personalised recommendations