• Title/Summary/Keyword: queue management algorithm

Search Result 93, Processing Time 0.033 seconds

Achieving Relative Loss Differentiation using D-VQSDDP with Differential Drop Probability (차별적이니 드랍-확률을 갖는 동적-VQSDDP를 이용한 상대적 손실차별화의 달성)

  • Kyung-Rae Cho;Ja-Whan Koo;Jin-Wook Chung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1332-1335
    • /
    • 2008
  • In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (maxth, minth, maxp) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static maxp parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore maxp parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

Fuzzy Network Performance Manager for Token Bus Networks by timer & Queue Capacity Adjustment (큐용량과 시간 할당에 의한 토큰버스 네트워크의 퍼지 성능관리기)

  • Lee, Sang-Ho;Yoon, Jung-A;Lee, Seok
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.664-669
    • /
    • 1994
  • This paper focuses on development and implementation of a performance management algorithm for IEEE802.4 token bus networks to serve large-scale integrated manufacturing systems. Such factory automation networks have to satisgy delay constraints imposed on time-critical messages while maintaining as much network capacity as possible for non-time-critical messages. This paper presents a network perfomance manager that adjusts queue apacity as well as timers by using a set of fuzzy rules and fuzzy inference mechanism. The efficacy of the performance management has been demonstrated by a series of simulation experiments.

  • PDF

Performance Improvement of Active Queue Management for Internet Routers

  • Lim, Hyuk;Park, Kyung-Joon;Park, Eun-Chan;Park, Chong-Ho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.77.1-77
    • /
    • 2001
  • In this paper, we propose a control scheme for improving the performance of a conventional Proportional-Integral (PI) controller for Active Queue Management (AQM) supporting TCP flows. When the PI controller is used for AQM, the windup phenomenon of the integral action causes the performance degradation. Therefore we model AQM as a system with a saturator and apply anti-windup methods to the PI controller for AQM. We compare the performances of anti-windup algorithm with the conventional PI controller through ns simulations. The simulation results show that the PI controller with anti-windup method performs better than the conventional PI controller.

  • PDF

Reducing False Alarm and Shortening Worm Detection Time in Virus Throttling (Virus Throttling의 웜 탐지오판 감소 및 탐지시간 단축)

  • Shim Jae-Hong;Kim Jang-bok;Choi Hyung-Hee;Jung Gi-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.847-854
    • /
    • 2005
  • Since the propagation speed of the Internet worms is quite fast, worm detection in early propagation stage is very important for reducing the damage. Virus throttling technique, one of many early worm detection techniques, detects the Internet worm propagation by limiting the connection requests within a certain ratio.[6, 7] The typical throttling technique increases the possibility of false detection by treating destination IP addresses independently in their delay queue managements. In addition, it uses a simple decision strategy that determines a worn intrusion if the delay queue is overflown. This paper proposes a two dimensional delay queue management technique in which the sessions with the same destination IP are linked and thus a IP is not stored more than once. The virus throttling technique with the proposed delay queue management can reduce the possibility of false worm detection, compared with the typical throttling since the proposed technique never counts the number of a IP more than once when it chicks the length of delay queue. Moreover, this paper proposes a worm detection algorithm based on weighted average queue length for reducing worm detection time and the number of worm packets, without increasing the length of delay queue. Through deep experiments, it is verified that the proposed technique taking account of the length of past delay queue as well as current delay queue forecasts the worn propagation earlier than the typical iuぉ throttling techniques do.

Hybrid Scheduling Algorithm based on DWDRR using Hysteresis for QoS of Combat Management System Resource Control

  • Lee, Gi-Yeop
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.1
    • /
    • pp.21-27
    • /
    • 2020
  • In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.

How to Reinvent Network Services for All (상이한 네트워크 서비스 어떻게 향상시킬까?)

  • Kim, Yong-J.;Lee, Seo-Jun;Lim, Jay-Ick
    • Korean Management Science Review
    • /
    • v.25 no.3
    • /
    • pp.87-99
    • /
    • 2008
  • Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

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

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.

Efficient Online Path Planning Algorithm for Mobile Robots in Dynamic Indoor Environments (이동 로봇을 위한 동적 실내 환경에서의 효율적인 온라인 경로 계획 알고리즘)

  • Kang, Tae-Ho;Kim, Byung-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.7
    • /
    • pp.651-658
    • /
    • 2011
  • An efficient modified $D^*$ lite algorithm is suggested, which can perform online path planning for mobile robots in dynamic indoor environment. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on $D^*$ Lite algorithm, we improved representation of edge cost, heuristic function, and priority queue management, to build a modified $D^*$ Lite algorithm. Performance of the proposed algorithm is revealed via extensive simulation study.