• 제목/요약/키워드: network queue management

Search Result 119, Processing Time 0.028 seconds

SQUIRREL SEARCH PID CONTROLLER ALGORITHM BASED ACTIVE QUEUE MANAGEMENT TECHNIQUE FOR TCP COMMUNICATION NETWORKS

  • Keerthipati.Kumar;R.A. KARTHIKA
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.4
    • /
    • pp.123-133
    • /
    • 2023
  • Active queue management (AQM) is a leading congestion control system, which can keep smaller queuing delay, less packet loss with better network utilization and throughput by intentionally dropping the packets at the intermediate hubs in TCP/IP (transmission control protocol/Internet protocol) networks. To accelerate the responsiveness of AQM framework, proportional-integral-differential (PID) controllers are utilized. In spite of its simplicity, it can effectively take care of a range of complex problems; however it is a lot complicated to track down optimal PID parameters with conventional procedures. A few new strategies have been grown as of late to adjust the PID controller parameters. Therefore, in this paper, we have developed a Squirrel search based PID controller to dynamically find its controller gain parameters for AQM. The controller gain parameters are decided based on minimizing the integrated-absolute error (IAE) in order to ensure less packet loss, high link utilization and a stable queue length in favor of TCP networks.

A Stabilized Queue Management Algorithm for Internet Congestion Control (인터넷 혼잡제어를 위한 안정적인 큐 관리 알고리즘)

  • 구자헌;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.70-80
    • /
    • 2004
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). But, RED configuration has been a problem since its first proposal. This problem is that proposed configuration is only good for the particular traffic conditions studied, but may have detrimental effects if used in other conditions. While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are unstable for tile various traffic conditions. The inherent problem with these queue management algorithms is that they all use static parameter setting. In this paper, in order to solve this problem, a new active queue management algorithm called SQM(Stabilized Queue Management) is proposed. This paper shows that it is easy to parameterize SQM algorithm to perform well under different congestion scenarios. This algorithm can effectively reduce packet loss while maintaining high link utilizations and is good for the various traffic conditions.

A Performance Analysis on the Scope/Filter of OSI Network Management Protocol (표준망관리 프로토콜의 Scope/Filter에 대한 성능분석)

  • 변옥환;진용옥
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.7
    • /
    • pp.10-18
    • /
    • 1992
  • In this paper, a simulation model for scope and filter parameters in CMIS/CMIP, OSI management protocol, has been discussed and the suitable scope type was represented by analyzing optimal polling time in network management system, queue size and response time. Scope and filter parameters in MGet, M-Set, M-Action, and =M-Delete services provide a scheme to select some managed objects, and the results are largely varied according to a scope type requested and the outcome of filtering. It has been simulated each scope type and all scope type mixed in a network by varying the offered load and a polling time. On the same time, the response time, queue size of the managing system and a delay time have been measured. As a results, the suitable scope type and polling time enhancing the network performance on the OSI network management is proposed.

  • PDF

A New Active RED Algorithm for Congestion Control in IP Networks (IP 네트워크에서 혼잡제어를 위한 새로운 Active RED 알고리즘)

  • Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.437-446
    • /
    • 2002
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF (Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED (Random Early Detection). While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use static parameter setting. So, in case where these parameters do not match the requirement of the network load, the performance of these algorithms can approach that of a traditional Drop-tail. In this paper, in order to solve this problem, a new active queue management algorithm called ARED (Active RED) is proposed. ARED computes the parameter based on our heuristic method. This algorithm can effectively reduce packet loss while maintaining high link utilizations.

Active Queue Management using Adaptive RED

  • Verma, Rahul;Iyer, Aravind;Karandikar, Abhay
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.275-281
    • /
    • 2003
  • Random Early Detection (RED) [1] is an active queue management scheme which has been deployed extensively to reduce packet loss during congestion. Although RED can improve loss rates, its performance depends severely on the tuning of its operating parameters. The idea of adaptively varying RED parameters to suit the network conditions has been investigated in [2], where the maximum packet dropping probability $max_p$ has been varied. This paper focuses on adaptively varying the queue weight $\omega_q$ in conjunction with $max_p$ to improve the performance. We propose two algorithms viz., $\omega_q$-thresh and $\omega_q$-ewma to adaptively vary $\omega_q$. The performance is measured in terms of the packet loss percentage, link utilization and stability of the instantaneous queue length. We demonstrate that varying $\omega_q$ and $max_p$ together results in an overall improvement in loss percentage and queue stability, while maintaining the same link utilization. We also show that $max_p$ has a greater influence on loss percentage and queue stability as compared to $\omega_q$, and that varying $\omega_q$ has a positive influence on link utilization.

An Adaptive Proportional Integral Active Queue Management Algorithm based on Self-Similar Traffic Rate Estimation in WSN

  • Liu, Heng;Wang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1946-1958
    • /
    • 2011
  • Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.

Congestion Control of TCP Network Using a Self-Recurrent Wavelet Neural Network (자기회귀 웨이블릿 신경 회로망을 이용한 TCP 네트워크 혼잡제어)

  • Kim, Jae-Man;Park, Jin-Bae;Choi, Yoon-Ha
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.325-327
    • /
    • 2005
  • In this paper, we propose the design of active queue management (AQM) control system using the self-recurrent wavelet neural network (SRWNN). By regulating the queue length close to reference value, AQM can control the congestions in TCP network. The SRWNN is designed to perform as a feedback controller for TCP dynamics. The parameters of network are tunes to minimize the difference between the queue length of TCP dynamic model and the output of SRWNN using gradient-descent method. We evaluate the performances of the proposed AQM approach through computer simulations.

  • PDF

A Study on a Queue Management Scheme for Alleviating the Impact of Packet Size on the Throughput (패킷 크기에 따른 처리율 영향을 완화하는 큐 관리 기법 연구)

  • 이성근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.4
    • /
    • pp.552-558
    • /
    • 2002
  • Differentiated services (DiffServ) architecture defines a new framework for the support of quality of service (QoS) in IP-based networks. RIO has received the most attention among all the active queue management mechanisms proposed for assured service in DiffServ environment. The paper proposed the enhanced RIO which could alleviate the impact of flow's packet sire on the realized throughput. The simulation results indicate that this mechanism, when combined with TSW as traffic conditioner, provide better throughput assurance and fair distribution of excess bandwidth independent of packet size of flows in case of well-provisioned network environment.

A Study on a Queue Management for Alleviating the Bandwidth Skew Problem in Differentiated Service Network (차별 서비스 네트워크에서 대역폭 스큐 문제를 완화하는 큐 관리 기법 연구)

  • 명성원;황구연;이성근
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.121-124
    • /
    • 2002
  • In Diffserv Network, RIO is the most effective active queue management algorithm. RIO, the enhanced queue management algorithm from RED, divides IN and OUT packets and manages them differently. one of the main problems for the implementation of RIO is the Bandwidth Skew problem for providing the Assured Service. In this paper, we will show the bandwidth skew problem in RIO and provide an enhanced RIO mechanism that will alleviate the bandwidth skew problem.

  • PDF

Application Study of FQ-CoDel Algorithm based on QoS-guaranteed Class in Tactical Network (전술환경에서 QoS 보장을 위한 클래스 기반 FQ-Codel 알고리즘 적용 연구)

  • Park, Juman
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.3
    • /
    • pp.53-58
    • /
    • 2019
  • This paper proposes a class-based FQ-CoDel(Flow Queue-Control Delay) algorithm. A variety of application system services create bottlenecks in tactical communication network and the bottlenecks cause some problems such as traffic loss and delay. Therefore, more research on effective traffic processing is needed. The proposed class-based FQ-CoDel algorithm, suggests dynamic buffer management and scheduling, classifies specific packets in each queue according to service attribute and criticality and checks periodically latency of the packets in each queue. Also, it abandons the packets if some packets stay in queue above schedule time and manages the total amount of traffic stored in queue with certain level.