跳到主要內容

臺灣博碩士論文加值系統

(3.236.124.56) 您好!臺灣時間:2021/07/31 04:16
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:方華音
研究生(外文):Hua-Yin Fang
論文名稱(外文):A Cyclic Quorum-based Replication Mechanism for Fault-Tolerant Support in Mobile IP Networks
指導教授:陳永昇陳永昇引用關係
指導教授(外文):Yeong-Sheng Chen
學位類別:碩士
校院名稱:國立臺北教育大學
系所名稱:資訊科學系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:中文
外文關鍵詞:Mobile IPFault-TolerantQuorumMobility Agent
相關次數:
  • 被引用被引用:0
  • 點閱點閱:131
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
In Mobile IP protocol, the Home Agents (HAs) is responsible for recording the location information and forwarding the datagram for the roamed Mobile Nodes (MNs). Besides, it also enables the MNs to maintain continuous data connectivity without interruption while changing locations. If a single HA fails, the MNs served by it are not able to accept the datagram. Therefore, in some researches, the mechanisms with multiple Mobility Agents (MAs) are proposed for solving the fault-tolerant problem. However, most existing fault-tolerant protocols for the mobility agents will increase the time of registration process and need much system resource. To cope with this problem, in this thesis, we use the set system of quorum size . In a mobility system with redundant HAs, we propose an efficient cyclic-quorum-based fault-tolerant protocol and group all HAs into N quorums in a network with N HAs imposing logical circular structure. In the proposed protocol, every HA has backup quorums and divides the network that it manages into equal parts. According to the home address of the MN, each HA finds out the backup quorum in the network segment and stores the mobility bindings of the MN in backup HAs. When a HA crashes, the system will select the HA with minimum load from each backup quorum for taking over the bindings of the faulty HA respectively. In comparison with previous related works, our experimental results show that the proposed fault-tolerant protocol has many advantages: better system load balance, less latency for registration process, less system resource requirements, and no extra hardware cost.
Abstract
Table of Contents
List of Tables
List of Figures
Chapter 1. Introduction
1.1 Motivation and Purposes
1.2 Organization of the Thesis
Chapter 2. Background and Related Works
2.1 Mobile IP Overview
2.1.1 Terminologies
2.1.2 Operation of Mobile IP
2.2 Fault Tolerance of Redundant Agents
2.3 Replication Mechanism – Quorum Systems
Chapter 3. The Proposed Approach
3.1 System Architecture
3.2 Assumptions and Problem Definitions
3.3 Cyclic Quorum-based Replication Mechanism for multiple Home Agents
3.3.1 Cyclic Quorum Scheme
3.3.2 Backup Quorum and Backup Home Agent
3.3.3 Backup Quorum Management
3.4 The Maintenance and Backup of the Extendeded Binding
3.5 Failure Detection and Takeover
3.6 Failure Recovery
Chapter 4. Performance Evaluation
4.1 Overhead in different number of MNs
4.2 Overhead in different number of multiple HAs
4.3 Registration delay in different mobility rates
Chapter 5. Conclusions
References
[1]3GPP TR 23.922: Architecture for an All IP Network, 1999.
[2]A. Kumar, “Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data,” IEEE Transactions on Computers, Vol. 40, Issue 9, pp. 996-1004, Sep. 1991.
[3]A. Kumar, M. Robinovich, and R. K. Sinha, “A Performance Study of a New Grid protocol and General Grid Structures for Replicated Data,” Tech. Report 93-03-02, Department of Computer Science and Engineering, University of Washington, Mar. 1993.
[4]A. Vasilache, J. Li, and H. Kameda, “Load balancing policies for multiple home agents mobile IP networks,” 2nd International Conference on Web Information Systems Engineering, pp.178-185, 2001.
[5]B. Sarikaya, “Packet Mode in Wireless Networks: Overview of Transition to Third Generation,” IEEE Communications Magazine, Vol. 38, No. 9, pp. 164-172, Sep. 2000.
[6]C. E. Perkins, “IP Mobility Support,” IETF RFC 2002, Oct. 1996.
[7]C. E. Perkins, “IP Mobility Support for IPv4,” IETF RFC 3220, Jan. 2002.
[8]C. Graff, M. Bereschinsky, M. Patel, and L. F. Chang, “Application of Mobile IP to Tactical Mobile Internetworking,” Military Communication Conference, Vol. 2, pp. 409-414, 1998.
[9]C. H. Cho and J. T. Wang, “Triangular Grid protocol: An Efficient Scheme for Replica Control with Uniform Access Quorums,” Theoretical Computer Science, Vol. 196, pp. 259-288, Apr. 1998.
[10]C. H. Cho and S. H. Lin, “Cyclic Spring Protocol - A Quorum-based Approach Replica Control,” http://hdl.handle.net/2377/2909, Oct. 2006
[11]C. M. Lin, G. M. Chiu, and C. H. Cho, “A new quorum-based scheme for managing replicated data in distributed systems,” IEEE Transactions on Computers, Vol. 51, pp. 1442-1447, 2002.
[12]D. Agrawal and A. El Abbadi, “An Efficient and Fault-tolerant Solution for Distributed Mutual Exclusion,” ACM Transactions on Computer Systems, Vol. 9, No. 1, pp. 1-20, Feb. 1991.
[13]D. Agrawal and A. El Abbadi, “The Generalized Tree Quorum Protocol: An efficient approach for managing replicated data,” ACM Transactions on Database Systems, Vol. 17, Issue 4, pp. 689~717, Dec. 1992.
[14]D. K. Gifford, “Weighted Voting for Replicated Data,” Proceedings of the 7th ACM Symposium on Operating System Principles, pp.150-159, Dec. 1979.
[15]H. Ahn and C. S. Hwang, “Low-Cost Fault-Tolerance for Mobile Nodes in Mobile IP Based Systems,” 15th International Parallel and Distributed Processing Symposiums, pp. 508-513, 2001.
[16]I. H. Bae, “A quorum-based dynamic location management method for mobile computings,” in Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications (RTCSA), 1999, pp. 398-401.
[17]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.
[18]J. H. Ahn and C. S. Hwang, “Efficient Fault-Tolerant Protocol for Mobility Agents in Mobile IP,” Proceedings of the 15th International Parallel and Distributed Processing Symposiums, pp. 1273 -1280, Apr. 2001.
[19]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.
[20]M. Naor and A. Wool, “Access control and signatures via quorum secret sharing,” IEEE Transactions on Parallel and Distributed Systems, Vol. 9, pp. 909-922, 1998.
[21]M. Rabinovich and E. D. Lazowska, “An Efficient and Highly Available Read-One Write-All Protocol for Replicated Data Management,” in Proceedings of the Second International Conference on Parallel and Distributed Information Systems, pp. 56-65, Jan. 1993
[22]P. A. Bernstein, V. Hadzilacos, and N. Goodman. “Concurrency Control and Recovery in Database Systems,” http://research.microsoft.com/users/philbe/ccontrol/, 1987.
[23]P. J. McCann and T. Hiller, “An Internet Infrastructure for Cellular CDMA Networks Using Mobile IP,” IEEE Personal Communications, Vol. 7, No. 4, pp. 26-32, Aug. 2000.
[24]R. Ghosh and G. Varghese, “Fault-Tolerant Mobile IP,” Technical Report WUCS-98-11, Washington Univ., Apr. 1998.
[25]R. H. Thomas, “A majority Consensus Approach to Concurrency Control for Multiple Copy Databases,” ACM Transactions on Database Systems, Vol. 4, No. 2, pp. 180-209, Jun. 1979.
[26]R. Jimenez-Peris, M. Patino-Martinez, G. Alonso, and B. Kernme, “How to Select a Replication Protocol According to Scalability, Availability and Communication Overhead,” in Proceedings of 20th IEEE Symposium on Reliable Distributed Systems, pp. 24-33, 2001
[27]R. Mistry, P. Savill, and A. Tofanelli, “OA&M for Full Services Access Networks,” IEEE Communications Magazine, pp. 70-77, Mar. 1997.
[28]S. Fujita, M. Yamashita, and T. Ae, “Distributed k-mutual exclusion problem and k-coteries,” Proceedings of the 2nd International Symposium on Algorithms, Vol. 557, pp. 22-31, 1991.
[29]S. Khurana, A. Kahol, S. K. S. Gupta, and P. K. Srimani, “An Efficient Cache Maintenance Scheme for Mobile Environment,” 20th International Conference on Distributed Computing Systems, pp. 530 -537, 2000.
[30]S. T. Huang, J. R. Jiang, and Y. C. Kuo, “K-coteries for fault-tolerant k entries to a critical section,” Proceedings of the 13th IEEE International Conference on Distributed Computing Systems, pp. 74-81, 1993.
[31]S. Y. Cheung, M. H. Ammar, and M. Ahamad, “The Grid Protocol: A High Performance Scheme for maintaining Replicated Data,” IEEE Transactions on Knowledge and Data Engineering, Vol. 4, Issue 6, pp. 582-592, Dec. 1992.
[32]W. Luk and T. Wong, “Two New Quorum Based Algorithms for Distributed Mutual Exclusion,” In the 17th International Conference on Distributed Computing Systems, pp. 100-106, 1997.
[33]W. Simpson, “IP in IP tunneling,” IFTF RFC 1853, 1981.
[34]W. K. Ng and C. V. Ravishankar, “Coterie templates: a new quorum construction method,” Proceedings of the 15th IEEE International Conference on Distributed Computing Systems, pp. 92-99, 1995.
[35]Y. C. Kuo and S. T. Huang, “A geometric approach for constructing coteries and k-coteries,” IEEE Transactions on Parallel and Distributed Systems, Vol. 8, Issue 4, pp. 402-411, Apr. 1997.
[36]Y. Mun, Y. Kim, Y. J. Kim, and G. Hwang, “IP Mobility Support over Wireless ATM,” IEEE International Conference on Communications, pp. 319-323, 1999.
[37]Y. T. Wu, Y. J. Chang, S. H. Yuan, and H. K. Chang, “A New Quorum-Based Replica Control Protocol,” in Proceedings. Pacific Rim International Symposium on Fault-tolerant System, pp. 116-121, Dec. 1997.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top