FAutoREDWithRED: An Algorithm to Increase the Fairness in Internet Routers

2011 ◽  
Vol 403-408 ◽  
pp. 3946-3952
Author(s):  
K. Chitra ◽  
G. Padmavathi
Keyword(s):  
Queue Length ◽  
Data Traffic ◽  
Good Service ◽  
Queuing Delay ◽  
Large Delay ◽  
Internet Routers ◽  
The Past ◽  
Link Utilization ◽  
Flow Information ◽  
Use Of Internet

Routers in Internet face the problem of congestion due to the increased use of Internet. AQM algorithm is a solution to the problem of congestion control in the Internet routers. As data traffic is bursty in routers, burstiness must be handled without comprising the high link utilization and low queuing delay. Congested link causes many problems such as large delay, unfairness among flows, underutilization of the link and packet drops in burst. There are various existing algorithms that have been evolved over the past few years to solve these problems of congestion in routers. RED based algorithms only use queue length as congestion indicator to indicate congestion. In this paper, we propose an AQM scheme that considers only the advantages of these queue length based and uses the flow information and satisfies the QOS requirements of the network. This proposed scheme aims to provide good service under unresponsive load and shields the responsive flows from unresponsive flows to offer a good QOS to all users.

Congestion Control Using Soft Computing

2010 ◽  
pp. 271-289
Author(s):  
T. Revathi ◽  
K. Muneeswaran
Keyword(s):  
Queue Length ◽  
Fuzzy Rule ◽  
Vital Role ◽  
Rate Of Change ◽  
Rule Base ◽  
Queue Management ◽  
Internet Routers ◽  
Fuzzy Rule Base ◽  
The Status

In the recent Internet era the queue management in the routers plays a vital role in the provision of Quality of Service (QoS). Virtual queue-based marking schemes have been recently proposed for Active Queue Management (AQM) in Internet routers. In this chapter, the authors propose Fuzzy enabled AQM (F-AQM) scheme where the linguistics variables are used to specify the behavior of the queues in the routers. The status of the queue is continuously monitored and decisions are made adaptively to drop or mark the packets as is done in Random Early Discard (RED) and Random Early Marking (REM) algorthms or schemes. The authors design a fuzzy rule base represented in the form of matrix indexed by queue length and rate of change of queue. The performance of the proposed F-AQM scheme is compared with several well-known AQM schemes such as RED, REM and Adaptive Virtual Queue (AVQ).

scholarly journals RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC

2008 ◽  
Vol 22 (4) ◽  
pp. 519-536 ◽  
Author(s):  
Kostia Avrachenkov ◽  
Uri Yechiali
Keyword(s):  
Analytic Solution ◽  
Data Flow ◽  
Transmission Control Protocol ◽  
Network Models ◽  
Retrial Queues ◽  
The Internet ◽  
Data Traffic ◽  
Finite Buffers ◽  
Internet Routers ◽  
Tcp Connections

Data on the Internet is sent by packets that go through a network of routers. A router drops packets either when its buffer is full or when it uses the Active Queue Management. Currently, the majority of the Internet routers use a simple Drop Tail strategy. The rate at which a user injects the data into the network is determined by transmission control protocol (TCP). However, most connections in the Internet consist only of few packets, and TCP does not really have an opportunity to adjust the sending rate. Thus, the data flow generated by short TCP connections appears to be some uncontrolled stochastic process. In the present work we try to describe the interaction of the data flow generated by short TCP connections with a network of finite buffers. The framework of retrial queues and networks seems to be an adequate approach for this problem. The effect of packet retransmission becomes essential when the network congestion level is high. We consider several benchmark retrial network models. In some particular cases, an explicit analytic solution is possible. If the analytic solution is not available or too entangled, we suggest using a fixed-point approximation scheme. In particular, we consider a network of one or two tandem M/M/1/K-type queues with blocking and with an M/M/1/∞-type retrial (orbit) queue. We explicitly solve the models with particular choices of K, derive stability conditions for K≥1, and present several graphs based on numerical results.

scholarly journals IMPACT OF COVID-19 ON EVENT INDUSTRY: EVENT AUDIENCE READINESS TOWARDS EVENT DIGITIZATION

2021 ◽  
Author(s):  
Marry Tracy Pawan ◽  
◽  
Juliana Langgat ◽  
Keyword(s):  
Quantitative Method ◽  
Focal Point ◽  
Good Service ◽  
The Public ◽  
Tourist Destinations ◽  
The Past ◽  
The World ◽  
Virtual Events ◽  
Industry Needs ◽  
The Impact

For the event organiser, Sabah is one of the states that becomes a focal point. As Sabah is one of the most popular tourist destinations, several large events such as the Sabah Jazz Festival, Pesta Lepa-lepa, Pesta Kaamatan, Pesta Kalimaran, and other festivals have been held. However, COVID 19’s disruptive impacts have had such a significant impact on the event sector. Most of the events are getting cancelled or postponed all over the world. Over the past several months, a significant number of meetings and conferences have been redesigned as virtual events. However, the event industry needs to know the readiness of the public towards the shifting from the physical to the digital. Therefore, the objective of this research is to determine the event audience readiness for digital events. It is important for the event industry to know the readiness and a good online platform in providing a good service to their audience. A quantitative method was used to conduct this study. The main finding will see how far our communities is ready to adapt the new norm. Based on the finding it shows that event audience are willing to adopt the event digitisation, and this is due to the impact of the COVID 19pandemic which was accelerating changes in event audience behaviour. This research will benefit the event organisers and help them prepare strategic plana to cater to the audience needs.

Management of Internet Bandwidth Implementing CoovaChilli and Free Radius

2020 ◽  
Vol 8 ◽  
pp. 56-60
Author(s):  
Rabindra Phoju ◽  
Krishna Prasad Bhandari
Keyword(s):  
Open Source ◽  
Rapid Growth ◽  
Cost Effective ◽  
Academic Institutions ◽  
Good Service ◽  
Error Message ◽  
Available Bandwidth ◽  
Wireless Users ◽  
Optimum Cost ◽  
Use Of Internet

With rapid growth in popularity and use of Internet in academic institutions, the institutions are struggling to keep up with the demand. They need capability to effectively control, monitor and optimize the available bandwidth to ensure good service at optimum cost. This paper has described implementation of Coovachilli and free radius for management of internet bandwidth in academic institutions. During this research, freeware tools such as Freeradius and CoovaChilli have been used to manage Internet bandwidth on a per-user basis based on user credentials. The mechanisms have been used to control bandwidth of Wireless users. Same can be used for wired connections also. When a user tries to connect, the user is redirected to a captive portal under CoovaChilli. There the user provides login and password. Based on the credentials thus provided, CoovaChilli checks identity with the Freeradius. If authorized, the client is allowed access with the bandwidth as mentioned in the profile of the user in WISPr attributes define in Radreply table of Freeradius. When the user is not authorized, CoovaChilli sends an error message. This paper demonstrates that bandwidth can be effectively monitored, managed and optimized by using cost-effective open-source tools in the existing network scenario of the institution.

scholarly journals ANALYSIS AND CONTROL OF BIFURCATION AND CHAOS IN AVERAGE QUEUE LENGTH IN TCP/RED MODEL

2008 ◽  
Vol 18 (08) ◽  
pp. 2449-2459 ◽  
Author(s):  
J. H. C. NGA ◽  
H. H. C. IU ◽  
B. W. K. LING ◽  
H. K. LAM
Keyword(s):  
Bifurcation Analysis ◽  
Queue Length ◽  
Network Performance ◽  
Transmission Control Protocol ◽  
Nonlinear Behavior ◽  
Random Early Detection ◽  
Network Systems ◽  
Bifurcation And Chaos ◽  
Queuing Delay ◽  
And Control

This paper studies the bifurcation and chaos phenomena in average queue length in a developed Transmission Control Protocol (TCP) model with Random Early Detection (RED) mechanism. Bifurcation and chaos phenomena are nonlinear behavior in network systems that lead to degradation of the network performance. The TCP/RED model used is a model validated previously. In our study, only the average queue size [Formula: see text] is considered, and the results are based on analytical model rather than actual measurements. The instabilities in the model are studied numerically using the conventional nonlinear bifurcation analysis. Extending from this bifurcation analysis, a modified RED algorithm is derived to prevent the observed bifurcation and chaos regardless of the selected parameters. Our modification is for the simple scenario of a single RED router carrying only TCP traffic. The algorithm neither compromises the throughput nor the average queuing delay of the system.

scholarly journals Physical Layer Security in Wireless Communication: An Overview

2021 ◽  
Author(s):  
Shrishti Gaur ◽  
Neetu Sood
Keyword(s):  
Wireless Communication ◽  
Data Security ◽  
Physical Layer Security ◽  
Communication Systems ◽  
Visible Light Communication ◽  
Physical Layer ◽  
Data Traffic ◽  
High Data ◽  
The Past ◽  
Traditional Technologies

In the past few decades wireless communication has been growing with leaps and bounds characterised by demand for safer, faster and enhanced communication systems. Exploiting the physical properties of communication through appropriate signalling and coding processes, the concept of Physical Layer Security (PLS) has intensified. Consequently, the pursuit for this fulfilment has led to surfacing of inevitable high data traffic and challenges with data security. For futuristic technologies like 5G and beyond, traditional technologies like Radio Frequency (RF) unaccompanied have proved to be rather inefficient and search for alternative and upgraded technologies like Visible Light Communication (VLC) has gained momentum. However, VLC technology is not sufficient in all terms and in combination with RF demonstrates superior capabilities. In this paper an attempt has been made to evaluate the importance of PLS systems and the depth and degree up to which engineers and researchers have been able to reach in attaining robustness and resilience in it as an integral aspect of RF and VLC systems.

scholarly journals Fine-grained load balancing with traffic-aware rerouting in datacenter networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Tao Zhang ◽  
Yasi Lei ◽  
Qianqiang Zhang ◽  
Shaojun Zou ◽  
Juan Huang ◽  
...  
Keyword(s):  
Load Balancing ◽  
Large Scale ◽  
Queuing Delay ◽  
Packet Reordering ◽  
Fine Grained ◽  
Network Bandwidth ◽  
Performance Requirements ◽  
Delay Sensitive ◽  
Link Utilization ◽  
Datacenter Networks

AbstractModern datacenters provide a wide variety of application services, which generate a mix of delay-sensitive short flows and throughput-oriented long flows, transmitting in the multi-path datacenter network. Though the existing load balancing designs successfully make full use of available parallel paths and attain high bisection network bandwidth, they reroute flows regardless of their dissimilar performance requirements. The short flows suffer from the problems of large queuing delay and packet reordering, while the long flows fail to obtain high throughput due to low link utilization and packet reordering. To address these inefficiency, we design a fine-grained load balancing scheme, namely TR (Traffic-aware Rerouting), which identifies flow types and executes flexible and traffic-aware rerouting to balance the performances of both short and long flows. Besides, to avoid packet reordering, TR leverages the reverse ACKs to estimate the switch-to-switch delay, thus excluding paths that potentially cause packet reordering. Moreover, TR is only deployed on the switch without any modification on end-hosts. The experimental results of large-scale NS2 simulations show that TR reduces the average and tail flow completion time for short flows by up to 60% and 80%, as well as provides up to 3.02x gain in throughput of long flows compared to the state-of-the-art load balancing schemes.

Active Queue Management in RED Considering Critical Point on Target Queue

2021 ◽  
Vol 21 (03) ◽  
Author(s):  
Soamdeep Singha ◽  
Biswapati Jana ◽  
Niranjan Kumar Mandal
Keyword(s):  
Critical Point ◽  
Queue Length ◽  
Priority Queue ◽  
Congestion Management ◽  
Delivery Ratio ◽  
Queue Size ◽  
Maximum Probability ◽  
Minimum Threshold ◽  
Queuing Delay ◽  
Maximum Threshold

The basic philosophy behind RED is to prevent congestion. When the average queue length exceeds the minimum threshold, packets are randomly dropped, or the explicit congestion notification bit is marked. Since network requirements differ significantly, it is not an optimal approach to establish RED parameters with constant value. There is a new algorithm we are proposing called Critical Point on Target Queue (AQM-RED-CPTQ), provide greater congestion management over the network while also preserving the value of RED. To overcome the problem in RED without changing queue weight parameter, we have proposed few models to control the congestion by introducing range parameter with probability and control mechanism which will belong between minimum and maximum threshold. The current queue size is controlled together with average queue size. A new range variable has been introduced to improve the performance of priority queue of existing RED based algorithm which improves the overall performance of networks. For each packet, minimum and maximum threshold has been updated and dropped with probability (Pa) for a special condition. Instead of multiplicative increase and decrease the maximum probability, the scheme uses additive-increase and multiplicative-decrease. Once the AVG queue length is close to the minimum threshold value, our approach automatically sets queue parameter according to queue conditions and handles queuing delay and improve throughput. The simulated results proof that our approaches are better than RED in terms of throughput, end to end delay, packet delivery ratio and goodput.

Supporting Quality of Service for Internet Multimedia Applications

2011 ◽  
pp. 3622-3628
Author(s):  
Yew-Hock Ang
Keyword(s):  
Quality Of Service ◽  
Large Scale ◽  
The Internet ◽  
Digital Audio ◽  
Data Traffic ◽  
Service Model ◽  
The Past ◽  
Ip Multicasting ◽  
Scale Experiment

The Internet has gone from near-invisibility to near-ubiquity and penetrated into every aspect of society in the past decades (Department of Commerce, 1998). The application scenarios have also changed dramatically, and now demand a more sophisticated service model from the network. In the early 1990s, there was a large-scale experiment in sending digitized voice and video across the Internet through a packetswitched infrastructure (Braden, Clark, & Shenker, 1994). These highly-visible experiments have depended upon three enabling technologies: (1) Many modern workstations now come equipped with built-in multimedia hardware, (2) IP multicasting, which was not yet generally available in commercial routers, and (3) Highly-sophisticated digital audio and video applications have been developed. It became clear from these experiments that an important technical element of the Internet is still missing: multimedia, which dominate increasing proportion of today’s data traffic, are not well supported on the Internet.

Sign in / Sign up

Export Citation Format

Share Document