Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Architecture and Algorithms for Real-Time Mobility Management 59architecture is the core of the proposed model. It gives a faster parallel processing forthe mobile users.The scheduling and assignment algorithm is optimal for different number of processorswith different speeds. This achievement is something new compare to actualreal-time multiprocessor scheduling and assignment algorithms. In the current algorithms,the processors must have the same speed to guarantee an optimal schedulingand assignment.Many investigations are on going in real-time mobility management for Mobile IPnetworks. The areas cover the implementation of real-time algorithms in real networksas well as proposition of new algorithms and architectures. Also, since thecurrent protocols are designed for micro-mobility, the WAN and global roaming areasare some new domains of interest.References1. Akyildiz I. F., McNair J., Ho J. S. M., Uzunalioglu H., Wang W.: Mobility Managementin Next-Generation Wireless Systems, Proceedings of the IEEE, vol. 87, no. 8, pp. 1347-1384, Aug. 1999.2. Chrishna C.M., Kang G. S.: Real-Time Systems, McGraw Hill, 1997.3. D. B. Johnson, C. Perkins: Mobility support in IPv6, Inter-net Engineering Task Force,Internet draft, draft-ietf-mobileip-ipv6-22.txt, May 2003.4. James D. S.: Mobile IP, The Internet Unplugged, Prentice Hall PTR, 1998.5. P. Calhoun, C. Perkins: Tunnel establishment protocol, Internet Engineering Task Force,Internet draft, draft-ietf-mobileip-calhoun-tep-01.txt, March 1998.6. Perkins C.: IP Mobility Support, Internet Engineering Task Force, RFC 2002, Oct. 1996.7. Perkins C. and Johnson D. B.: Route Optimization in Mobile IP, Internet EngineeringTask Force, Internet drafts, draft-ietf-mobileip-optim-11.txt, Sept. 2001.8. Perkins C.: Minimal Encapsulation within IP, Internet Engineering Task Force, RFC2004, Oct. 1996.9. R. Caceres and V. Padmanabhan: Fast and scalable handoffs for wireless networks, inProc. ACM/IEEE MOBICOM’96, pp.56–66.