• Title/Summary/Keyword: Network Latency

Search Result 764, Processing Time 0.022 seconds

A Hierarchical Mobile W Architecture using a Virtual Router Layer (가상 라우터 계층을 이용한 Hierarchical Mobile IP 구조)

  • Shin Bok-Deok;Ha Kyung-Jae
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.603-614
    • /
    • 2005
  • The wireless LAN environment using Mobile IP is constructed and managed to be connected with Ethernet based wired networks. However, there have been many problems with wireless networks using Mobile IP. Some important facts on network performance have not been considered when introducing wireless LAN by Mobile IP to wired networks. In this paper, we suggest schemes which can solve problems on Handover latency caused by the asymmetrical connectivity of the Access Router at applying the HMIPv6 and on binding updates due to the MN frequent movement. Our proposed schemes can reduce network latency by using the HMIPv6 architecture with a virtual router layer, and reduce communication overhead by interchanging information of the MN movement between routers. Our schemes are expected to assist in constructing a more real and effective wireless LAN environment based on the HMIPv6 and FMIP.

A Study on Security Hole Attack According to the Establishment of Policies to Limit Particular IP Area (특정 IP 영역 제한정책 설정에 따른 보안 취약점 공격에 관한 연구)

  • Seo, Woo-Seok;Jun, Moon-Seog
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.6
    • /
    • pp.625-630
    • /
    • 2010
  • With regard to the examples of establishing various sorts of information security, it can be seen that there are gradual, developmental procedures including Firewall and VPN (Virtual Private Network), IDS (Intrusion Detection System), or ESM(Enterprise Security Management). Each of the security solutions and equipments analyzes both defense and attack for information security with the criteria of classifying the problems of security policies by TCP/IP layers or resulted from attack patterns, attack types, or invasion through specialized security technology. The direction of this study is to examine latency time vulnerable to invasion which occurs when L2-stratum or lower grade equipments or policies are applied to the existing network through TCP/IP layer's L3-stratum or higher grade security policies or equipments and analyze security holes which may generate due to the IP preoccupation in the process of establishing policies to limit particular IP area regarding the policies for security equipments to figure out technological problems lying in it.

A P2P-based Management Method for Dynamic AOI (동적 AOI를 위한 P2P 기반 관리기법)

  • Lim, Chae-Gyun;Rho, Kyung-Taeg
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.211-216
    • /
    • 2011
  • Networked virtual environments (NVEs) are distributed systems where geographically dispersed users interact with each other in virtual worlds by exchanging network messages. Massively Multiplayer Online Game (MMOG) is one of diverse applications where more than hundreds of users enjoy experiencing virtual worlds. A limited area called area of interest (AOI) in MMOG is reduced the load caused by message exchange between users. Voronoi-based Overlay Network (VON) is proposed to reduce the bandwidth consumption in P2P environments and Vorocast also is made using message forwarding in VON. We propose a dynamic AOI management method that solves problems such as a consistency and latency due to forwarding position updates to neighbor nodes from the message originator in forwarding scheme. Our scheme provides the consistency and reduces latency by combining direct connection scheme and Vorocast scheme compared to existing schemes. The communication between a user and users existing in center circle within AOI of the user is directly connected and the communication between the user and users existing outside the center area within AOI is using Vorocast scheme. The proposed model is evaluated through simulations.

Scalable CC-NUMA System using Repeater Node (리피터 노드를 이용한 Scalable CC-NUMA 시스템)

  • Kyoung, Jin-Mi;Jhang, Seong-Tae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.9
    • /
    • pp.503-513
    • /
    • 2002
  • Since CC-NUMA architecture has to access remote memory, the interconnection network determines the performance of the CC-NUMA system. Bus which has been used as a popular interconnection network has many limits in a large-scale system because of the limited physical scalability and bandwidth. The dual ring interconnection network, composed of high-speed point-to-point links, is made to resolve the defects of the bus for the large-scale system. However, it also has a problem, in that the response latency is rapidly increased when many nodes are attached to the snooping based CC-NUMA system with the dual ring. In this paper, we propose a ring architecture with repeater nodes in order to overcome the problem of the dual ring on a snooping based CC-NUMA system, and design a repeater node adapted to this architecture. We will also analyze the effects of proposed architecture on the system performance and the response latency by using a probability-driven simulator.

Design and Implementation of a Grid System META for Executing CFD Analysis Programs on Distributed Environment (분산 환경에서 CFD 분석 프로그램 수행을 위한 그리드 시스템 META 설계 및 구현)

  • Kang, Kyung-Woo;Woo, Gyun
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.533-540
    • /
    • 2006
  • This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.

A Next-generation Mobility Management Scheme for an IPv4/IPv6 Dual-stack Terminal (듀얼스택 단말을 지원하는 차세대 이동성 지원 기술 연구)

  • Lee, Kyoung-Hee;Lee, Sung-Kuen;Lee, Hyun-Woo;Han, Youn-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10B
    • /
    • pp.1182-1191
    • /
    • 2011
  • In this paper, we propose a network-based IP mobility management scheme, called Access Independent Mobile Service with IPv4/IPv6 Dual Stack (AIMS-DS), which can provide high-quality multimedia services to IPv4/IPv6 dual-stack mobile nodes (MNs) without any interruption over various wireless/wired access networks. The proposed scheme provides an MN with a fast and reliable mobility service among heterogeneous wireless access networks through the network-based control, the complete separation method of control and data plane, the cross-layer (layer2 and layer3) interworking method for handover control acceleration, etc, In addition, the proposed AIMS-DS can provide seamless mobility service to an MN under the environments of IPv4/IPv6 coexisting networks through the home address mobility support and transport network support. Through performance evaluation with computer simulations, we have shown the superiority of the proposed AIMS-DS in terms of handover latency, packet 1085 and packet delivery latency.

Performance Evaluation of Improved Fast PMIPv6-Based Network Mobility for Intelligent Transportation Systems

  • Ryu, Seonggeun;Choi, Ji-Woong;Park, Kyung-Joon
    • Journal of Communications and Networks
    • /
    • v.15 no.2
    • /
    • pp.142-152
    • /
    • 2013
  • The network mobility basic support (NEMO BS) protocol has been investigated to provide Internet connectivity for a group of nodes, which is suitable for intelligent transportation systems (ITS) applications. NEMO BS often increases the traffic load and handover latency because it is designed on the basis of mobile Internet protocol version 6 (MIPv6). Therefore, schemes combining proxy MIPv6 with NEMO (P-NEMO) have emerged to solve these problems. However, these schemes still suffer from packet loss and long handover latency during handover. Fast P-NEMO (FP-NEMO) has emerged to prevent these problems. Although the FP-NEMO accelerates handover, it can cause a serious tunneling burden between the mobile access gateways (MAGs) during handover. This problem becomes more critical as the traffic between the MAGs increases. Therefore, we propose a scheme for designing an improved FP-NEMO (IFP-NEMO) to eliminate the tunneling burden by registering a new address in advance. When the registration is completed before the layer 2 handover, the packets are forwarded to the new MAG directly and thereby the IFP-NEMO avoids the use of the tunnel between the MAGs during handover. For the evaluation of the performance of the IFP-NEMO compared with the FP-NEMO, we develop an analytical framework for fast handovers on the basis of P-NEMO. Finally, we demonstrate that the IFP-NEMO outperforms the FP-NEMO through numerical results.

Blockchain-Based Smart Home System for Access Latency and Security (지연시간 및 보안을 위한 블록체인 기반 스마트홈 시스템 설계)

  • Chang-Yu Ao;Kang-Chul Kim
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.1
    • /
    • pp.157-164
    • /
    • 2023
  • In modern society, smart home has become a part of people's daily life. But traditional smart home systems often have problems such as security, data centralization and easy tampering, so a blockchain is an emerging technology that solves the problems. This paper proposes a blockchain-based smart home system which consists in a home and a blockchain network part. The blockchain network with 8 nodes is implemented by HyperLeger Fabric platform on Docker. ECC(Elliptic Curve Cryptography) technology is used for data transmission security and RBAC(role-based access control) manages the certificates of network members. Raft consensus algorithm maintains data consistency across all nodes in a distributed system and reduces block generation time. The query and data submission are controlled by the smart contract which allows nodes to safely and efficiently access smart home data. The experimental results show that the proposed system maintains a stable average query and submit time of 84.5 [ms] and 93.67 [ms] under high concurrent accesses, respectively and the transmission data is secured through simulated packet capture attacks.

Network Mobility Handoff Scheme to Support Fast Route Optimization in Nested Network Mobility (중첩된 이동 네트워크 환경에서 빠른 경로 최적화를 지원하는 핸드오프 방안)

  • Lee, Il-Ho;Lee, Jun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.119-131
    • /
    • 2009
  • Existing proposals on route optimization for nested Network Mobility(NEMO) have a problem that it is difficult to optimize a route promptly in an environment where a MR moves frequently. Also, they have L3 handoff latency as well as route optimization latency until an optimized route is formed. In this paper, we propose a L3 handoff scheme that supports fast route optimization for nested NEMO without any additional optimization procedure. To achieve this, our proposed scheme is designed to include a procedure that an AR acquires address informations of a MR. After receiving binding update message from the MR, the AR performs the binding update procedure with the MR's HA on behalf of the MR. Packets are delivered to the AR only passing by the MR's HA after a bi-directional tunnel is formed between the AR and the HA. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance compared with the RRH and the ONEMO.

Assessing Efficiency of Handoff Techniques for Acquiring Maximum Throughput into WLAN

  • Mohsin Shaikha;Irfan Tunio;Baqir Zardari;Abdul Aziz;Ahmed Ali;Muhammad Abrar Khan
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.4
    • /
    • pp.172-178
    • /
    • 2023
  • When the mobile device moves from the coverage of one access point to the radio coverage of another access point it needs to maintain its connection with the current access point before it successfully discovers the new access point, this process is known as handoff. During handoff the acceptable delay a voice over IP application can bear is of 50ms whereas the delay on medium access control layer is high enough that goes up to 350-500ms. This research provides a suitable methodology on medium access control layer of the IEEE 802.11 network. The medium access control layer comprises of three phases, namely discovery, reauthentication and re-association. The discovery phase on medium access control layer takes up to 90% of the total handoff latency. The objective is to effectively reduce the delay for discovery phase to ensure a seamless handoff. The research proposes a scheme that reduces the handoff latency effectively by scanning channels prior to the actual handoff process starts and scans only the neighboring access points. Further, the proposed scheme enables the mobile device to scan first the channel on which it is currently operating so that the mobile device has to perform minimum number of channel switches. The results show that the mobile device finds out the new potential access point prior to the handoff execution hence the delay during discovery of a new access point is minimized effectively.