• 제목/요약/키워드: Feedback queue

검색결과 40건 처리시간 0.021초

ABR Traffic Control Using Feedback Information and Algorithm

  • Lee, Kwang-Ok;Son, Young-Su;Kim, Hyeon-ju;Bae, Sang-Hyun
    • 한국산학기술학회:학술대회논문집
    • /
    • 한국산학기술학회 2003년도 Proceeding
    • /
    • pp.236-242
    • /
    • 2003
  • ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates. In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals. The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series. The predicted congestion information is backward to the node. NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction. Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

  • PDF

Main Queue에 Threshold가 있는 M/G/1 Bernoulli Feedback 시스템 분석 (An Analysis on the M/G/1 Bernoulli Feedback System with Threshold in Main Queue)

  • 임시영;허선
    • 대한산업공학회지
    • /
    • 제27권1호
    • /
    • pp.11-17
    • /
    • 2001
  • We consider the M/G/1 with Bernoulli feedback, where the served customers wait in the feedback queue for rework with probability p. It is important to decide the moment of dispatching in feedback systems because of the dispatching cost for rework. Up to date, researches have analyzed for the instantaneous-dispatching model or the case that dispatching epoch is determined by the state of feedback queue. In this paper we deal with a dispatching model whose dispatching epoch depends on main queue. We adopt supplementary variable method for our model and a numerical example is given for clarity.

  • PDF

Application of a PID Feedback Control Algorithm for Adaptive Queue Management to Support TCP Congestion Control

  • Ryu, Seungwan;Rump, Christopher M.
    • Journal of Communications and Networks
    • /
    • 제6권2호
    • /
    • pp.133-146
    • /
    • 2004
  • Recently, many active queue management (AQM) algorithms have been proposed to address the performance degradation. of end-to-end congestion control under tail-drop (TD) queue management at Internet routers. However, these AQM algorithms show performance improvement only for limited network environments, and are insensitive to dynamically changing network situations. In this paper, we propose an adaptive queue management algorithm, called PID-controller, that uses proportional-integral-derivative (PID) feedback control to remedy these weak-Dalles of existing AQM proposals. The PID-controller is able to detect and control congestion adaptively and proactively to dynamically changing network environments using incipient as well as current congestion indications. A simulation study over a wide range of IP traffic conditions shows that PID-controller outperforms other AQM algorithms such as Random Early Detection (RED) [3] and Proportional-Integral (PI) controller [9] in terms of queue length dynamics, packet loss rates, and link utilization.

THE M/G/1 FEEDBACK RETRIAL QUEUE WITH BERNOULLI SCHEDULE

  • Lee, Yong-Wan;Jang, Young-Ho
    • Journal of applied mathematics & informatics
    • /
    • 제27권1_2호
    • /
    • pp.259-266
    • /
    • 2009
  • We consider an M/G/1 feedback retrial queue with Bernoulli schedule in which after being served each customer either joins the retrial group again or departs the system permanently. Using the supplementary variable method, we obtain the joint generating function of the numbers of customers in two groups.

  • PDF

THE M/G/1 QUEUE WITH MARKOV MODULATED FEEDBACK

  • Han, Dong-Hwan;Park, Chul-Geun
    • Journal of applied mathematics & informatics
    • /
    • 제5권3호
    • /
    • pp.827-837
    • /
    • 1998
  • We consider the M/G/1 queue with instantaneous feed-back. The probabilities of feedback are determined by the state of the underlaying Markov chain. by using the supplementary variable method we derive the generating function of the number of customers in the system. In the analysis it is required to calculate the matrix equations. To solve the matrix equations we use the notion of Ex-tended Laplace Transform.

ATM망에서 ABR 서비스를 위한 이진 피드백 스위치 알고리즘의 성능 해석 (Analysis of a binary feedback switch algorithm for the ABR service in ATM networks)

  • 김동호;안유제;안윤영;박홍식
    • 한국통신학회논문지
    • /
    • 제22권1호
    • /
    • pp.162-172
    • /
    • 1997
  • In this paper, we investigated the performance of a binary feedback switch algorithm for the ABR(Available Bit Rate) service in ATM networks. A binary feedback switch is also called EFCI(Explicit Forward Congestion Indication) switch and can be classificed into input cell processing(IP) scheme according to processing methods for the EFCI bit in data-cell header. We proposed two implementation methods for the binary feedback switch according to EFCI-bit processing schemes, and analyzed the ACR(Allowed Cell Rate) of source and the queue length of switch for each scheme in steady state. In addition, we derived the upper and lower bounds for maximum and minimum queue lengths, respectively, and investigated the impact of ABR parameters on the queue length.

  • PDF

큐 상태 정보와 예측을 기반으로 한 흐름제어기법 (A Flow Control based on Queue Dynamics and Estimate Information)

  • 서주하;정부영;유현희
    • 산업기술연구
    • /
    • 제19권
    • /
    • pp.423-428
    • /
    • 1999
  • In this paper, We propose a new flow control scheme based on Queue Dynamics and it's Estimate Information in order to achieve higher throughput and network efficiency using control of the best-effort traffic. The feedback Information gives a result that compare queue length with queue threshold. Traffic changes at the time when queue length is cross over under the queue thresholds. The performance of the purposed scheme has been analyzed mathematically and we verify efficiency of the proposed method by means of simulation.

  • PDF

THE M/G/1 FEEDBACK RETRIAL QUEUE WITH TWO TYPES OF CUSTOMERS

  • Lee, Yong-Wan
    • 대한수학회보
    • /
    • 제42권4호
    • /
    • pp.875-887
    • /
    • 2005
  • In M/G/1 retrial queueing system with two types of customers and feedback, we derived the joint generating function of the number of customers in two groups by using the supplementary variable method. It is shown that our results are consistent with those already known in the literature when ${\delta}_k\;=\;0(k\;=\;1,\;2),\;{\lambda}_1\;=\;0\;or\;{\lambda}_2\;=\;0$.

ABR 서비스를 위한 트래픽 예측 제어 알고리즘 연구 (A Study on Predictive Traffic Control Algorithms for ABR Services)

  • 오창윤;장봉석
    • 인터넷정보학회논문지
    • /
    • 제1권2호
    • /
    • pp.29-37
    • /
    • 2000
  • ATM은 비동기 시분할 및 통계적 다중화 특성을 기존의 데이터 통신분야에 도입함으로써 멀티미디어를 이용한 다양한 통신을 유연하게 서비스할 수 있다. AIM ABR 서비스는 망의 혼잡상태에 대한 피드백 정보를 활용하여 트래픽을 제어하여 요구되는 서비스 품질을 보장할 수 있으며 최소의 대역폭을 보장하고 가용 대역폭을 최대 셀 전송률까지 높여 전송할 수 있다. 본 논문에서는 ATM 망에서 더욱 효과적인 ABR 트래픽 제어를 위해서 피드백 정보 형성에 큐 길이 예측제어 방법을 적용한다. 스위치에서 발생한 혼잡상황 임박에 대한 피드백 정보가 역방향 노드에 도착하기 위해서 더욱 긴 지연시간을 갖는 경우에, 제어되기 전에 도착되는 트래픽에 의해 스위치에서의 큐 길이는 이미 혼잡상황을 발생할 수 있으며 또한 큐 길이의 시간 대비 변화량이 비효율적으로 크게 된다. 이 논문에서 제시한 피드백 예측 제어방식들은 스위치에서 시간 대비 큐 길이함수의 기울기와 이전의 큐 변화량을 이용하여 스위치의 큐 길이를 미리 예측하였으며, 그 예측을 통한 혼잡상황 정보를 미리 역방향 노드에게 전달한다. 예측 제어방식으로는 NLMS와 신경망 구조를 이용하였으며 두 방식에 대해 비교하였다. 시뮬레이션 결과 본 논문에서 제시한 알고리즘은 예측기능이 없는 피드백 제어 방식에 비해 더욱 효과적임이 증명되었다. 즉, 예측을 통해서 피드백 정보의 긴 지연을 상쇄함을 이용하여. 스위치에서 큐 길이의 안정화와 더욱 효율적인 혼잡제어가 가능할 수 있음을 보여 준다.

  • PDF

PAQM: an Adaptive and Proactive Queue Management for end-to-end TCP Congestion Control

  • 류승완
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
    • /
    • pp.417-424
    • /
    • 2003
  • In this paper, we introduce and analyze a feedback control model of TCP/AQM dynamics. Then, we propose the Pro-active Queue Management (PAQM) mechanism, which can provide proactive congestion avoidance and control using an adaptive congestion indicator and a control function for wide range of traffic environments. The PAQM stabilizes the queue length around a desired level while giving smooth and low packet loss rates independent of the traffic load level under a wide range of traffic environment. The PAQM outperforms other AQM algorithms such as Random Early Detection (RED) [1] and PI-controller [2]

  • PDF