• 검색 결과가 없습니다.

"Analysis of Handover Latency for Mobile IPv6 and mSCTP"

N/A
N/A
Protected

Academic year: 2021

Share ""Analysis of Handover Latency for Mobile IPv6 and mSCTP""

Copied!
8
0
0

로드 중.... (전체 텍스트 보기)

전체 글

(1)

©

I

EEE.

Per

sonal

use

of

t

hi

s

mat

er

i

al

i

s

per

mi

t

t

ed.

However

,

per

mi

ssi

on

t

o

r

epr

i

nt

/

r

epubl

i

sh

t

hi

s

mat

er

i

al

f

or

advert

i

si

ng

or

pr

omot

i

onal

pur

poses

or

f

or

cr

eat

i

ng

new

col

l

ect

i

ve

wor

ks

f

or

r

esal

e

or

r

edi

st

i

but

i

on

t

o

ser

ver

s

or

l

i

st

s,

or

t

o

r

euse

any

copyr

i

ght

ed

component

of

t

hi

s

wor

k

i

n

ot

her

wor

ks,

must

be

obt

ai

ned

f

r

om

t

he

I

EEE.

(2)

Papers by Workshop

Papers by Workshop

Workshop WS7: IP Mobility Management and

Architecture - 2008 IPMMA

Hybrid Robust Header Compression in Proxy Mobile IPv6

over Wireless Mesh Networks

S. Pack, J.-C. Lee and J.-S. Park

Analysis of Handover Latency for Mobile IPv6 and mSCTP

D. P. Kim and S. J. Koh

P-HIP: Paging Extensions for Host Identity Protocol

S. Yang, Y. Qin, H. Luo and H. Zhang

Micro-HIP A HIP-Based Micro-Mobility Solution

J. Y. H. So and J. Wang

Balanced Topology Constructions in the NEMO

L.-S. Li and L.-K. Kang

Optimized Mobile MPLS

S. Wang, Y. Cui, S. Das and M. Xu

An Architecture for Resource Management in IMS Wireless

Access Networks

J. W. Floroiu, M. Corici, S. Arbanowski, B.-J. Lee, S. Lee and X. Liu

Click on title for a paper.

Main Menu

Workshops

(3)

Analysis of Handover Latency for

Mobile IPv6 and mSCTP

Dong Phil Kim

Department of Computer Science Kyungpook National University

Daegu, Korea [email protected]

Seok Joo Koh

Department of Computer Science Kyungpook National University

Daegu, Korea [email protected] Abstract—This paper analyzes the handover latency of Mobile IP

and mobile SCTP over IPv6 networks. The analytical results are compared with performance by experiment over Linux testbed. For the analysis, we consider the two handover scenarios: horizontal handover and vertical handover. From the results, we see that the mSCTP handover can provide smaller handover latency than the Mobile IP. Moreover, the mSCTP can give much smaller handover latency for the vertical handover where has enough sojourn time of MN in the overlapping region between different subnet regions, compared to the horizontal handover.

Keywords-component; Handover Latency, Linux, Mobile IPv6, mSCTP

I. INTRODUCTION

At the time of the fixed-mobile convergence toward all-IP networks, the IP mobility has been focused in the next-generation wireless mobile networks that include WLAN and Cellular systems [1-3]. One of the essential issues for IP mobility is IP handover to provide a seamless handover for a mobile node that moves across the different IP subnet regions while its sessions are active. Seamless handover can be achieved by minimizing handover latency and data losses.

Until now, several approaches have been proposed to support IP mobility. Among them, the Mobile IP (MIP) [4-5] has been regarded as a typical solution for IP handover in the network layer, whereas the mobile Stream Control Transmission Protocol (mSCTP) [6-8] was suggested for IP handover in the transport layer. MIP can provide location management and handover management for terminal mobility in the network layer, whereas mSCTP can be used to support the end-to-end IP handover with the help of the multi-homing feature in the transport layer. In this paper, we will consider the MIPv6 rather than the fast handover for MIPv6 (FMIPv6) [9] which will be for further study.

In this paper, we analyze the handover latency of MIP and mSCTP over IPv6 networks theoretically with the two handover scenarios: horizontal handover for single-homed Mobile Node (MN) and vertical handover for dual-homed MN. The analyzed values are then compared with the results by the experiments. For the experimental analysis, we construct a small testbed based on the existing implementation codes [16] for MIPv6. In case of the mSCTP handover, w modified the

existing mSCTP handover supporting system made in [17], which allows the MN to automatically perform the mSCTP handover.

This paper is organized as follows. Section 2 describes the background and related works on MIP and mSCTP. In Section 3, we theoretically analyze the handover latency of MIP and mSCTP over IPv6 networks. Section 4 discusses experimental results on MIP and mSCTP handovers. Section 5 finally concludes this paper.

II. RELATED WORKS

In terms of Mobile IP, Lee et al. [10] analyzes the handover latency of MIPv6 by investigating the factors concerned with handover latency. They insist that the time taken for MN to detect its movement and address configuration is dominated into the main part of total MIPv6 handover latency. Nicolas et al. [11] has evaluated the handover latency of MIPv6 over IEEE 802.11 wireless networks and compared the layer 2 delays with layer 3 delays. In this work, it is concluded that the handover latency could be considerably reduced by using the anticipation of link layer trigger. On the other hand, Hernandez et al. [12] identifies limitations of MIP in terms of throughput, handover and packet loss at different velocities of MN.

The study of mSCTP performance has also made recently. The work in [13] analyzes the mSCTP handover latency for vertical handover through some experiments. The work in [14] has analyzed that the handover latency for horizontal handover with two different movement patterns (specifically, linear and cross movement pattern). The work in [15] discusses mSCTP handover, which is called SIGMA. This work compares the performance for SIGMA and MIPv6 in terms of handover latency.

This paper provides the analytical comparison of MIPv6 and mSCTP handover latency. We will first analyze the performance of MIPv6 and mSCTP with respect to the handover latency by considering the two different scenarios: horizontal handover for single-homed MN and vertical handover MN for dual-homed MN handover. The analytical values will be compared with the experimental results. For experimentations, we used the recently released version of MIPv6 2.0.2 [16] and also implemented the mSCTP handover scheme.

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 workshop proceedings.

(4)

III. ANALYSIS OF HANDOVER LATENCY For analysis, we consider the following two scenarios. Scenario A: Horizontal Handover

The horizontal handover indicates that the single-homed MN that activates only a single wireless network interface at a time moves within homogeneous networks. In this case, the link-up of a new link and the link-down of the old link will occur at the same time in the underlying link and network layers.

Scenario B: Vertical Handover

The vertical handover indicates that the dual-homed MN that uses the two different wireless network interfaces in the overlapping region moves across heterogeneous networks, as seen in the handover between 3G and WLAN. In particular, it is noted that the MN in this scenario can transmit and receive data packets by using two interfaces at the same time, in the overlapping region between different subnets.

In the analytical model, it is assumed that an MN moves from an IP subnet to the other one and it has the ability to detect the link-up and link-down events with the help of the underlying link layer.

For the analytical purpose, we will take the following considerations for handover of an MN:

a) An MN is able to send a RS message as soon as the

link-up event is detected;

b) Using the prefix information included in the RA

message, an MN can configure a new IP address (CoA) by using IPv6 stateless address auto configuration mechanism;

c) Once an MN completes its tentative IPv6 address via

IPv6 address auto configuration mechanism, it proceeds with the Duplicate Address Configuration (DAD) process so as to verify whether any other node on the local link has the same address;

d) For DAD process, only one Neighbor Solicitation

message is enough to confirm the uniqueness of the IPv6 tentative address;

e) For MIPv6, the Return Routability (RR) procedure is

used to support a secure communication between the MN and CN; and for mSCTP handover, the SCTP Address Configuration (ASCONF) chunks that are exchanged between the two endpoints for secure signaling are encapsulated with the suitable Authentication (AUTH) chunks.

In particular, we will make the following assumptions for vertical handover scenario:

a) The overlapping region between different subnets is

enough large and the sojourn time of MN in this region is at least more then the time taken until its ADD-IP operation.

b) Although an MN can use the two IP addresses in the

overlapping region, it is noted that the MN only uses the one address as the main address which is referred as the primary address.

Based on the assumptions made above, we will analyze the handover latency of MIPv6 and mSCTP.

A. Mobile IPv6 Handover Latency

Figure 1 depicts the overall latency of the MIPv6 handover.

Figure 1. mSCTP Handover Latency for Horizontal Handover

As seen in the figure, the overall MIPv6 handover latency for the horizontal handover scenario can be calculated as:

TΜΙΡ = TMIP + TAC + TBU (1)

In the equation, TMD is Movement Detection (MD) delay,

TAC is Address Configuration (AC) delay, and TBU is Binding

Update (BU) delay. The MD delay is the time taken for MN to detect its movement into a new subnet. The AC delay is the time required for MN to configure a new CoA using the prefix information contained in the RA message. The BU delay is the time taken for MN to register the new CoA with Home Agent (HA), to perform the RR test, and then to register with the CN.

It is noted that TMD could further be divided into the Layer

2 (L2) handover delay and Layer 3 (L3) MD delay. The L2 handover delay depends on the specific link layer technology and may be reduced as small as possible with a new access technology. By the way, the L3 MD delay may get larger in the network where an MN relies on RAs for movement detection. However, if an MN is able to send an RS as soon as it receives an L2 trigger from the lower layer, the MD delay will also be reduced considerably.

After the movement detection, an MN begins to configure a new CoA and performs the DAD process to confirm the uniqueness of IPv6 CoA address on the subnet. The AC delay

(TAC) can be calculated by summing up the times taken for

random waiting delay of an NS message (TRTR_SOL) and for the

DAD delay to wait a feedback from a neighboring node in the subnet (TDAD).

On completion of a new CoA configuration, the MN needs to register the CoA with the HA and CN. For this purpose, the MN will perform the RR test to ensure the secure communication between MN and CN. Accordingly, the binding update (BU) delay can be expressed as follows:

(5)

TBU = TBU-HA + TRR + TBU-CN (2)

Let us denote by DX•Y the one way transmission delay

between two nodes X and Y. Then, TBU-HA = DMN-HA + DHA-MN,

TRR = max [(DMN•HA + DHA-CN), DMN-CN] + max [(DCN-HA + D HA-MN), DCN-MN] = DMN-HA + DHA-CN + DCN-HA + DHA-MN (if DMN-HA

+ DHA-CN >DMN-CN), and TBU-CN = DMN-CN + DCN-MN.

By assumption of DX-Y = DY-X, we get TBU-HA = 2·DMN-HA,

TRR = 2 · (DMN-HA + DHA•CN), and TBU-CN = 2 ·DMN-CN.

Accordingly, the total BU delay is rewritten as

TBU = 2· (2·DMN-HA + DHA-CN+DMN-CN) (3)

In summary, the overall MIPv6 handover delay for the horizontal handover scenario, Equation (1) can be expressed as

Thandover_MIP = TMD + TAC +

2·(2·DMN•HA +DHA•CN+DMN•CN) (4)

On the other hand, Figure 2 depicts the handover latency of MIPv6 for the heterogeneous handover scenario.

Figure 2. MIPv6 Handover Latency for Vertical Handover

In the vertical handover scenario, it is noted that an MN can still communicate with the CN during the MD and AC periods in the new subnet, which is different from the horizontal handover scenario. Therefore, the MIPv6 handover latency can be reduced to the TBU, as seen in Figure 3.

That is, the overall MIPv6 handover latency in the heterogeneous handover scenario can be shown in Equation (5). TMIP = TBU = 2 · (2·DHA·MN + DHA·CN + DMN·CN) (5) B. mSCTP Handover Latency

We assume that the mSCTP uses the same MD and AC

schemes as the MIPv6 does. Now, let TmSCTP be the time taken

for the mSCTP handover signaling operations using the ASCONF chunks. Then, the overall handover latency of mSCTP can be expressed as:

Thandover_SCTP = TMD + TAC + TmSCTP (6)

Figure 3 depicts the delay components associated with the mSCTP handover latency for the horizontal handover scenario.

Figure 3. mSCTP Handover Latency for Horizontal Handover

In the horizontal handover scenario, the mSCTP handover delay includes the time for MN to perform the ‘ADD-IP’ and ‘Primary-Change (P-C)’ operations. That is, the mSCTP handover delay corresponds to the transmission delays taken to exchange the ASCONF and ASCONF-ACK chunks between MN and CN, as shown in Equation (7).

TmSCTP = TADD-IP + TP-C= 2 · (DMN·CN + DCN·MN) (7)

In the equation, it is noted that TADD-IP = DMN·CN + DCN·MN

and TP-C = DMN·CN + DCN·MN. In summary, the overall mSCTP

handover latency can be summarized as follows:

Thandover_mSCTP = TMD +TAC + 4·DMN·CN (8)

Figure 4 analyzes the overall mSCTP handover latency in vertical handover scenario.

Figure 4. mSCTP Handover Latency for Vertical Handover

In case of the vertical handover scenario, the total mSCTP handover latency only includes the time taken for MN to perform the ‘Primary-Change’ operation, because the MN is This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 workshop proceedings.

(6)

able to communicate with CN during the processes for the MD and AC and ADD-IP operation, as seen in Figure 4.

Accordingly, the overall latency of mSCTP handover for the vertical handover scenario can be summarized as follows: Thandover_mSCTP = 2·DMN·CN (9)

C. Comparison of mSCTP and MIPv6

Table 1 compares the handover latency required for mSCTP and MIPv6 handover.

From the table, it seems that the total handover latencies of MIP for two scenarios are larger than those of mSCTP approximately by 2·(2·DMN·HA + DHA·CN), which corresponds to

the binding update delay of MIPv6 through HA (i.e., binding update between HA and CN). This is because the MIPv6 handover operations are dependent on the binding update with HA.

TABLE 1 COMPARISON OF HANDOVER LATENCY OF MIP AND MSCTP

IV. EXPERIMENTAL RESULTS

This section describes the experimental results of the MIPv6 and mSCTP handover operations that are performed over Linux testbed.

A. Test Environment

To perform the experiments, we construct a small test network where consists of routers and hosts (MN and CN). In addition, the HA is installed for experimentation of MIPv6 handover. For MIPv6 handover, we installed the open source codes of MIPL 2.0.2 [16] on MN, CN and HA.

On the other hand, for experimentation of mSCTP handover, we modified the existing source codes in [17], which include the following four modules: Link Layer Information Monitoring (LLIM), Router Discovery (RD), Handover Decision (HOD), and Handover Execution (HOE). LLIM is used to gather the link layer information of wireless interfaces to achieve faster movement detection. RD is used to discover the new access router (AR) in the new subnet region. HOD is used to determine when to perform the Primary-Change operation using the received signal strength information. HOE is used to execute the mSCTP handover operations with the help of the SCTP kernel, which include the exchange of the mSCTP ASCONF and ASCONF-ACK chunks. Figure 5 shows the topology of our testbed network.

2001:220:0:10::/64 2001:220:0:1::/64 2001:220:0:2::/64 CN HA MN MN MN AP1 AP2 AR1 AR2 AR3

Figure 5. Test Network

As shown in the figure, the test network has three different subnets where consist of two IEEE 802.11(a) wireless networks (AR1 and AR2) and one wired network (AR3). An MN with the two wireless interfaces moves from the AR1 region to the AR2 region, whereas the CN is located in the AR3 region. The MIPv6 HA is embedded at the AR1.

B. Results and Discussions

Table 2 and 3 summarize the result of handover latency for MIPv6 and mSCTP in terms of associated delay components. Throughout the experiments, the MD delay is set to zero. The total MIPv6 and mSCTP handover latencies for the horizontal handover scenario are calculated by Equation (4) and (8), whereas the handover latencies for the vertical handover scenario are calculated by Equation (5) and (9), respectively.

TABLE 2 RESULTS OF HANDOVER LATENCY BY MIPV6

T AC T BU-HA T RR T BU-CN T MIP-horizontal T MIP-vertical Min 1.023 1.013 0.011 0.549 2.597 1.573 Max 1.894 1.101 0.026 0.981 3.715 2.109 Avg. 1.558 1.057 0.019 0.765 3.156 1.841

TABLE 3 RESULTS OF HANDOVER LATENCY BY MSCTP

TAC TADD-IP TP-C T mSCTP-horizontal T mSCTP-vertical Min 1.012 0.003 0.004 1.019 0.004 Max 1.945 0.062 0.070 2.077 0.070 Avg. 1.578 0.057 0.067 1.702 0.067

From the results, we can see that the mSCTP handover latency for the horizontal handover scenario is smaller than the MIPv6 handover latency approximately by 1 or 2 seconds. This is mainly because the MIPv6 binding update delays between HA and MN are relatively large, compared to the delays taken for the ADD-IP and Primary-Change operations of mSCTP handover. It is noted that the mSCTP ADD-IP and Primary-Change operations are completed within 70ms. In case of the vertical handover scenario, it is also shown that the mSCTP handover latency is smaller than the MIPv6 handover latency.

MIP mSCTP Horizontal Handover TMD +TAC + 2·(2·DMNHA+DHA·CN +DMN-CN) TMD +TAC + 4·DMN·CN Heterogeneous Handover 2·(2·DMN·HA+DHA·CN +DMN·CN) 2·DMN·CN

(7)

It is why mSCTP handover latency just including the delay taken for the ADD-IP operation in this case is much smaller than the MIPv6 handover latency including the binding update delays for the HA and CN.

Moreover, it is noted that the total MIPv6 and mSCTP handover latencies in the vertical handover scenario are much smaller than those by the horizontal handover scenario, because the data communication between MN and CN is maintained while the handover operations such as the address configuration and binding update or ADD-IP are performed.

On the other hand, Figure 6 show the experimental results of handover latency by the mSCTP for the horizontal and vertical handover scenarios, which was experimented on the small test environment.

0 1 2 3

0 1.2 2.4 3.6 4.8 6

Sojourn Time in overlapping region (sec)

H andov er L at enc y ( se c)

horizontal handover scenario vertical handover scenario

Figure 6 Experimental Result for Handover Latency

From the figure, it is shown that the total mSCTP handover latency in the horizontal handover scenario is being regular, whereas the handover latency in the vertical handover scenario is being reduced, as the sojourn time of an MN in the overlapping region between two subnets gets larger. This is mainly because the MN in the horizontal handover scenario can use the only one interface at a time so that it could not communicate with CN in the overlapping region during the handover operations, whereas in the vertical handover the data communication between MN and CN is maintained while the handover operations are performed, since the sojourn time in the overlapping region between two subnets gets larger.

More specifically, it is shown that the handover latency by two scenarios is approximately ‘2.4 (sec)’ when the sojourn time in the overlapping region is ‘zero’. This latency seems to be associated with the movement detection delay and address configuration delay as well as delays for mSCTP ADD-IP and Primary-Chang operations. We can also see that the total handover latency in the vertical handover scenario becomes nearly ‘zero’ after the sojourn time of approximately ‘2.4 (sec)’ in the overlapping region.

From the experimental results, it is noted that the handover latency in the vertical handover scenario is much smaller than that by the horizontal handover scenario when the sojourn time in overlapping region between two subnets is enough large. In particular, we can also see that these empirical results are nearly similar to the theoretical analysis of the handover latency for the horizontal and vertical handover scenarios.

V. CONCLUSIONS

In this paper, we analyzed the handover latency of MIPv6 and mSCTP for the horizontal handover and vertical handover scenarios. We compared the analytical values with results obtained by the experiments performed over a real test network. For MIPv6, we used the open source code of MIPL 2.0.2, whereas we modified the existing system supporting mSCTP handover on MN for the experiment of mSCTP handover.

From the results, it is noted that the mSCTP could provide smaller handover latency than the MIPv6. Moreover, the mSCTP in the vertical handover scenario could provide smaller handover latency than that by the horizontal handover scenario when the sojourn time in the overlapping region between two subnets are enough large. In particular, we also saw that these empirical results are nearly similar to the theoretical analysis of the handover latency.

ACKNOWLEDGMENT

This research was supported by the MIC of Korea, under the ITRC support program supervised by the IITA (IITA-2008-C1090-0801-0026).

REFERENCES

[1] Lin Y-B. and Chlamtac I., Wireless and Mobile Network Architecture, John Wiley & Sons, Inc., 2001.

[2] Evans B. G. and McLaughlin S., “Visions of 4G,” IEE Electronics & Communication Engineering Journal, December 2000.

[3] Ala-Laurila J. et al., “Wireless LAN Access Network Architecture for Mobile Operators,” IEEE Communication Magazine November 2001. [4] Perkins, C., et al., IP Mobility Support for IPv4, IETF RFC 3344,

August 2002.

[5] Johnson, D., et al., Mobility Support in IPv6, IETF RFC 3775, June 2004.

[6] Stewart R., et al., Stream Control Transmission Protocol, IETF RFC 2960, October 2000.

[7] Stewart, R., et al., Stream Control Transmission Protocol (SCTP) Dynamic Address Reconfiguration, IETF Internet Draft, draft-ietf-tsvwg-addip-sctp-18.txt, February 2007.

[8] Koh, S., et al, "mSCTP for Soft Handover in Transport Layer," IEEE Communications Letters, Vol. 8, No.3, pp. 189-191, March 2004. [9] Koodli R, et al., Fast Handovers for Mobile IPv6, IETF RFC 4068, July

2005.

[10] Lee, J., et al., “Analysis of Handoff Delay for Mobile IPv6,” IEEE Communications Letter, Vol. 4, pp. 2967-2969, September 2004. [11] Nicolas, M., et al, “Analysis and Evaluation of Mobile IPv6 Handovers

over Wireless LAN,” Vol. 8, No. 6, pp. 643-653, December 2003. [12] Hernandez E., et al., “Examining Mobile IP Performance in Rapidly

Mobile Environments: The Case of a Commuter Train,” in Proc. Of 26th IEEE Local Computer Networks (LCN’01), pp. 365-372, Feb., 2001. [13] Koh, S., et al., "mSCTP for Vertical Handover between Heterogeneous

Networks," LNCS 3597, pp. 28-36, July 2005.

[14] Kim, D., et al. "Analysis of SCTP Handover by Movement Patterns," LNCS 3645, Vol. 3545, pp. 521-529, August 2005.

[15] Sivaqurunathan S., et al., “Experimental Comparison of Handoff Performance of SIGMA and Mobile IP,” High Performance Switching and Routing, 2005 Workshop, pp. 366-370, May 2005.

[16] MIPL Mobile IPv6 for Linux, available from

http://www.mipl.mediapoli.com.

[17] Kim D., et al., “mSCTP-DAC: Dynamic Address Configuration for mSCTP Handover,” LNCS 4096, pp. 244-253, August 2006.

(8)

수치

Figure 1 depicts the overall latency of the MIPv6 handover.
Figure 3 depicts the delay components associated with the  mSCTP handover latency for the horizontal handover scenario
Table 1 compares the handover latency required for  mSCTP and MIPv6 handover.
Figure 6 Experimental Result for Handover Latency

참조

관련 문서

The second method is for compensation thermal expansion offering pre-load assembling that the temperature change by the repetitive movement and the friction

The Korean Voluntary Effort to Increase Their Airpower During the Korean War - With Special Reference to the National Fundraising Movement for Aircraft in

The present work considers the effect of different system parameters (orifice diame- ter, orifice number and spacing between orifices) on bubble for- mation, bubble

contest-based and ( ).. Sport for all movement 4.. 사회체육, 생활체육, 평생체육.. Sport for all movement.. 2) 선진국의 사회체육 표어.. Recreation for

대한의사협회 회원자율징계제도에 회원자율징계제도에 대한 대한 토론회 토론회 개최하 개최하 여 여 전문가단체의 전문가단체의 회원징계제도에 회원징계제도에 대한

The index is calculated with the latest 5-year auction data of 400 selected Classic, Modern, and Contemporary Chinese painting artists from major auction houses..

1 John Owen, Justification by Faith Alone, in The Works of John Owen, ed. John Bolt, trans. Scott Clark, "Do This and Live: Christ's Active Obedience as the

In this study, the different codes were compared and analyzed for the research on decontamination and decommissioning waste generation by using the codes