Skip to main content
Log in

Modelling IP Mobility

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

We study a highly simplified version of the proposed mobility support in version 6 of Internet Protocols (IP). We concentrate on the issue of ensuring that messages to and from mobile agents are delivered without loss of connectivity. We provide three models, of increasingly complex nature, of a network of routers and computing agents that are interconnected via the routers: the first is without mobile agents and is treated as a specification for the next two; the second supports mobile agents, and the third additionally allows correspondent agents to cache the current location of a mobile agent. Following a detailed analysis of the three models to extract invariant properties, we show that the three models are related by a suitable notion of equivalence based on barbed bisimulation. Finally, we report on some experiments in simulating and verifying finite state versions of our model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Agha, I. Mason, S. Smith, and C. Talcott, “A foundation for actor computation,” Journal of Functional Programming, Vol. 7, No. 1, pp. 1–72, 1997.

    Google Scholar 

  2. R. Amadio and S. Prasad, “Modelling IP mobility,” in Proc. CONCUR98. Springer Lect. Notes in Comp. Sci., Vol. 1466, pp. 301–316, 1998.

  3. H. Bal, F. Kaashoek, and A. Tanenbaum, “Orca: A language for parallel programming of distributed systems,” IEEE Trans. on Soft. Eng., Vol. 21, No. 3, pp. 261–322, 1992.

    Google Scholar 

  4. D. Decouchant, “Design of a distributed object manager for Smalltalk-80 system,” in Proc. Object-Oriented Programming Systems, Languages and Applications.OOPSLA'86, ACM Press, 1986, pp. 444–452.

  5. G. Holzmann, Design and Validation of Computer Protocols, Prentice-Hall, 1991.

  6. K. Honda and M. Tokoro, “An object calculus for asynchronous communication,” in Proc.ECOOP91, Geneve. Springer Lect. Notes in Comp. Sci., Vol. 612, 1991, pp. 133–147.

  7. J. Ioannidis, D. Duchamp, and G. Maguire, “IP-based protocols for mobile internetworking,” in Proc. ACM SIGCOMM, 1991, pp. 235–245.

  8. D. Jackson, Y. Ng, and J. Wing, “A nitpick analysis of mobile IPv6,” Technical Report, Carnegie-Mellon University, 1997.

  9. D. Johnson and C. Perkins, “Mobility support in IPv6 (RFC 2002),”Version expiring May 1997, 1996. See also the updated Internet Draft with this title available at http://www.ietf.org/internet-drafts/draftietf-mobileip-ipv6-08.txt.

  10. E. Jul, H. Levy, N. Hutchinson, and A. Black, “Fine-grained mobility in the emerald system,” ACM Trans. on Comp. Sys., Vol. 6, pp. 109–133, 1988.

    Google Scholar 

  11. P. McCann and G.-C. Roman, “Mobile Unity coordination constructs applied to packet forwarding,” in Proc. Coordination 97. Springer Lect. Notes in Comp. Sci., Vol. 1282, 1997.

  12. P. Merlin and P. Schweitzer, “Deadlock avoidance in store-and-forward networks i: store-and-forward deadlock,” IEEE Trans. Communication, Vol. 3, pp. 345–354, 1980.

    Google Scholar 

  13. P. Merlin and P. Schweitzer, “Deadlock avoidance in store-and-forward networks ii: Other deadlock types,” IEEE Trans. Communication, Vol. 3, pp. 355–360, 1980.

    Google Scholar 

  14. R. Milner, J. Parrow, and D. Walker, “Acalculus of mobile processes,” Information and Computation, Vol. 100, No. 1, pp. 1–77, 1992.

    Google Scholar 

  15. J. Ousterhout, A. Cherenson, F. Douglis, M. Nelson, and B. Welch, “The sprite network operating system,” IEEE Computer, February 1988, pp. 23–36.

  16. D. Park, “Concurrency and automata on infinite sequences,” in Proc. Theor. Comp. Sci., Springer Lect. Notes in Comp. Sci., Vol. 104, pp. 167–183, 1981.

  17. G.-P. Picco, G. Roman, and P. McCann, “Expressing code mobility in mobile UNITY,” in Proc. 6th European Soft. Eng. Conf. and 5th ACM SIGSOFT Symp. on Foundations of Soft. Eng., Springer Lect. Notes in Comp. Sci., Vol. 1301, pp. 500–518, 1997.

  18. J. Piquer, “Indirect distributed garbage collection: Handling object migration,” Transactions on Programming Languages and Systems, Vol. 18, No. 5, pp. 615–647, 1996.

    Google Scholar 

  19. A. Pnueli, “Linear and branching systems in the semantics and logics of reactive systems,” in Springer Lect. Notes in Comp. Sci., Vol. 194, pp. 15–32, 1985.

    Google Scholar 

  20. G. Popek and D. Walker (Eds.), The Locus Distributed System Architecture, MIT Press, 1985.

  21. M.L. Powell and B.P. Miller, “Process migration in demos/mp,” in Proc. of the 9th ACM Symp. on Op. Sys. Principles, 1983, pp. 110–119.

  22. G. Roman, P. McCann, and J. Plun, “Mobile UNITY: Reasoning and specificaton in mobile computing,” ACM Transactions on Software Engineering and Methodology, Vol. 6, No. 3, pp. 250–282, July 1997.

    Google Scholar 

  23. F. Teraoka, K. Uehara, H. Sunahara, and J. Murai, “Vip: A protocol providing host mobility,” Comm. ACM, Vol. 37, No. 8, pp. 67–75, 1994.

    Google Scholar 

  24. P. Van Roy, S. Haridi, P. Brand, G. Smolka, M. Mehl, and R. Scheidhauer, “Mobile objects in distributed Oz,” Transactions on Programming Languages and Systems, Vol. 19, No. 5, pp. 804–851, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amadio, R.M., Prasad, S. Modelling IP Mobility. Formal Methods in System Design 17, 61–99 (2000). https://doi.org/10.1023/A:1008734618526

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008734618526

Navigation