• Title/Summary/Keyword: queue management

Search Result 316, Processing Time 0.032 seconds

NDRR Algorithm for High Performance Queue Management (고성능 Queue 관리를 위한 NDRR 알고리즘)

  • Kim, Ji-Hoon;Min, Kyoung-Ju;Kwon, Taeck-Geun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.503-507
    • /
    • 2007
  • 라우터는 여러 곳에서 들어오는 패킷들을 빠르게 전달하는 기능을 담당하는 네트워크 장비로서, 들어오는 패킷들이 공평하게 서비스 받을 수 있도록 큐 관리 알고리즘을 사용한다. 그런데 대부분의 라우터들은 HOL 블록킹 문제 때문에 버퍼를 입력 포트 쪽이 아닌 가상적으로 출력 포트 쪽에 정의하는 VOQ로 구현을 하였고, 패킷들이 공평하게 서비스 받기 위해 DRR 알고리즘으로 구현하는 경향이 있다. 이 논문에서는 기존의 DRR 알고리즘에서 패킷 서비스를 위한 경직된 조건에 유연성을 주어 기존의 DRR 알고리즘의 복잡도와 공평성을 유지하는 한편 패킷 서비스 성능을 높여주는 NDRR 알고리즘을 제안한다.

  • PDF

Intelligent AQM Controller (지능형 능동 큐 관리 제어기)

  • Kim, Jae-Man;Choi, Yoon-Ho;Park, Jin-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2006.07d
    • /
    • pp.1807-1808
    • /
    • 2006
  • In this paper, we present the wavelet neural network (WNN) controller as an active queue management(AQM) in end-to-end TCP network. AQM is important to regulate the queue length and short round trip time by passing or dropping the packets at the intermediate routers. As the role of AQM, the WNN controller adaptively controls the dropping probability of the TCP network and is trained by gradient-descent algorithm. We illustrate our result that WNN controller is superior to PI controller via simulations.

  • PDF

Performance Analysis of a Finite-Buffer Discrete-Time Queueing System with Fixed-Sized Bulk-service

  • Chang, Seok-Ho;Kim, Tae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.783-792
    • /
    • 2003
  • We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K+B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.

A Space Merging Approach to the Analysis of the Performance of Queueing Models with Finite Buffers and Priority Jumps

  • Oh, Youngjin;Kim, Chesoong;Melikov, Agassi
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.3
    • /
    • pp.274-280
    • /
    • 2013
  • This paper proposes a space merging approach to studying the queuing models with finite buffers and jump priorities. Upon the arrival of a call with low priority, one call of such kind is assumed to be transferred to the end of the queue of high priority calls. The transfer probabilities depend on the state of the queue of the heterogeneous calls. We developed the algorithms to calculate the quality of service metrics of such queuing models, and the results of the numerical experiments are shown.

EFFECT OF THE NUMBER OF ACTIVE SOURCES ON ABR BUFFER SIZE

  • Lee, Yu-Tae;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.3
    • /
    • pp.861-873
    • /
    • 2000
  • Rate-based flow control plays an important role for efficient traffic management of Available Bit Rate(ABR) services. We deal with the problem of the buffer dimension for rate-based ABR control. In this paper, we analyze the Allowed Cell Rate(ACR) of a source and the queue size in a steady state. First, we investigate the effect of the number of active sources on the behavior of the ACR and the maximum queue size. Reflecting the effect of this real scenes, we determine the optimal buffer size and buffer threshold. Furthermore, our analytic results are compared with the case when the effect of the number of active sources is disregarded.

Wavelet Neural Network Controller for AQM in a TCP Network: Adaptive Learning Rates Approach

  • Kim, Jae-Man;Park, Jin-Bae;Choi, Yoon-Ho
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.4
    • /
    • pp.526-533
    • /
    • 2008
  • We propose a wavelet neural network (WNN) control method for active queue management (AQM) in an end-to-end TCP network, which is trained by adaptive learning rates (ALRs). In the TCP network, AQM is important to regulate the queue length by passing or dropping the packets at the intermediate routers. RED, PI, and PID algorithms have been used for AQM. But these algorithms show weaknesses in the detection and control of congestion under dynamically changing network situations. In our method, the WNN controller using ALRs is designed to overcome these problems. It adaptively controls the dropping probability of the packets and is trained by gradient-descent algorithm. We apply Lyapunov theorem to verify the stability of the WNN controller using ALRs. Simulations are carried out to demonstrate the effectiveness of the proposed method.

A study on the Waiting Line in the Automated Storage/Retrieval System with Dual Command Policy (이중명령 자동창고의 대기행렬에 관한 연구)

  • Chang, Jin-Ick;Kim, Won-Joong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.28 no.4
    • /
    • pp.134-141
    • /
    • 2005
  • Due to the complexity and stochastic nature of automated warehousing system, items are usually queued up at I/O point. We introduce a storage/retrieval policy : dual-command. We present quick approximations to queueing phenomena under these policies. It is assumed that the storage and retrieval arrival pattern follow the same poisson process. We also assumed that storage queue and retrieval queue being operated separately. The approximation attempts are performed under the proposed storage/retrieval policies after we derive S/R machine travel time distributions.

Performance Improvement on RED Based Gateway in TCP Communication Network

  • Prabhavat, Sumet;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.782-787
    • /
    • 2004
  • Internet Engineering Task Force (IETF) has been considering the deployment of the Random Early Detection (RED) in order to avoid the increasing of packet loss rates which caused by an exponential increase in network traffic and buffer overflow. Although RED mechanism can prevent buffer overflow and hence reduce an average values of packet loss rates, but this technique is ineffective in preventing the consecutive drop in the high traffic condition. Moreover, it increases a probability and average number of consecutive dropped packet in the low traffic condition (named as "uncritical condition"). RED mechanism effects to TCP congestion control that build up the consecutive of the unnecessary transmission rate reducing; lead to low utilization on the link and consequently degrade the network performance. To overcome these problems, we have proposed a new mechanism, named as Extended Drop slope RED (ExRED) mechanism, by modifying the traditional RED. The numerical and simulation results show that our proposed mechanism reduces a drop probability in the uncritical condition.

  • PDF

A Study of Optimization in the Queue, Finite Population (유한모집단 대열기법에 의한 최적화 연구)

  • 오충환
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.1 no.1
    • /
    • pp.37-44
    • /
    • 1978
  • The purpose of this study is to search for an efficient application method in solving delay-phenomenon problems which influence upon total production cost through case study. The method of this study is an experimental study based on cutting time data in lead cutting operations from "Lead Cutting Machine (Stripper)" and its service rate data from a large electronic products company which utilizes conveyor line system for the products "Car Stereo" The procedure of this experimental study is as follows; 1) Using loading(Man-Hour) analysis technique j,1 order to analyse and evaluate Production capacity, efficiency, operation and idle rate assembly charge, waiting and service cost -when its are controlled by stripper operator(server) 2) Establishing adequate waiting time model of finite population caused by the interference of 4 stripper machine which is drawn from mathematical statistics testing, that is, goodness of fit test in the waiting and service rate and to search for optimal solution by utilizing the above mentioned model The experimental result was that amount to 8,546,618won Per year was brought down, that is, by optimum point, it shows a decrease as compared with Present point. The major limitation of this experimental study is that the Queue in the Finite Population, so to speak. it comes from the interference of 4 stripper machine dealt with this case were limited only on the Car Stereo conveyor line. Further study of application of this application method to the areas such as material handling, personnel management marketing and transportation management is strong1y recommended.trong1y recommended.

  • PDF

A Study on the Optimal Appointment Scheduling for the Ship Maintenance with Queueing System with Scheduled Arrivals (예약도착 대기행렬을 활용한 함정정비 최적 예약시간 산정에 관한 연구)

  • Ko, Jae-Woo;Kim, Gak-Gyu;Yun, Bong-Kyu
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.38 no.3
    • /
    • pp.13-22
    • /
    • 2013
  • Queueing system with scheduled arrivals is useful in many fields where both customers' waiting time and servers' operation time (utilization) are important, and arrival time of customers is possible to be controlled. In this paper, we analyzed the operation of ship maintenance with the queueing system with scheduled arrival. Based on the model presented by Pegden and Rosenshine [8], who dealt with exponential service time, we extended the service time distributions to phase-type distribution which is able to include a wide range of real stochastic phenomena. Since most activities in the military are carried out under tight control and schedule, scheduled arrival queue has quite good applicability in this area. In this context, we applied queue with scheduled arrival to the optimal booking time decision for the ship maintenance in the navy.