An Efficient Queue Management (EQM) Technique for Networks

The Meeting Request Station for College HOD/Principal Meeting Management is a sophisticated automated system designed to streamline the process of scheduling meetings in academic institutions using embedded technology, IoT, and GSM communication. The system addresses the inefficiencies of traditional manual methods by providing a self-service terminal where students and faculty can independently submit meeting requests. Users interact with the station by selecting the purpose of their meeting, scanning a QR code displayed on the screen, and having the details automatically sent via SMS to a central management database. This real-time data transmission allows the HOD/Principal to access and manage meeting requests through a dedicated interface, where they can view requests, prioritize based on queue, and acknowledge or schedule meetings as per their availability. The system ensures that users receive automated SMS notifications about their meeting status, including updates on queue position and acceptance, thus eliminating the uncertainty and delays common in manual scheduling. The integration of an Arduino-based embedded platform with a color display and GSM module provides a cost-effective, scalable, and flexible solution suitable for various institutional requirements. Additionally, the automated nature of the system reduces the administrative burden on staff, who would otherwise need to handle requests manually. By enabling real-time communication and efficient queue management, the Meeting Request Station significantly enhances user experience, providing a structured approach to meeting scheduling. It addresses key challenges such as high administrative workload, lack of real-time updates, and ineffective communication. This system represents a practical and innovative approach to improving meeting management in academic settings, ensuring that scheduling is not only faster and more accurate but also user-friendly and resource-efficient.

This research focuses on the analysis and optimization of an N-policy two-phase queueing system, incorporating server dynamics such as start-up, time-out, breakdown and repair, while addressing uncertainties through fuzzy modeling. Traditional queueing models often use crisp values, which may not capture real-world variability effectively. To address this, the study employs triangular and trapezoidal fuzzy membership functions, representing uncertain parameters like arrival and service rates. The defuzzification process is crucial to convert these fuzzy parameters into precise, actionable values, enabling efficient decision-making. Two major defuzzification techniques are highlighted: the Robust ranking method and the DSW (Dong, Shah and Wong) algorithm. Both methods facilitate the conversion of fuzzy data into crisp numbers, improving the models practical applicability. The analysis also introduces the concept of α-cut techniques, which simplify fuzzy sets by breaking them into intervals for easier evaluation of system performance under different confidence levels. Numerical analysis illustrates the application of these fuzzy techniques in calculating essential performance measures, such as the expected system length and total cost. By utilizing fuzzy sets, the model provides a more realistic representation of systems in environments where variables like service rates are uncertain and fluctuate. The study emphasizes optimizing system performance and minimizing costs by accurately modeling uncertainties. Practical applications of this model are found in service industries where efficient queue management is crucial, such as banks, hospitals and manufacturing systems. The research provides a robust framework for assessing and improving the performance of queuing systems under uncertainty, offering insights for both theoretical advancements and real-world implementations.. KEYWORDS :DSW algorithm, Two-phase, Fuzzy queue and α-cut technique, Ranking Technique.

In a communication network, transmission control protocol (TCP) is used to avoid congestion through which the sources with small round trip time (RTT) allocate the bottleneck link unfairly. On the other hand, the bottleneck link capacity is time-varying in wireless access networks due to the fading effects and errors in the acknowledgment packets. Therefore, queue management is more sophisticated in wireless networks than that in wired ones. Also, when the number of the sources changes, the network acts as a switched system in which non-zero initial values cause the response not to converge to the desired value. The main contribution of this paper is to design a switched rate-based robust queue management (SRRQM) to control the congestion contemporary with weighted fairness and maximum utilization compatible with wireless access networks. Moreover, a procedure called initial value compensation (IVC) is designed to overcome the non-zero initial value effects. Two degree of freedom multi-loop internal model (TDF-MIM) method is used for robust congestion control. The utilization factors are designated proportionally to user's RTT values to ensure weighted fairness and maximum utilization. To the authors' knowledge, this is the first time that a SRRQM is designed for a wireless access network with the advantages of weighted fairness, maximum utilization and robustness against capacity variation, PER and changing in the number of the sources. Analytical and simulation results demonstrate the efficacy of the proposed procedure.

In this research, we focused on fair bandwidth allocation on the Internet. The Internet provides communication services based on exchanged packets. The bandwidth available for each customer is often fluctuated. Fair bandwidth allocation is an important issue for ISPs to gain customer satisfaction. Static bandwidth allocation allows an exclusive bandwidth for specific traffic. Although it gives communications a QoS guarantee, it requires muany bandwidth resources as known as over-provisioning. In contrast with static dynamic control allocates bandwidth resources dynamically. It therefore utilizes bandwidth use more effectively. However, it needs control overhead in monitoring traffic and estimating the optimum allocation. The Transmission Control Protocol, or TCP is the dominant protocol on the Internet. It is also equipped with a traffic-rate-control mechanism. An adaptive bandwidth-allocation mechanism must control traffic that is under TCP Rapid feedback makes it possible to gain an advantage over TCP In this paper, we propose an Adaptive Bandwidth Allocation (ABA) mechanism as a feedback system for MPLS. Our proposal allows traffic to be regulated adaptively as its own weight value which can be assigned by administrators. The feedback bandwidth allocation in the previous work needs control delay in collecting network status along the communication path. We call this round-trip feedback control. Our proposal, called feedback control, collects network status in half the time of roundtrip delay. We compare the performance of our one-way feedback-based mechanism and traditional feedback control under a simulation environment. We demonstrate the advantages of our rapid feedback control has using experimental results.

In this paper, an (ONU-load and RTTs)-based (OLR) dynamic wavelength and bandwidth allocation (DWBA) algorithm for upstream channel in next-generational Ethernet passive optical network (NG-EPON) is proposed. By proposing adaptive threshold grouping algorithm, the waste of bandwidth resources caused by massive guard timeslots and mismatch between assigned transmission window and frame size is reduced. By adjusting the Optical Network Unit (ONU) scheduling order, the idle time caused by Round-Trip Times (RTTs) is reduced. By proposing joint ONU grouping and RTT scheduling mechanism, load balance among wavelengths is achieved. By proposing a fair allocation scheme, the fairness of bandwidth granting for each ONU is ensured. Finally, by the simulation, the effectiveness of proposed algorithm is demonstrated. The simulation indicates that the rate of bandwidth utilization, the average package delay, the scheduling cycle and the network throughput in the system based on proposed algorithm have better performance.

Queue management and congestion control are very important to the robustness and fairness of the Internet. In this paper, a new queue management algorithm, termed self adjustable choke (SAC) is proposed to achieve both fairness and congestion control in an Internet router. It is based on the well-known RED algorithm and a recently proposed CHOKe algorithm. The SAC scheme has kept the advantages of simplicity and lower processing cost of RED and CHOKe, while solving their unfair bandwidth allocation properties. In particular, the SAC scheme treats TCP and UDP flows differently, and can adaptively adjust its parameters according to the current traffic status. As a result, using the SAC, bandwidth is distributed evenly among different flows, no matter how different these flows are. This will be demonstrated and compared to CHOKe using experimental results under various traffic scenarios.

Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems

In this paper, we investigate the bandwidth and power allocation problem in remote radio head cluster (RRHC)-based millimeter wave (mm-wave) massive MIMO heterogeneous cloud radio access networks with limited fronthaul capacity. The coordinated multipoint transmission is applied in each RRHC for cancelling the intra-cluster interference. To avoid the inter-tier interference, distinct bandwidths are allocated to macro base station and RRHs. Following this, we formulate a bandwidth and power allocation optimization problem to maximize the downlink weighted sum rate of the system subject to per-RRHC power and fronthaul capacity constraints, which is a non-convex optimization problem and is difficult to directly solve. Next, we fix the bandwidth allocation and the original problem can be divided into two independent optimization problems, i.e., the weighted sum rate maximization problems of MUs and RRH users, respectively. For the former, the convex optimization technique can be used to solve it. As for the latter, a two-loop iterative algorithm is proposed to deal with it. Specifically, we propose the price-based outer iteration to control the fronthaul capacity and the weighted minimum mean square error-based inner iteration to obtain the power allocation. To this end, a 1-D search method is adopted to find the optimal bandwidth allocation. Finally, numerical results are conducted to verify the effectiveness of the proposed algorithms under different parameters.

Heterogeneous networks (HetNets) composed of macrocells and small cells are expected to improve the transmission performance of users significantly. Designing efficient resource allocation schemes, specifically, bandwidth allocation and power allocation schemes for HetNets is of particular importance for it may affect user quality of service (QoS) and network performance severely. In this paper, we consider the resource allocation problem of a HetNet composed of a macrocell and a number of femtocells and propose a resource characteristic and user QoS oriented bandwidth and power allocation algorithm for the femto base stations (FBSs) which share spectrum with the macro base station. By taking into account the service requirements of the femto user equipments (FUEs) and the bandwidth resource characteristics of the network, various bandwidth resource allocation schemes are proposed. Particularly, in the case of slightly insufficient bandwidth resource, we propose a bankruptcy game based bandwidth resource allocation algorithm for the FBSs, and solve the bandwidth allocation problem by means of Shapley value method. To stress the tradeoff between data rate and power consumption, we examine the energy efficiency of the FBSs and formulate the power allocation problem as a multi-objective optimization problem with the objectives of maximizing the energy efficiency of all the FBSs. The optimal power allocation strategy can be obtained by solving the optimization problem via ideal point method and generic algorithm. Simulation results demonstrate the efficiency of the proposed algorithm.

Recently, a negative interplay has been shown to arise when scheduling/Active Queue Management (AQM) techniques and low-priority congestion control protocols are used together; namely, AQM resets the relative level of priority among congestion control protocols. This work explores this issue by carrying out a control-theoretic analysis of the dynamical system to prove some fundamental properties that fully characterize the reprioritization phenomenon. In particular, (i) we provide the closed-form solution of the equilibrium in the open loop (i.e., fixing a target loss probability p ); (ii) we provide a stability analysis and a characterization of the reprioritization phenomenon when closing the loop with AQM (i.e., that dynamically adjusts the system loss probability). Our results are important as the characterization of the reprioritization phenomenon is not only quantitatively accurate for the specific protocols and AQM considered but also qualitatively accurate for a broader range of congestion control protocol and AQM combinations. Finally, while we find a sufficient condition to avoid the reprioritization phenomenon, we also show, at the same time, such conditions to be likely impractical: Therefore, we propose a simple and practical system-level solution that is able to reinstate priorities among protocols.

Design of a fuzzy controller for active queue management

We use a previously developed nonlinear dynamic model of TCP to analyze and design active queue management (AQM) control systems using random early detection (RED). First, we linearize the interconnection of TCP and a bottlenecked queue and discuss its feedback properties in terms of network parameters such as link capacity, load and round-trip time. Using this model, we next design an AQM control system using the RED scheme by relating its free parameters such as the low-pass filter break point and loss probability profile to the network parameters. We present guidelines for designing linearly stable systems subject to network parameters like propagation delay and load level. Robustness to variations in system loads is a prime objective. We present no simulations to support our analysis.

Queue delay estimation and its application to TCP Vegas

A novel multibeam satellite system design is proposed in this paper based on jointly optimizing power and carrier allocation in order to best match the asymmetric traffic requests. This design introduces higher and asymmetric interference levels throughout the coverage. However, both power and bandwidth will be used more efficiently. Even though the problem of power and bandwidth allocation has been addressed in terrestrial wireless communications, it is new in satellite systems and since architecture and channel are different, available results and algorithms are not applicable to satellite payload systems. In this paper we formulate the resource allocation problem as max-min SINR balancing based on the recently introduced axiomatic-based interference model, but in addition, we also optimize the carrier allocation when performing the SINR balancing problem. An analytical solution for the optimal carrier allocation is proposed and we iteratively find the optimal power allocation for each beam. The Shannon (upper bound) and current state-of-the art PHY layer technology: DVB-S2 are proposed to be implemented in order to obtain the gap between them. Simulation results show significant improvements in terms of power gain, spectral efficiency and traffic matching ratio comparing with conventional system, which is designed based on uniform bandwidth and power allocation.

The subject matter of the article is the method of scheduling and active queues management on routers interfaces of telecommunication networks. The goal of the work is to develop and improve the method related to the optimization of queues management processes on routers interfaces of telecommunication networks and aimed at improving the indicators of the quality of service. The article solves optimization problems of Congestion Management, Resource Allocation and Congestion Avoidance on routers interfaces of telecommunication networks in the framework of the two-stage calculation method. Research methods are based on the results of analytical calculations obtained in the course of using the Optimization Toolbox package of the Mat lab environment. Wherein in the course of improving the queue management method on routers interfaces of telecommunication networks, a mathematical programming apparatus was used, containing linear programming functions. The following results were obtained – the improved method of scheduling and active queues management on routers interfaces of telecommunication networks with the coordinated, sequential and two-stage solution of such interface problems as Congestion Management, Resource Allocation, and Congestion Avoidance. Conclusions : using the proposed method of scheduling and active queue management had made to achieve an agreed solution to Congestion Management, Resource Allocation, and Congestion Avoidance problems. In the course of solving the optimization problem of Congestion Management, which was conditionally related to the first stage of calculations, it was possible to achieve optimal aggregation and allocation of packet flows over queues formed on the router interface based on the commensurability of their classes. In the course of solving the optimization problems of resource allocation, and congestion avoidance, which were conditionally related to the second stage of calculations, it was possible to achieve an optimal bandwidth allocation of the router interface between the queues formed on it, and minimize possible denials of service.