1. An Efficient Quorum-based Fault- Tolerant Approach for Mobility Agents in Wireless Mobile Networks Yeong-Sheng Chen Chien-Hsun Chen Hua-Yin Fang Department of Computer Science, National Taipei University of Education

2. Outline Introduction Related Work Cyclic Quorum-based Replication Mechanism Performance Evaluation Conclusion

3. Introduction Mobile IP Protocol is a protocol to support Hosts mobility. The architecture of mobile IP Mobile Host (Mobile Node) Mobility Agent Home Agent Foreign Agent

4. Introduction HA MN RAN Router Radio Access Network Home Agent

5. Introduction HA MN FA RAN Router Internet

6. Introduction HA MN FA FA 1 FA RAN Router Register HA allocates an address and maintains the MN A Router Internet Send data to A through HA and FA 1

7. MN Introduction HA FA RAN Router Request Care-of Address Allocate CoA or DHCP Tell HA stores MN ’ s CoA

8. MN Introduction HA FA RAN Router A A wants to send data to MN

9. Introduction In multiple mobility agents environment, data will be distributed stored in the different agent. Distributed data processing will cause some problem Fault tolerance Registration delay Load balance

10. Introduction HA MN FA HA crashed

11. Introduction To offer solutions to these problems, many fault-tolerant approaches have been proposed.

12. R. Ghosh and G. Varghese, “ Fault-Tolerant Mobile IP, ” Technical Report WUCS-98- 11, Washington Univ., Apr. 1998. Related Work- FTMIPP HA A FA RAN Router Registration request Acquire Home Address under HA Update HA ’ s bindings

13. Related Work- FTMIPP The drawback of FTMIPP Long registration time Low resource utilization Conclusion Use fully redundant mobile agent to solve fault tolerant problem

14. Related Work J. W. Lin and J. Arul, “ An Efficient Fault-Tolerant Approach for Mobile IP in Wireless Systems, ” IEEE Transactions on Mobile Computing, VOL. 2, NO. 3, Jul.-Sep. 2003.. HA A FA Search MNs Response Request to store the bindings OA&M (Operation Administration and Maintenance ) Detect failed Manage the region belong to HA

15. Related Work HA A FA Request to Restore OA&M HA recovered

16. Related Work The drawback of the scheme Spend extra time on Searching MNs Delivering bindings Extra hardware cost

17. Goal The backup mechanism should maintain and backup bindings efficiently should not bring heavy system load should balance Many researches use quorum-based mechanisms to backup data in distributed systems.

18. Cyclic Quorum-based Replication Mechanism Assumption Not all HAs of a quorum in a home network will fail at the same time. Whenever a HA crashes, any data in the volatile media of the HA will be gone The failure occurs in the network only by reason of the faulty HA The home network will divide into several network segments and each HA will take charge of one of the segments.

19. Cyclic Quorum-based Replication Mechanism To balance the backup load, the author uses quorum to achieve the goal Per-allocate the storage place with location by using quorum

20. Cyclic Quorum-based Replication Mechanism Cyclic Quorum-based could balance the load 1 N N-1 ….. 4 2 3 123

21. Cyclic Quorum-based Replication Mechanism Quorum typeQuorum proposed Quorum Size VotingWeighted Majority Hierarchical Quorum Consensus GridRectangular Grid N=R*CN=R*C Square Grid Triangular Grid Tree CycleCircle M. J. Yang, Y. M. Yeh, and Y. M. Chang, “ Legion Structure for Quorum-Based Location Management in Mobile Computing, ” Journal of Information Science and Engineering, Vol. 20, pp. 191-202, 2004.

22. Cyclic Quorum-based Replication Mechanism 1 N N-1 ….. 4 2 3 There are N HAs in the networks and N distinct quorum According to Cyclic Quorum, each HAs need backup bindings of other HAs

23. Cyclic Quorum-based Replication Mechanism Example: There are 8 MAs in the network The Quorum sets ={Q 1,Q 2,Q 3 ….,Q 8 } Ex. Q 1 ={HA 1,HA 2,HA 3 }, Q 2 ={HA 2,HA 3,HA 4 }, Q 3 ={HA 3,HA 4,HA 5 }, …… Q 8 ={HA 8,HA 1,HA 2 } HA 1 selects Q 1, HA 2 selects Q 2 …………,HA N selects Q N 1 2 3 4 5 6 7 8

24. Cyclic Quorum-based Replication Mechanism 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 Q1Q1 Q2Q2 Q3Q3 Q4Q4 Q5Q5 Q6Q6 Q7Q7 Q8Q8

25. HA 1 stores in 3 quorums EX. HA 1 stores in {Q 1,Q 7,Q 8 } for backup 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 Q7Q7 Q8Q8 1 2 3 4 5 6 7 8 Q1Q1

26. Cyclic Quorum-based Replication Mechanism HA 1 MN RAN Router HA 7 HA 8 HA 1 will sends the bindings to HA 7 and HA 8 periodly

27. Cyclic Quorum-based Replication Mechanism If HA 1 failed, HA 7 and HA 8 will takeover the member of HA 1 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 Q1Q1 Q7Q7 Q8Q8

28. Cyclic Quorum-based Replication Mechanism If HA 1 recovers, HA 7 and HA 8 will sends the bindings to HA 1 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 Q1Q1 Q7Q7 Q8Q8

29. Performance Evaluation Simulator :QualNet Compare with FTMIPP

30. Performance Evaluation Number of MNs Bindings per backup HA FTMIPP CQFTP

31. Performance Evaluation Number of MNs Extra Backup Message FTMIPP CQFTP

32. Performance Evaluation Number of Multiple HAs Number of registered MN per Backup HA 9 16 25 36 49 64 81 FTMIPP CQFTP

33. Performance Evaluation Number of Multiple HAs 2 4 6 8 10 12 14 16 18 20 Average Registration Delay (Sec) FTMIPP CQFTP

34. Performance Evaluation Average Registration Delay (Sec) Mobility Rate FTMIPP CQFTP

35. Conclusion The authors proposed a mechanism Don ’ t need any extra hardware cost Reduce backup bindings by using the small quorum size Balance the load of take over process Low registration overhead