• Title/Summary/Keyword: multihomed

Search Result 9, Processing Time 0.034 seconds

MIPv4/MIPv6 Mobility Simulation Model of the Multihomed Node (멀티홈드 노드의 MIPv4/MIPv6 이동성 시뮬레이션 모델)

  • Zhang, Xiaolei;Wang, Ye;Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.179-186
    • /
    • 2012
  • Nowadays, the multihomed host equipped with multiple network interfaces has been interested research in next generation wireless network, because the mobile users expect that they can be able to access services not only anywhere, at any time and from any network but also simultaneously. This paper addresses the mobility simulation model of the multihomed node for supporting MIPv4 and MIPv6 function in an interworking of Worldwide Interoperability for Microwave Access (WiMAX) and IEEE 802.11 WLAN. The multihomed node with two air interfaces has been developed based on WiMAX and WLAN workstation node model in simulation software. The main point of the developed model is to support both MIPv4 and MIPv6 function, and provide network selection policy for the multihomed node between WiMAX and WLAN network. Based on the received Router Advertisement along with the interface number, we can manage the access interfaces in ordered list to make handover decision while the multihomed node is moving. In the end of this paper, the simulation scenarios and results are shown for testing MIPv4 and MIPv6 function.

Immediate Multihoming Solution for UMTS and WLAN Interworking System

  • Li, Yang;Kum, Dong-Won;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1039-1049
    • /
    • 2008
  • Multihoming is an attractive feature for mobile nodes (MN) equipped with multiple network interfaces in a converged networking environment. However, the current standard Mobile IP (MIP) lacks support for multihomed MNs. Accordingly, this paper presents an immediate solution to resolve the problems of multihomed MNs in a UMTS and WLAN interworking system. The interworking system is based on a hierarchical architecture according to the UMTS and WLAN coverage characteristics. The MIP is only operated in the WLANs, and not in the UMTS, allowing the MIP to be used for multihomed MNs with minimal modifications. In addition, MIP binding filters are used to realize the advantages of multihoming, enabling different traffic flows to be transmitted simultaneously through different interfaces. The overall design aims to minimize the modification to the MIP and impact on existing UMTS and WLAN systems. We evaluate the performance of proposed scheme using an OPNET simulator.

Simulation model of a multihomed node with WiMAX and WLAN (WiMAX - WLAN 멀티홈드 노드의 시뮬레이션 모델)

  • Zhang, Xiao-Lei;Wang, Ye;Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.3
    • /
    • pp.111-119
    • /
    • 2010
  • With the rapid progress of wireless technologies today, mobile terminals with multiple access interfaces are emerging. In recent years, WLAN (Wireless Local Area Networks) has become the premier choice for many homes and enterprises. WiMAX (Worldwide Interoperability for Microwave Access) has also emerged as the wireless standard that aims to deliver data over long distances. Therefore, it is important to explore efficient integration methods for delivering multimedia data between heterogeneous wireless networks. In this paper, we developed the simulation models and environments for the mobile multihomed node that has both WiMAX and WLAN interfaces and can move around in both networks by using mobile IP. In order to verify the developed models, we designed and constructed several simulation scenarios, e.g. movement in WiMAX/WLAN, group mobility, MANET, and nested MIP under the various traffic environments such as oneway or bothway UDP packets, FTP traffic, and voice with SIP protocol. The simulation results show that the developed models are useful for mobility studies in various integrated wireless networks.

A Route Optimization Mechanism using an Extension Header in the IPv6 Multihoming Environment (IPv6 멀티호밍 환경에서 확장 헤더를 이용한 경로 최적화 메커니즘)

  • Huh, Ji-Young;Lee, Jae-Hwoon
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.33-40
    • /
    • 2007
  • A multihomed enterprise or AS(Autonomous System) improves reliability and performance by acquiring its Internet connectivity from more than two ISP(Internet Service Provider). Multihoming protocol must allow a multihomed site whose connectivity through one of the ISPs fails to keep its Internet connectivity As one of mechanisms to do this, tunneling mechanism through Non-direct EBGP(Exterior Border Gateway Protocol) is defined. This mechanism makes connectivity to the Internet more reliable, but causes the problem that makes the communication route non-optimal. In this paper, we propose the route optimization mechanism using an extension header in the IPv6 multihoming environment.

A Simulation-Based Study of FAST TCP Compared to SCTP: Towards Multihoming Implementation Using FAST TCP

  • Arshad, Mohammad Junaid;Saleem, Mohammad
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.275-284
    • /
    • 2010
  • The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delaybased, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols.

The Framework for Multiple Interface Selection at a Multihomed Mobile Router (멀티호밍 모바일 라우터에서의 다중 인터페이스 선택 프레임워크)

  • Park, Chul-Hyun;Choi, Nak-Jung;Choi, Yang-Hee;Kwon, Tae-Kyoung;Paik, Eun-Kyoung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.297-301
    • /
    • 2006
  • 다수의 네트워크에 접근이 가능한 멀티호밍 기술이 구현된 모바일 라우터는 연결된 사용자들이 요구하는 다양한 서비스 요구 사항에 맞추어 적절한 네트워크를 선택하고 서비스를 제공할 수 있어야 한다. 이를 위해서 본 논문에서는 사용자의 응용 프로그램의 요구 사항과 네트워크의 특성, 그리고 모바일 네트워크, 관리자의 정책이라는 세 가지 정보를 모바일 라우터 내에서 관리하면서, 최적의 네트워크를 선택하여 해당 네트워크와 연결을 가진 인터페이스를 통해 사용자의 트래픽을 전송할 수 있는다중 인터페이스 선택을 위한 프레임워크를 제안한다.

  • PDF

The Mechanism to Bypass Ingress Filtering for Multihomed Mobile Networks (멀티호밍 모바일 네트워크를 위한 인그레스 필터링 우회 메커니즘)

  • Ryu, Ji-Ho;Choi, Nak-Jung;Kwon, Tae-Kyoung;Choi, Yang-Hee;Paik, Eun-Kyoung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.283-287
    • /
    • 2006
  • 본 논문에서는 멀티호밍 모바일 네트워크에서 발생하는 다양한 이슈 중 인그레스 필터링(ingress filtering) 문제에 대한 해결책을 제시하고자 한다. 본 저자들은 먼저 다수의 모바일 라우터가 존재하는 모바일 네트워크 환경에서 이웃 모바일 라우터 사이에 '프리픽스(prefix) 이웃' 관계를 제안한다. 그리고 이런 관계를 활용하여 모바일 라우터의 서비스를 받는 단말들이 자신의 주소를 변경하지 않고도 이웃 모바일 라우터를 통하여 릴레이 서비스를 받을 수 있도록 하는 인그레스 필터링 우회 기법도 제안한다. 또한 제안된 기법들을 ns-2 시뮬레이터 상에서 구현하고 모의 실험을 수행하여 제안된 기법의 성능 향상을 검증한다.

  • PDF

Performance Evaluation on SCTP multi-homing Feature (SCTP의 멀티호밍 특성에 대한 성능 평가)

  • Song, Jeong-Hwa;Lee, Mee-Jeong;Koh, Seok-Joo
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.245-252
    • /
    • 2004
  • Stream Control Transmission Protocol(SCTP) is a new connection-oriented, reliable delivery transport protocol operating on top of an unreliable connectionless packet service such as IP. It inherits many of the functions developed for TCP, including flow control and packet loss recovery functions. In addition, it also supports transport layer multihoming and multistreaming In this paper, we study the impact of multi-homing on the performance of SCTP. We first compare performance of single-homed SCTP. multi-homed SCTP, TCP Reno and TCP SACK. We, then describe potential flaw in the current SCTP retransmission policy, when SCTP host is multihomed. Our Results show that SCTP performs better than TCP Reno and TCP SACK due to several changes from TCP in its congestion control mechanism. In particular. multi-homed SCTP shows the best result among the compared schemes. Through experimentation for multi-homed SCTP, we found that the current SCTP retransmission policy nay deteriorate the perfomance when the retransmission path it worse than the original path. Therefore, the condition of retransmission path is a very important factor In SCTP performance and a proper mechanism would be required to measure the condition of the retransmission path.

An Impact of Addressing Schemes on Routing Scalability

  • Ma, Huaiyuan;Helvik, Bjarne E.;Wittner, Otto J.
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.602-611
    • /
    • 2011
  • The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.