Skip to main content
Article thumbnail
Location of Repository

A discrete-time performance model for congestion control mechanism using queue thresholds with QOS constraints

By Lin Guan, Mike E. Woodward and Irfan U. Awan

Abstract

This paper presents a new analytical framework for the congestion control of Internet traffic using a\ud queue threshold scheme. This framework includes two discrete-time analytical models for the performance\ud evaluation of a threshold based congestion control mechanism and compares performance measurements through\ud typical numerical results. To satisfy the low delay along with high throughput, model-I incorporates one\ud threshold to make the arrival process step reduce from arrival rate ¿1 directly to ¿2 once the number of packets in\ud the system has reached the threshold value L1. The source operates normally, otherwise. Model-II incorporates\ud two thresholds to make the arrival rate linearly reduce from ¿1 to ¿2 with system contents when the number of\ud packets in the system is between two thresholds L1 and L2. The source operates normally with arrival rate ¿1\ud before threshold L1, and with arrival rate ¿2 after the threshold L2. In both performance models, the mean packet\ud delay W, probability of packet loss PL and throughput S have been found as functions of the thresholds and\ud maximum drop probability. The performance comparison results for the two models have also been made\ud through typical numerical results. The results clearly demonstrate how different load settings can provide\ud different tradeoffs between throughput, loss probability and delay to suit different service requirements

Topics: Queueing Theory, Markov Chain, Queue Thresholds, Congestion Control
Year: 2005
OAI identifier: oai:bradscholars.brad.ac.uk:10454/473
Provided by: Bradford Scholars

Suggested articles

Citations

  1. (1993). A New Congestion Control Algorithm for Sack Tcp with RED Routers"
  2. (2001). A Time-Scale Decomposition Approach to Adaptive ECN Marking”, Proceeding of INFOCOM’2001, doi
  3. (2000). An Enhanced Random Early Marking Algorithm for Internet Flow Control doi
  4. (1993). Communication and Computer Networks: Modelling with discrete- time queues, doi
  5. (1999). Distributed Connection Acceptance Control for a Connectionless Network”, Proceeding of the 16th Intl. Teletraffic Congress,
  6. (1999). Distributed Connection Acceptance Control for a Connectionless Network”, Proceeding of the th Intl. Teletraffic Congress,
  7. (2000). End-to-End Congestion Control: Utility Function, Random Losses and ECN Marks”, doi
  8. (1997). Irfan Awan received his PhD in
  9. (2000). On Designing Improved Controllers for AQM Routers Supporting TCP Flows”, UMass CMPSCI
  10. (1993). Random Early Detection Gateways for Congestion Avoidance”, doi
  11. (1999). Ransom Early Marking for Internet Congestion Control”, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.