Skip to content
Research Article Open access CC BY 4.0

Packets’ Congestion Management with Fuzzy Admission Control Policy for Differentiated Service Networks

Adio T. Akinwale, Adesina S. Sodiya, Simeon A. Akinleye, Adegbuyi D. Gbadebo

Asian Journal of Research in Computer Science · pp. 37–50 · Published 16 Jan 2024

10.9734/ajrcos/2024/v17i2418

Abstract

This study presents a priority-based admission control system for ensuring stability in a differentiated service network using a fuzzified admission policy. Packets of varying sizes of data were transmitted from N sources through a traffic conditioner which categorizes the packets into two independent sources, consequently classifying them into “high” and “low” priorities. While class A packets are not denied admission into the buffer, this is not the case with packets of class B. Arrivals from both sources follow a Poisson distribution process of\(\alpha\)(k) = (\(\lambda\) /k!)e -\(\lambda\) . It is assumed that r > h / \(\mu\)   in order to avoid a situation in which a class B arrival is denied admission while the system is empty. The arrival rates  \(\lambda\) 1 \(\in\) [02\(\mu\) ) and \(\lambda\)2 \(\in\) [02 \(\alpha\)) serve as fuzzy inputs with four linguistic values while the output is a decision, d. Simulation started with an initial state, zero and system performance for the first 300time units was monitored. Results indicate that the admission controller admits arriving class B packets provided that the value of y ≤ 4 while it denied admission to arriving class B packets when y > 4, thus giving a threshold policy of y=4 . Arrivals denied admission are dropped and transmitted to the “tree manager” via the bottleneck router. These packets are arranged as nodes in an AVL tree structure which adopts tree properties to manage and transmit nodes to the buffer based on node rotations.

Tree structure node transmission tree manager network traffic

References (17)

  1. 1 Explicit allocation of best-effort packet delivery service [DOI]
  2. 2 Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management
  3. 3 Stochastic Performance Analysis of Network Function Virtualization in Future Internet [DOI]
  4. 4 An efficient and self-adapting colour-image encryption algorithm based on chaos and interactions among multiple layers [DOI]
  5. 5 QUIC – UDP-Based Multiplexed and Secure Transport [DOI]
  6. 6 Analysis and simulation of fuzzy queues [DOI]
  7. 7 Understanding bufferbloat in cellular networks [DOI]
  8. 8 Piece of CAKE: A Comprehensive Queue Management Solution for Home Gateways [DOI]
  9. 9 Admission control for finite capacity queueing model with general retrial times and state-dependent rates [DOI]
  10. 10 A review on Queue Management Algorithms in Large Networks [DOI]
  11. 11 Mathematical Modeling and Computation of Real-Time Problems [DOI]
  12. 12 Introduction to computer networks
  13. 13 Performance Analysis of Markov Retrial Queueing Model under Admission Control F-Policy [DOI]
  14. 14 International Journal of Recent Technology and Engineering (IJRTE) [DOI]
  15. 15 The Flow Queue CoDel Packet Scheduler and Active Queue Management Algorithm [DOI]
  16. 16 FUZZY CONTROL OF QUEUEING SYSTEMS [DOI]
  17. 17 Congestion Control and Active Queue Management During Flow Startup

Cited by 0

No indexed citations yet.

Related research

Article metrics

Real usage data collected on this platform.

29

Page views

0

PDF downloads

3

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.