• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.028 seconds

An LMI Approach to Robust Congestion Control of ATM Networks

  • Lin Jun;Xie Lihua;Zhang Huanshui
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.1
    • /
    • pp.53-62
    • /
    • 2006
  • In this paper, ATM network congestion control with explicit rate feedback is considered. In ATM networks, delays commonly appear in data transmission and have to be considered in congestion control design. In this paper, a bounded single round delay on the return path is considered. Our objective is to design an explicit rate feedback control that achieves a robust optimal $H_2$ performance regardless of the bounded time-varying delays. An optimization approach in terms of linear matrix inequalities (LMIs) is given. Saturation in source rate and queue buffer is also taken into consideration in the proposed design. Simulations for the cases of single source and multiple sources are presented to demonstrate the effectiveness of the design.

QUEUEING ANALYSIS OF GATED POLLING SYSTEM FOR DYNAMIC BANDWIDTH ALLOCATION SCHEME IN AN EPON

  • Park, Chul-Geun;Kim, Ba-Ra;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.469-481
    • /
    • 2004
  • In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

A delay analysis of multi-access protocol under wireless network (무선환경하에서 Slotted ALOHA 방식의 다중채널 경쟁에 대한 지연시간분석)

  • Hur Sun;Kim Jeong-Kee;Nam Jin-Gyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.28 no.1
    • /
    • pp.129-133
    • /
    • 2005
  • Slotted ALOHA(S-ALOHA) is widely used in local wireless network. We analyze the performance of contention-based model in wireless LAN using S-ALOHA protocol. We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol: whenever a node's message which tries to reserve a channel is involved in a collision for the ith time, it chooses one of the next $2^i$ frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study is performed to verify our method.

Chaos Based Random Number Generation In Tiny MCU (소형마이콤에서의 카오스난수 발생 함수구현)

  • Hyun, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.47 no.3
    • /
    • pp.1-4
    • /
    • 2010
  • RS-485, communication bases from small network system must prepare in collision. The collision is that mean the data transfer breaks. For a stabilized communication chooses 1:N polling methods. But polling is low speed in addition to maybe overload Master device. So, usual N:N Prefers a communication. In this case, must be preparing to avoid collision or some solutions. Generally, to after collision retransmits after short time. It's called delay time for short time. When making a delay time, uses address of each systems. (Address of each node) If the many nodes collided, the each node has different delay time. When making a delay time, uses a usual random number. Making a random number is hard job. So uses a usual pseudorandom number. It is more difficult from small size MCU. The Chaos random number provides stabled value. Finally, when uses the Chaos random number, the stability and reliability of system get better.

A Study on EMG Signals Recognition using Time Delayed Counterpropagation Neural Network (시간 지연을 갖는 쌍전파 신경회로망을 이용한 근전도 신호인식에 관한 연구)

  • Kwon, Jangwoo;Jung, Inkil;Hong, Seunghong
    • Journal of Biomedical Engineering Research
    • /
    • v.17 no.3
    • /
    • pp.395-401
    • /
    • 1996
  • In this paper a new neural network model, time delayed counterpropagation neural networks (TDCPN) which have high recognition rate and short total learning time, is proposed for electromyogram(EMG) recognition. Signals the proposed model increases the recognition rates after learned the regional temporal correlation of patterns using time delay properties in input layer, and decreases the learning time by using winner-takes-all learning rule. The ouotar learning rule is put at the output layer so that the input pattern is able to map a desired output. We test the performance of this model with EMG signals collected from a normal subject. Experimental results show that the recognition rates of the suggested model is better and the learning time is shorter than those of TDNN and CPN.

  • PDF

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.

Faster Detouring for Data Plane Failures in Software Defined Networks (SDN에서 데이터 평면 장애를 해결하는 빠른 우회 기법)

  • Thorat, Pankaj;Yeom, Sanggil;Choo, Hyunseung
    • Annual Conference of KIPS
    • /
    • 2016.04a
    • /
    • pp.124-126
    • /
    • 2016
  • Successful deployment of the Software Defined Network (SDN) depends on its ability to cope up with network failures. There are various types of failures that may occur in an SDN. The most common are switch and link failures. It is necessary to recover the network from failures for a continuous service availability. But for the real-time services fast recovery from the failure is required to minimize the service disruption time. In the proposed work, we focused on minimizing the recovery time after the failure is detected. Once the failure is detected, the controller involvement is needed to dynamically reroute the failure disrupted flows from the failed component to an alternate path. The aim of the proposed scheme is to provide a traffic management scheme which can react to the dynamic network events by rapidly modifying the forwarding behavior of the switches for faster in-band network adaptability. The proposed scheme (1) Considers the shared data and control path delay (2) Optimally utilize the network resources (3) Eliminates the need of constant monitoring overhead at the controller which results into faster detouring and ultimately rapid recovery.

Neural Network-based Real-time End Point Detection Specialized for Accelerometer Signal (신경망을 이용한 실시간 가속도 신호 끝점 검출 방법)

  • Lim, Jong-Gwan;Kwon, Dong-Soo
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.178-185
    • /
    • 2009
  • A signal processing algorithm is proposed for end point detection which is used commonly in accelerometers-based pattern recognition problem. In the conventional method, end points are detected by manual manipulation with an additive button or algorithm based on statistical computation and highpass filtering to cause critical time delay and difficulty for parameters optimization. As an solution, we propose a focused Time Lagged Feedforward Network(TLFN) with respect to a differential signal of acceleration, which is widely applied for time series forecasting. The simple experiment is conducted with handwriting and the detection performance and response characteristic of the proposed algorithm is tested and analyzed.

  • PDF

A Study on the Prediction of the Nonlinear Chaotic Time Series Using a Self-Recurrent Wavelet Neural Network (자기 회귀 웨이블릿 신경 회로망을 이용한 비선형 혼돈 시계열의 예측에 관한 연구)

  • Lee, Hye-Jin;Park, Jin-Bae;Choi, Yoon-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2209-2211
    • /
    • 2004
  • Unlike the wavelet neural network, since a mother wavelet layer of the self-recurrent wavelet neural network (SRWNN) is composed of self-feedback neurons, it has the ability to store past information of the wavelet. Therefore we propose the prediction method for the nonlinear chaotic time series model using a SRWNN. The SRWNN model is learned for the modeling of a function such that the inputs arc known values of the time series and the output is the value in the future. The parameters of the network are tuned to minimize the difference between the nonlinear mapping of the chaotic time series and the output of SRWNN using the gradient-descent method for the adaptive backpropagation algorithm. Through the computer simulations, we demonstrate the feasibility and the effectiveness of our method for the prediction of the logistic map and the Mackey-Glass delay-differential equation as a nonlinear chaotic time series.

  • PDF

Optimum Configuration of Single Frequency Network DMB to enhance the QoS and Service coverage (QoS 개선과 서비스 커버리지 확장을 위한 단일 주파수망 지상파 DMB 최적화 배치)

  • Cho, Young-Hun;Won, Chung-Ho;Seo, Jong-Soo
    • Journal of Broadcast Engineering
    • /
    • v.19 no.4
    • /
    • pp.439-452
    • /
    • 2014
  • This paper suggests the method to extend service area by using the transmit offset delay in T-DMB single frequency network (SFN). In general, synchronization of the transmit time of all site can be done by using the reference clock of GPS, which dose not reflect the details geographical characteristics and transmit specifications of each site. Applying the site-specific transmit offset delay, we could extend the service area of SFN T-DMB. Applying the transmit offset delay, it is found that the signal quality in the region of weak receive field strength was improved and upto 4~8 km service area expansion was achieved by satisfying the minimum field strength ($45dB{\mu}V/m$) recommended by the Korea Communications Commission (KCC). Site-specific offset delay was calculated considering the geographic service area characteristics, distribution of electric field strength between neighboring sites and site-specific service target area. Experiments were carried out in order to analyze impact of calculated offset delay on the T-DMB SFN and also to confirm that the offset delay extends T-DMB service coverage. The experiment was done in metropolitan T-DMB service areas.