• Title/Summary/Keyword: random time delay

Search Result 153, Processing Time 0.022 seconds

Multipath TCP performance improvement using AQM in heterogeneous networks with bufferbloat (버퍼블로트를 가지는 이종 망에서 AQM을 이용한 Multipath TCP 성능 개선)

  • Hyeon, Dong Min;Jang, Jeong Hun;Kim, Min Sub;Han, Ki Moon;Lee, Jae Yong;Kim, Byung Chul
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.4
    • /
    • pp.131-140
    • /
    • 2017
  • Multipath TCP (MPTCP) is a transport layer protocol that simultaneously transmits data using multiple interfaces. MPTCP is superior to existing TCP in network environment with homogeneous subflows, but it shows worse performance compared to existing TCP in network environment with bufferbloat. If a bufferbloat occurs in one of the MPTCP multipaths, the packet will not arrive at the MPTCP receive buffer due to a sudden increase in delay time, resulting in a HoL blocking phenomenon. It makes the receive window of the other path to be zero. In this paper, we apply Adaptive Random Early Detection (ARED), Controlled Delay (CoDel) and Proportional Integral Controller Enhanced (PIE) among the proposed Active Queue Management (AQM) to limit the delay of bufferbloat path. Experiments were conducted to improve the performance of MPTCP in heterogeneous networks. In order to carry out the experiment, we constructed a Linux-based testbed and compared the MPTCP performance with that of the existing droptail.

Improved Unslotted IEEE 802.15.4 Algorithm for HAN in Smart Grids (스마트그리드 HAN을 위한 개선된 Unslotted IEEE 802.15.4 알고리즘)

  • Hwang, Sung Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.3
    • /
    • pp.1711-1717
    • /
    • 2014
  • There have been many studies on IEEE 802.15.4 for home area networks(HAN) in Smart Grids. Existing unslotted or slotted IEEE 802.15.4 has almost not met strict conditions of the U.S. Department Of Energy(DOE). This study proposed a improved algorithm that reduces collisions, delay time and changes in the delay time. For this purpose, numbers were given to nodes to make the transmission in the order of the node numbers. Since the probability of the occurrence of collisions would decrease compared to random transmission if the nodes were given numbers, Backoff time was set at 0. In the proposed Numbered-Unslotted-ZeroBackoff algorithm, when the packet size was 133 octets and less than 180 packets per second occurred, it was found that packet delivery ratio was over 99.99%, and that all the maximum delay, the mean delay and the minimum delay were less than 0.02 seconds. This paper could confirm that the algorithm proposed in this study met the strict conditions of the DOE.

A turbo code with reduced decoding delay (감소된 복호지연을 갖는 Turbo Code)

  • 김준범;문태현;임승주;주판유;홍대식;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.7
    • /
    • pp.1427-1436
    • /
    • 1997
  • Turbo codes, decoded through an iterative decoding algorithm, habe recently been shown to yidel remarkable coding gains close to theoretical limits in the Gaussian channel environment. This thesis presents the performance of Turbo code through the computer simulation. The performance of modified Turbo code is compared to that of the conventional Turbo codes. The modified Turbo code reduces the time delay in decoding with minimal effect to the performance for voice transmission sytems. To achieve the same performance, random interleaver the size of which is no less than the square root of the original one should be used. Also, the modified Turbo code is applied to MC-CDMA system, and its performance is analyzed under the Rayleigh Fading channel environment. In Rayleigh fading channel environment, due to the amplitude distortion caused by fading, the interleaver of the size twice no less than that in the Gaussian channel enironment was required. In overall, the modified Turbo code maintained the performance of the conventional Turbo code while the time delay in transmission and decoding was reduced at the rate of multiples of two times the squared root of the interleaver size.

  • PDF

Impact of Mobility on the Ad Hoc Network Performance (이동성이 Ad Hoc 망의 성능에 미치는 영향)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.201-208
    • /
    • 2010
  • Mobile Ad Hoc Network(MANET) has highly dynamic topology, hence presents a great challenge on the network performance evaluation and network protocol design. We proposed total path break up time, $\sum_{i}T_i$, as a metric to measure the performance of the total system as well as an individual connection. In this paper, we evaluate and analyze the performance of three mobility models(Random Waypoint, Manhattan, Blocked Manhattan) by applying the total path break up metric, investigate why network parameters such as packet delivery ratio, end-to-end delay, etc. vary by mobility models. We also present analysis result how much AODV Buffer improve packet delivery ratio and increase the end-to-end delay in spite of the path break up.

A Hybrid Active Queue Management for Stability and Fast Adaptation

  • Joo Chang-Hee;Bahk Sae-Woong;Lumetta Steven S.
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.93-105
    • /
    • 2006
  • The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

Models and Charcteristics of Multipath Propagation on Mobile Radio in an Urban Area (도시내 이동무선에서의 다중파전파전파의 특성 및 모델에 관한 연구)

  • 하덕호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.4
    • /
    • pp.293-306
    • /
    • 1989
  • In this paper, the models and characteristics of multipath propagation in an urban environment are described. Three propagation models(a random model, a ray model and a method of estimating time delay is proposed based on the envelope correlation between two radio frequencies. It is shown on the basis of laboratory simulation and field tests that the simple two-ray model is an adequate model for the fundamental study of the multipath propagation characteristic of the mobile radiowave and the estimating time delays of multipath-propagated waves in an urban area.

  • PDF

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.9
    • /
    • pp.1492-1512
    • /
    • 2011
  • Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

Teleoperation of an Internet-Based Mobile Robot with Network Latency (데이터 전송 지연을 고려한 인터넷 기반 이동 로봇의 원격 운용)

  • Shin, Jik-Su;Joo, Moon-Gab;Kang, Geun-Taek;Lee, Won-Chang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.4
    • /
    • pp.412-417
    • /
    • 2005
  • The Internet has been widely applied to the remote control system. The network-based control system, however, has a random time delay and an inherent weak point of the network, when the data ate transmitted. The network delay may result in performance degradation or even system instability in teleoperation. In this paper a prediction model of network delay using TSK (Takagi-Sugeno-Kang) fuzzy model is presented. An adaptive scheme is developed to update the prediction model according to the current network status. The prediction model is applied to the control of an Internet-based mobile robot to show its usefulness. In the computer simulation the TSK Prediction model of network delay is proven superior to the conventional algorithms.

Identification of First-order Plus Dead Time Model from Step Response Using HS Algorithm (HS 알고리즘을 이용한 계단응답으로부터 FOPDT 모델 인식)

  • Lee, Tae-Bong
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.6
    • /
    • pp.636-642
    • /
    • 2015
  • This paper presents an application of heuristic harmony search (HS) optimization algorithm for the identification of linear continuous time-delay system from step response. Identification model is first-order plus dead time (FOPDT), which describes a linear monotonic process quite well in most chemical processes and HAVC process and is often sufficient for PID controller tuning. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the identification method has been demonstrated through a number of simulation examples.

Effect of Imperfect Power Control on Performance of a PN Code Tracking Loop for a DS/CDMA System

  • Kim, Jin-Young
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.209-212
    • /
    • 2000
  • In this paper, effect of imperfect power control on performance of a pseudonoise (PN) code tracking loop is analyzed and simulated for a direct-sequence/code-division multiple access (DS/CDMA) system. The multipath fading channel is modeled as a two-ray Rayleigh fading model. Power control error is modeled as a log-normally distributed random variable. The tracking performance of DLL (delay-locked-loop) is evaluated in terms of tracking jitter and mean-time-to-lose-lock (MTLL). From the simulation results, it is shown that the PN tracking performance is very sensitive to the power control error.

  • PDF