Investigations into micromobility issues in IP networks

INVESTIGATIONS INTO MICROMOBILITY ISSUES IN IP NETWORKS AURBIND SHARMA NATIONAL UNIVERSITY OF SINGAPORE 2005 INVESTIGATIONS INTO MICROMOBILITY ISSUES IN IP NETWORKS BY AURBIND SHARMA A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE SCHOOL OF COMPUTING NATIONAL UNIVERSITY OF SINGAPORE 2005 To My Father This is as far as I could go Acknowledgements Several people have contributed valuable help, guidance and inspiration during my work Without them, this work would not be possible I would first like to thank my supervisor, A/P A L Ananda, for his guidance, support and encouragement Thank you professor, for teaching me how to think and evolve ideas to solution I cannot thank you enough for all that you have done for me I must also express my sincere thanks to Dr Chan Mun Choon for his inputs during different phases of my work All my colleagues at CiRL, Sridhar K N “Sarkaar”, Venkatesh Obanaik, Aseem Tandon, Wu Xiuchao and Shao Tao, who made CiRL a great place to work Thank you for being constant anchors and truest of friends Last, but not the least, I must thank my family My wife Meenakshi, who has always stood by me in the toughest of times and my son Aadeesh, who has always managed to make me smile i Table of Contents Introduction 1.1 State of the Art 1.1.1 Third Generation Systems 1.1.2 Standardization Bodies 1.1.3 Internet Mobility Proposals 1.1.4 A Look into the Future Problem Description 1.2.1 Some Definitions 1.2.2 Design Choices and Requirements 11 1.2.3 Objective and Scope of work 15 1.3 Thesis Contributions 16 1.4 Thesis Organization 16 1.2 Background Work 17 2.1 Macromobility Proposals 17 2.1.1 Mobile IP and its variants 17 2.1.2 Application Layer Mobility 20 2.1.3 Transport Layer Mobility 21 ii 2.2 Micromobility Proposals 22 2.2.1 Per-host routing 22 2.2.2 Multi CoA, hierarchical tunnelling 24 2.3 Other proposals 26 2.4 A generic micromobility model 26 Auto-update Micromobility Protocol 32 3.1 Micromobility Requirements 32 3.1.1 Design Principles 34 3.2 Architecture 36 3.3 Basic Ideas 37 3.3.1 IPv6 Aggregatable Global Unicast Address (AGUA) 37 3.3.2 Auto-update 38 3.3.3 Addressing 40 3.3.4 Mobility Management 40 Protocol Details 45 3.4.1 Protocol Parameters 45 3.4.2 Router Advertisement 46 3.4.3 Correspondent Node Algorithm 46 3.4.4 Mobile Node Algorithm 47 Securing AUM 48 3.5.1 Introduction 48 3.5.2 Operation 48 Summary 49 3.4 3.5 3.6 iii Performance Evaluation of AUM 51 4.1 Related Work 51 4.2 Simulation 53 4.2.1 Constant Bit Rate UDP Traffic 55 4.2.2 TCP Performance 56 Testbed Implementation 57 4.3.1 IP mobility Testbed @ CiRL 57 4.3.2 Implementation Details 58 4.3.3 UDP performance 60 4.3.4 TCP Performance 63 4.3.5 Results Summary 66 Summary 67 4.3 4.4 Reverse ICMP Redirect 70 5.1 Introduction 70 5.2 Motivation 70 5.3 Reverse-ICMP Redirect 71 5.4 Discussion 74 Conclusions and Future Work 76 6.1 Completed Work 77 6.2 Future Work 78 Bibliography 79 Appendix 86 iv A Appendix I 87 A.1 Mobility Models 87 A.1.1 Random Walk Mobility Model 88 A.1.2 Fluid Flow Mobility Model 89 A.2 Calculation of the Cost Functions 90 A.2.1 Location update cost 90 A.2.2 Packet Delivery Cost 93 B Appendix II 96 B.1 Papers published related to thesis v 96 List of Figures 1.1 UMTS Network Components 1.2 Various wireless technologies with their bit-rates and suitability for users moving at different speeds 1.3 Next generation network vision 1.4 Mobility between heterogenous access networks 11 2.1 Overview of Mobile IPv6 18 2.2 Micromobility Classification 23 2.3 A generic micromobility model 28 3.1 AUM Architecture 36 3.2 AGUA Format 37 3.3 Auto-update algorithm 38 3.4 The auto-update mechanism 39 3.5 Message flow 41 3.6 Special mode 42 3.7 Normal mode 43 3.8 CN states 46 vi 3.9 MN state machine 47 3.10 Message Exchange for Security Scheme 50 4.1 ns-2 modifications 53 4.2 Simulation setup 54 4.3 CBR packet loss 55 4.4 Time-sequence graph for TCP 56 4.5 CiRL Mobility Testbed 58 4.6 Testbed setup 59 4.7 UDP Packet Loss 61 4.8 Buffer size for various transmission rates 62 4.9 Packet Loss for VIC 62 4.10 Average Throughput for TCP New Reno 65 4.11 TCP sequence trace for AUM 68 4.12 TCP sequence trace for AUM (with FRTO) 69 5.1 First and Second Movement in R-ICMP-R 72 5.2 Third Movement in R-ICMP-R 73 5.3 Reverse ICMP Redirect message exchange 74 A.1 Hexagonal cellular architecture 88 A.2 State diagram for random walk model 89 vii [34] F Vakil, A Dutta, et al, Host Mobility Management Protocol, IETF Draft, Work in Progress [35] E Wedlund, H Schulzrinne, Mobility support using SIP, Proceedings of Second ACM International Workshop on Wireless Mobile Multimedia, ACM/IEEE, August 1999, pp 76-82 [36] A Dutta, F Vakil, et al, Application Layer Mobility Management Scheme for Wireless Internet, in Proceedings 3Gwireless 2001,(San Francisco), pp 7, May 2001 [37] G Su and J Nieh, Mobile Communication with Virtual Network Address Translation, Department of Computer Science, Columbia University, Technical Report CUCS0032, Feb 2002 [38] M Borella, J Lo, et al, Realm Specific IP: Framework, IETF RFC 3102, October 2001 [39] D Maltz, P Bhagwat MSOCKS: an architecture for transport layer mobility, Proceedings of INFOCOM ’98, April 1998, SanFrancisco, CA [40] G Kirby Locating the user, In Communication International, 1995 [41] A T Campbell, J Gomez, et al Design, Implementation and Evaluation of Cellular IP, IEEE Personal Communications, Special Issue on IP-based Mobile Telecommunications Networks, June 2000 [42] R Ramjee, T La Porta, S Thuel, K Varadhan, L Salgarelli HAWAII: A Domainbased Approach for Supporting Mobility in Wide-area Wireless Networks, IEEE/ACM Transactions on Networking (TON), Volume 10, Issue 3, June 2002, pp 396 - 410 [43] R Ramjee, et al, IP micro-mobility support using HAWAII, IETF draft, Work in Progress, December 1999 [44] E Gustafsson, A Jonsson, and C Perkins Mobile IP Regional Registration, Internet draft, draft-ietf-mobileip-reg-tunnel-04.txt, March 2001 work in progress 82 [45] H Haverinen and J Malinen, Mobile IP Regional Paging, Internet draft, drafthaverinen-mobileip-reg-paging- 00.txt, work in progress, June 2000 [46] C Castelluccia and H Soliman et al Hierarchical Mobile IPv6 Management, IETF Internet Draft, draft-ietf-mipshop-hmipv6-03.txt, October 2004, Work in Progress [47] A Misra, S Das, A McAuley, A Dutta, S K Dutta IDMP: an intradomain mobility management protocol for next-generation wireless networks, IEEE Wireless Communications, June 2002, pp 38 [48] S Das, A Misra, P Aggarwal, S K Dass TeleMIP: Telecommunication Enhanced Mobile IP Architecture for Fast Intra-Domain Mobility, IEEE Personal Communication Systems Magazine, Vol 7, No 4, pp 50-58, August 2000 [49] A Misra, S Das, A McAuley and S K Das Autoconfiguration, registration, and mobility management for pervasive computing, IEEE Personal Communications, vol 8, no 4, August 2001, pp 24 - 31 [50] A Mihailovic et al., Multicast for Mobility Protocol, in Proceedings of 11th IEEE Conference on Personal, Indoor and Mobile Radio Communications (PIMRC 2000), Sept 2000 [51] F M Chiussi, A D Khotimsky, S Krishnan, A Network Architecture for MPLS-Based Micro-Mobility, WCNC 2002 - IEEE Wireless Communications and Networking Conference, vol 3, no 1, March 2002, pp 473 - 479 [52] R Hinden, S Deering and E Nordmark IPv6 Global Unicast Address Format, IETF RFC 3587, August 2003 [53] IPv6 Address Allocation and Assignment Policy, ripe-267, January 2003 http:// www.ripe.net/ripe/docs/ipv6policy.html [54] P Reinbold et al., A Survey of IP Micromobility Protocols, Technical Report, INFONET http://www.infonet.fundp.ac.be 83 [55] A T Campbell, Gomez, J., et al, Comparison of IP Micro-Mobility Protocols, IEEE Wireless Communications Magazine, Vol 9, No 1, February 2002 [56] R Caceres, V N Padmanabhan, Fast and Scalable Handoffs for Wireless Internetworks, in Proceedings ACM Mobicom, 1996 [57] R Caceres and V.N Padmanabhan, Fast and Scalable Wireless Handos in Support of Mobile Internet Audio, ACM MONET Journal, Vol 3, No 4, December 1998 [58] H Balakrishnan, S Seshan, R Katz, Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks, ACM Wireless Networks 1(4), December 1995 [59] S Seshan, H Balakrishnan, R H Katz, Handoffs in Cellular Wireless Networks: The Daedalus Implementation and Experience, Kluwer International Journal on Wireless Communication Systems, January 1997 [60] B R Badrinath, A Bakre, T Imielinski, R Marantz, Handling Mobile Clients: A Case for Indirect Interaction, in Proc IEEE Fourth Workshop on Workstation Operating Systems, Aigen, Austria, October 1993 [61] R Caceres, L Iftode, Improving the Performance of Reliable Transport Protocols in Mobile Computing Environments, IEEE J Select Areas Commun, Vol 13, No 5, June 1995 [62] R Yavatkar, N Bhagawat, Improving End-to-End Performance of TCP over Mobile Internetworks, in Proc Workshop on Mobile Computing Systems and Applications (Mobile ’94), December 1994 [63] J A Cobb, P Agrawal, Congestion or Corruption? A Strategy for Efficient Wireless TCP Sessions, 1st IEEE Symposium on Computers and Communications (ISCC ’95), Alexandria, Egypt, June 1995 84 [64] A Bakre, B Badrinath, I-TCP: Indirect TCP for Mobile Hosts, Technical Report DCSTR- 314, Dept Computer Science, Rutgers University, October 1994 [65] E Amir, H Balakrishnan, S Seshan, R H Katz, Efficient TCP over Networks with Wireless Links, in Proc Fifth Workshop on Hot Topics in Operating Systems (HotOSV), Orcas Island, WA, May 1995 [66] H Balakrishnan, V N Padmanabhan, S Seshan, R H Katz, A Comparison of Mechanisms for Improving TCP Performance over Wireless Links, IEEE/ACM Trans on Networking, December 1997 [67] SCP - Secure Copy Protocol [68] VIC - Videoconferencing Tool, http://www-mice.cs.ucl.ac.uk/multimedia/ software/vic/ [69] Mobiwan - NS-2 Extensions to study mobility in Wide-Area IPv6 Networks http: //www.inrialpes.fr/planete/mobiwan/ [70] The Network Simulator - ns-2 http://www.isi.edu/nsnam/ns/ [71] Singapore Advanced REsearch Network, www.singaren.net.sg [72] 6Wind www.6wind.com [73] MIPL - Mobile IPv6 for Linux, www.mobile-ipv6.org [74] J Ousterhout, Tcl and the Tk Toolkit, Addison-Wesley, ISBN 0-201-63337-X, May 1998 [75] R Ludwig , R H Katz, The Eifel algorithm: making TCP robust against spurious retransmissions, ACM SIGCOMM Computer Communication Review, Vol.30 No.1, January 2000 [76] P Sarolahti, M Kojo, F-RTO: A TCP RTO Recovery Algorithm for Avoiding Unnecessary Retransmission, IETF Internet Draft, February 2004 85 [77] J Postel, INTERNET CONTROL MESSAGE PROTOCOL, DARPA INTERNET PROGRAM PROTOCOL SPECIFICATION, IETF RFC 792, September 1981 [78] A Sharma, A L Ananda, A Protocol for Micromobility Management in Next Generation IPv6 Networks, in proceedings of ACM MobiWac 2004 (Workshop at Mobicom 2004), October 2004, Philadelphia 86 A Appendix I In this chapter, we investigate the performance of AUM and HMIPv6 by using the well known Fluid Flow and Random Walk mobility models We evaluate the performance in terms of location update cost and packet delivery cost Our main focus of the analysis, however, will be on processing costs One of the obvious advantages of using auto-update mechanism in AUM is that it enables end-to-end location management in micromobility environments This reduces the per-packet processing requirement at the access network Unless when an MN is performing a handoff, packets arrive at topologically correct address in AUM, and hence require no special handling In case of HMIPv6, a per-packet/per-MN processing is necessitated at the Mobility Anchor Point (MAP) All the packets arriving at MAP (typically situated at the border router) are processed to determine the local address used by the MN inside the domain A.1 Mobility Models For our analysis we use a hexagonal cellular network architecture We assume that a micromobility domain consists of ring r(r ≥ 0) which is composed of 6r cells The innermost cell (labelled 0) is called the center cell The rings are formed around this central cell (labelled 87 Figure A.1: Hexagonal cellular architecture ‘1’, ‘2’ and so on) Therefore the number of cells upto the ring R is given by: R N(R) = 6r + = 3R(R + 1) + (A.1) r=1 Next we consider the two mobility models, namely, Random Walk and Fluid Flow mobility model These models have been extensively used in the literature to analyze the performance of mobility management schemes A.1.1 Random Walk Mobility Model The random walk mobility model has been extensively used to model pedestrian movements, with low mobility patterns For random walk model, we use a one-dimensional Markov chain model shown in Figure In this model, the next position of MN is equal to the previous position plus a random variable drawn from an arbitrary distribution The MN moves to a new cell with probability (1 - q) and the probability that it remains in the current cell is q For the hexagonal ring architecture assumed for our analysis, the MN moves to the next cell with a probability of 1/6 Also, the probability that a movement results in an 88 Figure A.2: State diagram for random walk model increase (p+ (r)) or decrease (p− (r)) from the center cell (labelled in Figure 1) is given by: p+ (r) = 1 + 6r (A.2) p− (r) = 1 − 6r (A.3) The state r of a Markov chain is defined as the distance between the current cell of the MN and the center cell This is equivalent to the index of the ring where MN is located Therefore, MN is in state r if it is currently in ring r We now calculate the transition probabilities representing the distance from the center cell increasing or decreasing when MN moves These transition probabilities are αr,r+1 and βr, r − respectively and given by: αr,r+1       (1 − q) =     (1 − q)( 31 + βr,r−1 = (1 − q)( 31 − A.1.2 if r=0 6r ) 6r ) if ≤ r ≤ R if ≤ r ≤ R Fluid Flow Mobility Model The fluid flow model is used to model scenarios with high mobility and static movement direction In this model, the direction of MN movement is uniformly distributed in the range of (0, 2π) If the average velocity of an MN is υ, and let Rc and Rd be the cell and domain crossing rates, we have: 89 Rc = ρ.υ.Lc /π (A.4) Rd = ρ.υ.L(R)/π (A.5) where, • Lc = Perimeter of cell • L(R) = Perimeter of domain consisting of R rings • ρ = MN density For the hexagonal architecture for our analysis, the perimeter of domain, L(R), can be obtained as: L(R) = × (2R + 1) × Lc /6 (A.6) A.2 Calculation of the Cost Functions We divide the total cost into location update cost and packet delivery cost The location update cost comprises of the updates sent to home agent (HA) and the local registrations performed by MN The packet delivery cost is made up of two components, the packet processing required at the domain node and the routing cost A.2.1 Location update cost Due to the similarity in the location update operation of HMIPv6 and AUM, the location update cost is almost similar both cases In both AUM and HMIPv6, a global binding update is issued whenever MN moves beyond the scope of domain For local movements inside the domain, HMIPv6 requires a local binding update with MAP while AUM requires a HandoffBegin-HandoffComplete operation with HM Therefore we consider these two kinds of location updates: the global binding update (Cg ) and the local binding update (Cl ) A global binding update is issued whenever MN 90 enters a HMIPv6/AUM domain This event occurs only once as long as MN stays in the same domain In this update, MN informs its HA of its RCoA/Informed Address Hereafter, as MN moves inside the MAP domain, it obtains a new LCoA/Current Address at each new point of attachment and registers this address with MAP/HM This is the local binding update Denoting the MAP or HM by Packet Redirection Point (PRP), Cg and Cl can be obtained as shown below: Cg = 2(κ + τ(DPRP−AR + DHA−PRP )) + 2NCN (κ + τ(DPRP−AR + DPRP−CN )) +PC HA + NCN PCCN + PC PRP Cl = 2.(κ + τ.DPRP−AR ) + PC PRP where, • κ - Unit transmission costs in a wired network • τ - Unit transmission costs in a wireless network • DPRP−AR - Distance between PRP and AR (in hops) • DHA−PRP - Distance between HA and PRP (in hops) • DPRP−CN - Distance between PRP and CN (in hops) • NCN - Number of CN’s communicating with MN • PCHA - Processing cost at HA • PCCN - Processing cost at CN • PCPRP - Processing cost at PRP Random Walk Model In the random walk model, the probability that an MN performs a global binding update is as follows: πR,R αR,R+1 91 For the domain architecture shown in Figure , if the MN is located in ring R, and it performs a movement from ring R to R+1, it performs a global binding update For movements inside the ring, MN performs local binding update Therefore the location update cost per unit time can be expressed as: Clocation = (πR,R αR,R+1 ) Cg + (1 - πR,R αR,R+1 ) Cl / T where T is the average cell residence time Fluid Flow Model The cell crossing rate (Rc ) and domain crossing rate (Rd ) for the fluid flow model were obtained in section 1.2 Using these terms, the location update cost can be obtained as: Clocation = Rd Cg + (NAR Rc - Rd ) Cl / ρ A(R) where A(R) refers to the area of the domain Let Ac be the area of a cell Therefore, A(R) = NAR Ac ; NAR is the number of AR in the domain Discussion In the previous subsections, we derived the location update cost for HMIPv6 and AUM The results suggest that the location update cost is related to the average cell residence time In fact, the location update cost is inversely proportional to the average cell residence time As the average cell residence time increases, MN spends longer time in the cell and performs fewer handoffs For the random walk model, the probability that MN stays in the current cell is q (section 1.1) Therefore, MNs with higher value of q refer to hosts exhibiting low mobility The size of the domain also has an effect on the location update cost For smaller domain size, the MN will perform global updates at much higher rate, increasing the overall cost In the case of Fluid flow model, the user velocity impacts the location update cost For MN with higher average velocity, larger location update costs will be incurred (increasing the Rc ) Similar to the case of random walk model, the size of the domain will also have 92 an effect on the location update cost, with smaller domain size resulting in frequent global updates A.2.2 Packet Delivery Cost The packet delivery cost consists of the processing requirements at HA, MAP/HM and the transmission cost A fundamental difference between HMIPv6 and AUM packet processing mechanism is that HMIPv6 requires packet processing for every packet arriving in the domain This is so because each incoming packet needs to be mapped to the current LCoA of the MN MAP maintains a table which contains the binding between RCoA and LCoA A table lookup cost is incurred for each packet arriving at MAP In contrast, packet arrive at topologically correct address in AUM and not need any participation by HM, except when the MN is performing a handoff To understand the performance improvements due to this, we discuss the packet delivery cost in this section Let the average number of users residing in the coverage of an AR be K Then the total number of users in the domain is obtained as: N MN = NAR × K We define the total packet delivery cost as follows: For HMIPv6, C packet = C MAP + CHA + CT and, For AUM, C packet = CHM + CHA + CT where C MAP , CHM and CHA denote the processing costs at MAP, HM and HA respectively CT denotes the packet transmission cost from CN to MN The values of CHA and CT are the same for both HMIPv6 and AUM, since both assume the use of HA for first packet redirection and the transmission cost is independent of the protocol 93 HMIPv6 In HMIPv6, the processing requirement at MAP, CMAP , can be divided into the lookup cost (Clookup ) and routing cost (Crouting ) The lookup cost depends on the size of the table The table contains one entry for each MN located in the domain, hence the table size is proportional to the number of MNs We assume the routing cost to be proportional to the logarithmic of the number of ARs in the domain We can now define CMAP as follows: C MAP = λ s S (Clookup + Crouting ) = λ s S (αN MN + β log(NAR )) where, λ s = Session arrival rate and S = Average session size (in packets) AUM In AUM, the lookup cost is incurred only for the fraction of packets arriving in the handoff duration The packets arriving in the remaining (non-handoff) duration not need special handling by the HM Let s’ be the number of packets, out of S , that arrive during the handoff duration Then, CHM can be calculated as: CHM = λ s s’ (α N MN + β log(NAR ) + (S - s’) (βlog(NAR )) CHA and CT The processing cost at HA can be calculated as: CHA = λ s θHA where, θHA refers to the unit packet processing cost at HA This cost is incurred for each new session arrival at HA, hence the λ s appears in the product The packet transmission cost (CT ) is associated with the distance between two network entities We use the notion of number of hops in IP network to represent the distance The 94 CT can be calculated as follows: CT = τ.λ s ((S − 1).(DCN−HM + D MAP−AR ) +(DCN−HA + DHA−HM + DHM−AR )) +κλ s S Discussion We derived the packet processing cost for HMIPv6 and AUM in previous subsections In the C MAP derived for HMIPv6 in section 2.2.1, C MAP increases linearly with the increase in the number of MNs (N MN ) in the domain For bigger domain size, the packet delivery increases sharply with the increase in N MN This suggests that it is important to reduce the packet delivery cost for scalable services The C MAP obtained for HMIPv6 is even higher than Mobile IPv6 with route optimization (because there is no processing requirement at the domain node) In the AUM packet processing cost (CHM ) derived in section 2.2.2, the term N MN appears with s’, which represents the fraction of packets that arrive during handoff Therefore, CHM depends on the mobility of MN, rather than number of MNs in the domain In case MNs exhibit significant mobility, majority of its packets arrive during the handoff duration (i.e., s’ ↑) Therefore, effect of both mobility and user population can be investigated with the help of CHM 95 B Appendix II B.1 Papers published related to thesis • Aurbind Sharma, A L Ananda, “A Protocol for Micromobility Management in Next Generation IPv6 Networks”, in proceedings of ACM MobiWac 2004 (Workshop at Mobicom 2004), October 2004, Philadelphia • Aurbind Sharma, A L Ananda, “AUM: Auto-update Micromobility for IPv6 Networks”, in proceedings of IEEE ICCCN 2004, October 2004, Chicago • Aurbind Sharma, A L Ananda, “AUM - An IPv6 based Approach for Micromobility”, in proceedings of IEEE LCN 2004, November 2004, Florida 96 [...]... Access Internet Infrastructure HM Handoff Manager HMIPv6 Hierarchical Mobile IPv6 ICMP Internet Control Message Protocol IPv6 Internet Protocol version 6 ix IPSEC IP Security MIP Mobile IP MIPv6 Mobile IPv6 MN Mobile Node RIR Reverse ICMP Redirect SCP Secure Copy TCP Transmission Control Protocol UDP User Datagram Protocol VIC Video-conferencing tool WLAN Wireless Local Area Network x Summary Mobile IP, ... considerations: This includes the wide range of access technologies available and being standardized and the challenge of integrating them over a common IP based core • Internet protocol considerations: With IPv4 fast running out of address space, IPv6 will play a key role in future networks However, the migration towards IPv6 has not yet taken off in a big way and both IPv4 and IPv6 will need to be... smooth operation of the Internet It is open to any interested individual The actual technical work of the IETF is done in its working groups, which are organized by topic into several areas (e.g., routing, transport, security, etc.) Much of the work is handled via mailing lists The IETF holds meetings three times per year Chapter 1 Introduction 6 The IETF working groups are grouped into areas, and managed... namely Mobile IPv6 [26], has also been proposed at IETF and has recently been standardized Mobile IPv6 borrows heavily from the concepts of its previous version Mobile IPv4 A similar trend is seen in the proposals for micromobility Amongst the most well known proposals for micromobility in IPv6 networks are HMIPv6 [46] and CIPv6 [28] A fundamental feature of micromobility protocols in IPv4 is the use... data and multimedia in a integrated environment The goals of the present stage of evolution of next generation networks like 3G and beyond remain common and include IP- based multimedia services, IP- based transport, and the integration of Internet Engineering Task Force (IETF) [4] protocols for such functions as wide-area mobility support (e.g., Mobile IP [1]), signaling (e.g., SIP [5]), and authentication,... agent However, in this case it will need one local IP address apart from the global fixed home Chapter 2 Background Work 19 address MN informs the HA about its CoA via a registration procedure called Binding Update Upon acquiring a CoA in the foreign domain, MN sends a Binding Update (BU) to its HA Upon reception of BU, HA sends a Binding Acknowledgement (BA) to MN and stores the hA↔CoA binding locally... MN) to the HA in a signaling message, and the reverse mapping is used by the tunnel from HA to FA Mobile IPv6 The IPv6 version of Mobile IP is currently being developed by IETF called Mobile IPv6 [26] IP mobility is a standardized part of IPv6 Thus, several features of IPv6 support and enhance the efficiency of Mobile IPv6 The optimizations proposed for Mobile IPv4 have been absorbed as integral part... classified as Macromobility or inter-domain mobility management and Micromobility or intra-domain mobility management solutions With the advent of IPv6, variants of schemes proposed for IPv4 have also been proposed 2.1 2.1.1 Macromobility Proposals Mobile IP and its variants Mobile IP Mobile IP [1] was proposed at IETF [4] and hence became the principal driver for IP mobility Since then, it has matured and evolved... forwards the actual inner packet to the MN Since MN and FA are in the same broadcast network, the destination IP remains as home address of the MN, and the forwarding is done at layer-2 The outer tunnel from HA to FA has the source IP of the HA and destination IP of the FA The same IP address of the FA can be used by any number of MN for tunneling In the absence of a FA in the visited network, the MN may use... data units are then transported, between the nodes in the segment, over another IP layer Alternatively, the end users IP packet may undergo regular IP forwarding based on the destination address, without involving other intermediate layers This case corresponds to deployment of IP in the native mode Obviously, the absence of intermediate protocol layers inherently implies a higher efficiency This also .. .INVESTIGATIONS INTO MICROMOBILITY ISSUES IN IP NETWORKS BY AURBIND SHARMA A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE SCHOOL OF COMPUTING NATIONAL... HM Handoff Manager HMIPv6 Hierarchical Mobile IPv6 ICMP Internet Control Message Protocol IPv6 Internet Protocol version ix IPSEC IP Security MIP Mobile IP MIPv6 Mobile IPv6 MN Mobile Node RIR... University replaces IP routing inside the micromobility domain to provide fast and seamless handoff Cellular IP integrates location management and routing by installing host-specific entries in all the