• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.023 seconds

Distributed processing for the Load Minimization of an SIP Proxy Server (SIP 프록시 서버의 부하 최소화를 위한 분산 처리)

  • Lee, Young-Min;Roh, Young-Sup;Cho, Yong-Karp;Oh, Sam-Kweon;Hwang, Hee-Yeung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.4
    • /
    • pp.929-935
    • /
    • 2008
  • As internet telephony services based on Session initiation Protocol (SIP) enter the spotlight as marketable technology, many products based on SIPs have been developed and utilized for home and office telephony services. The call connection of an internet phone is classified into specific call connections and group call connections. Group call connections have a forking function which delivers the message to all of the group members. This function requires excessive message control for a call connection and creates heavy traffic in the network. In the internet cail system model. most of the call-setup messages are directed to the proxy server during a short time period. This heavy message load brings an unwanted delay in message processing and. as a result, call setup can not be made. To solve the delay problem, we simplified the analysis of the call-setup message in the proxy server, and processed the forking function distributed for the group call-setup message. In this thesis, a new system model to minimize the load is proposed and the subsequent implementation of this model demonstrates the performance improvement.

Design of an USB Security Framework for Double Use Detection (이중사용 방지를 위한 USB 보안 프레임워크의 설계)

  • Jeong, Yoon-Su;Lee, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.4
    • /
    • pp.93-99
    • /
    • 2011
  • Recently, the development of internet technology makes user's personal data used by being saved in USB. But there is a critical issue that personal data can be exposed with malicious purpose because that personal data doesn't need to be certificate to use. This paper proposes USB security framework to prevent a duplicate use of personal data for protecting the data which in USB. The proposed USB security framework performs certification process of user with additional 4bite of user's identification data and usage choice of USB security token before certification data when the framework uses USB security product in different network. It makes communication overhead and service delay increased. As a result of the experiment, packet certification delay time is more increased by average 7.6% in the proposed USB security framework than simple USB driver and USB Token, and procedure rate of certification server on the number of USB is also increased by average 9.8%.

Comparing the Performance of TCP Algorithms (TCP 알고리즘의 성능 비교)

  • 김노환;박준식
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.148-154
    • /
    • 1999
  • TCP has improved by many papers which suggest the new algorithms and modify the previous algorithms. This paper compares Tahoe, Reno, New-Reno, Vegas, and SACK. The first version is Tahoe and is globally used. Reno has optimal performance during occurring one packet loss within a window of data, but can suffer from performance when multiple packets are dropped from a window of data. New-Reno avoids some of the performance problems of Reno TCP when multiple packets are dropped from a window of data. but is occurring the problem of the necessary retransmission. SACK resolves the all above problems and is used in bandwidth delay product environment. Vegas uses network bandwidth more efficiently and is a new implementation of TCP that achieves between 40 and 70 better throughput, with one-fifth to one-half the losses, as compared to the implementation of Reno TCP.

  • PDF

Mobile Sink Data Gathering through Clustering (클러스터링을 통한 모바일 싱크 데이터 수집)

  • Park, Jang-Su;Ahn, Byoung-Chul
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.5
    • /
    • pp.79-85
    • /
    • 2009
  • A sink node and its neighbor nodes spend more energy than other nodes since a stationary sink node collects data from wireless sensor networks(WSNs). For larger WSNs, the unbalanced energy of nodes causes the operation of WSNs to stop rapidly. This paper proposes a data gathering method by adapting the mobile sink to prolong the life time of large WSNs. After partitioning a network into several clusters, a mobile sink visits each cluster and collects data from it. An efficient algorithm is proposed to improve the energy efficiency by delivering the message from the mobile sink to the cluster head as well as to reduce the data gathering delay, which is the disadvantage of the mobile sink. Also, The algorithm is analyzed for the energy consumption and the data gathering delay. The validity of the ananlysis result is confirmed by the simulation.

An Improved Signature Hashing-based Pattern Matching for High Performance IPS (고성능 침입방지 시스템을 위해 개선한 시그니처 해싱 기반 패턴 매칭 기법)

  • Lee, Young-Sil;Kim, Nack-Hyun;Lee, Hoon-Jae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.434-437
    • /
    • 2010
  • NIPS(Network Intrusion Prevention System) is in line at the end of the external and internal networks which performed two kinds of action: Signature-based filtering and anomaly detection and prevention-based on self-learning. Among them, a signature-based filtering is well known to defend against attacks. By using signature-based filtering, intrusion prevention system passing a payload of packets is compared with attack patterns which are signature. If match, the packet is discard. However, when there is packet delay, it will increase the required pattern matching time as the number of signature is increasing whenever there is delay occur. Therefore, to ensure the performance of IPS, we needed more efficient pattern matching algorithm for high-performance ISP. To improve the performance of pattern matching the most important part is to reduce the number of comparisons signature rules and the packet whenever the packets arrive. In this paper, we propose an improve signature hashing-based pattern matching method. We use tuple pruning algorithm with Bloom filters, which effectively remove unnecessary tuples. Unlike other existing signature hashing-based IPS, our proposed method to improve the performance of IPS.

  • PDF

Path selection algorithm for multi-path system based on deep Q learning (Deep Q 학습 기반의 다중경로 시스템 경로 선택 알고리즘)

  • Chung, Byung Chang;Park, Heasook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.1
    • /
    • pp.50-55
    • /
    • 2021
  • Multi-path system is a system in which utilizes various networks simultaneously. It is expected that multi-path system can enhance communication speed, reliability, security of network. In this paper, we focus on path selection in multi-path system. To select optimal path, we propose deep reinforcement learning algorithm which is rewarded by the round-trip-time (RTT) of each networks. Unlike multi-armed bandit model, deep Q learning is applied to consider rapidly changing situations. Due to the delay of RTT data, we also suggest compensation algorithm of the delayed reward. Moreover, we implement testbed learning server to evaluate the performance of proposed algorithm. The learning server contains distributed database and tensorflow module to efficiently operate deep learning algorithm. By means of simulation, we showed that the proposed algorithm has better performance than lowest RTT about 20%.

Analysis of Spatial Correlation and Linear Modeling of GNSS Error Components in South Korea (국내 GNSS 오차 성분별 공간 상관성 및 선형 모델링 특성 분석)

  • Sungik Kim;Yebin Lee;Yongrae Jo;Yunho Cha;Byungwoon Park;Sul Gee Park;Sang Hyun Park
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.13 no.3
    • /
    • pp.221-235
    • /
    • 2024
  • Errors included in Global Navigation Satellite System (GNSS) measurements degrade the performance of user position estimation but can be mitigated by spatial correlation properties. Augmentation systems providing correction data can be broadly categorized into State Space Representation (SSR) and Observation Space Representation (OSR) methods. The satellite-based cm-level augmentation service based on the SSR broadcasts correction data via satellite signals, unlike the traditional Real-Time Kinematic (RTK) and Network RTK methods, which use OSR. To provide a large amount of correction data via the limited bandwidth of the satellite communication, efficient message structure design considering service area, correction generation, and broadcast intervals is necessary. For systematic message design, it is necessary to analyze the influence of error components included in GNSS measurements. In this study, errors in satellite orbits, satellite clocks for GPS, Galileo, BeiDou, and QZSS satellite constellations ionospheric and tropospheric delays over one year were analyzed, and their spatial decorrelations and linear modeling characteristics were examined.

A Novel Rate Control for Improving the QoE of Multimedia Streaming Service in the Internet Congestion (인터넷 혼잡상황에서 멀티미디어 스트리밍 서비스의 QoE 향상을 위한 전송률 제어기법)

  • Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.6
    • /
    • pp.492-504
    • /
    • 2009
  • The delivery of multimedia that efficiently adapts its bit-rate to changing network characteristics and conditions is one of the important challenging tasks in the design of today's real-time multimedia streaming systems such as IPTV, Mobile IPTV and so on. In these work, the primary focus is on network congestion, to improve network stability and inter-protocol fairness. However, these existing works have problems which do not support QoE (Quality of Experience), because they did not consider essential characteristics of contents playback such as the media continuity. In this paper, we propose a novel rate control scheme for improving the QoE of multimedia streaming service in the Internet congestion, called NCAR (Network and Client-Aware Rate control), which is based on network-aware congestion control and client-aware flow control scheme. Network-aware congestion control of the NCAR offers an improving reliability and fairness of multimedia streaming, and reduces the rate oscillation as well as keeping high link utilization. Client-aware flow control of NCAR offers a removing the media discontinuity and a suitable receiver buffer allocation, and provides a good combination of low playback delay. Simulation results demonstrate the effectiveness of our proposed schemes.

Analysis of Remote Driving Simulation Performance for Low-speed Mobile Robot under V2N Network Delay Environment (V2N 네트워크 지연 환경에서 저속 이동 로봇 원격주행 모의실험을 통한 성능 분석)

  • Song, Yooseung;Min, Kyoung-wook;Choi, Jeong Dan
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.3
    • /
    • pp.18-29
    • /
    • 2022
  • Recently, cooperative intelligent transport systems (C-ITS) testbeds have been deployed in great numbers, and advanced autonomous driving research using V2X communication technology has been conducted actively worldwide. In particular, the broadcasting services in their beginning days, giving warning messages, basic safety messages, traffic information, etc., gradually developed into advanced network services, such as platooning, remote driving, and sensor sharing, that need to perform real-time. In addition, technologies improving these advanced network services' throughput and latency are being developed on many fronts to support these services. Notably, this research analyzed the network latency requirements of the advanced network services to develop a remote driving service for the droid type low-speed robot based on the 3GPP C-V2X communication technology. Subsequently, this remote driving service's performance was evaluated using system modeling (that included the operator behavior) and simulation. This evaluation showed that a respective core and access network latency of less than 30 ms was required to meet more than 90 % of the remote driving service's performance requirements under the given test conditions.

A Secure Route Optimization Mechanism for Mobile VPN users in Foreign Networks (모바일 VPN 사용자를 위한 보안 강화 경로 최적화 방안)

  • Kim, Kyoung-Min;Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.348-359
    • /
    • 2007
  • The conventional mobile VPN services assumed the mobile communications occur between the MN in foreign networks and the CN in the home network. However, if a MN wants to communicate with another MN in a foreign network, it could degrade the performance of the mobile VPN service because of the triangular routing problem. In this paper, we propose a route optimization mechanism based on the mobile VPN using an x-HA allocated by diameter MIP in order to support the efficient communication between the mobile VPN users in foreign networks. The i-HA maintains the VPN-TIA as well as the x-HoA as the CoAs to solve the security problem and to provide an efficient route optimization simultaneously. Moreover, we proposed revised IPSec tunnel configuration to reduce the IPSec tunnel overheads at a MN when the MN communicates with several MNs in the foreign networks at the same time. The VPN server, a security management entity in the home network, notifies an additional IPSec tunnel establishment between the x-HAs where the communication peers are registered. The simulation result showed that the proposed scheme decreases the end-to-end packet delay time and improves the throughput after the handoff compared to the existing mechanism.