A UNIQUE MATHEMATICAL QUEUING MODEL FOR WIRED AND WIRELESS NETWORKS

The de-facto protocol for transmitting data in wired and wireless networks is the Transmission Control Protocol/Internet Protocol (TCP/IP). While a lot of modifications have been done to adapt the TCP/IP protocol for wireless networks, a lot remains to be done about the bandwidth underutilization caused by network traffic control actions taken by active queue management controllers currently being implemented on modern routers. The main cause of bandwidth underutilization is uncertainties in network parameters. This is especially true for wireless networks. In this study, two unique mathematical models for queue management in wired and wireless networks are proposed. The models were derived using a recursive, thirdorder, discrete-time structure. The models are; the Model Predictive Controller (MPC) and the Self-Tuning Regulator (STR). The MPC was modeled to bear uncertainties in gain, poles and delay time. The STR, with an assigned closed-loop pole, was modeled to be very robust to varying network parameters. Theoretically, the proposed models deliver a performance in network traffic control that optimizes the use of available bandwidth and minimizes queue length and packet loss in wired and wireless networks

A UNIQUE MATHEMATICAL QUEUING MODEL FOR WIRED AND WIRELESS NETWORKS

The de-facto protocol for transmitting data in wired and wireless networks is the Transmission Control Protocol/Internet Protocol (TCP/IP). While a lot of modifications have been done to adapt the TCP/IP protocol for wireless networks, a lot remains to be done about the bandwidth underutilization caused by network traffic control actions taken by active queue management controllers currently being implemented on modern routers. The main cause of bandwidth underutilization is uncertainties in network parameters. This is especially true for wireless networks. In this study, two unique mathematical models for queue management in wired and wireless networks are proposed. The models were derived using a recursive, thirdorder, discrete-time structure. The models are; the Model Predictive Controller (MPC) and the Self-Tuning Regulator (STR). The MPC was modeled to bear uncertainties in gain, poles and delay time. The STR, with an assigned closed-loop pole, was modeled to be very robust to varying network parameters. Theoretically, the proposed models deliver a performance in network traffic control that optimizes the use of available bandwidth and minimizes queue length and packet loss in wired and wireless networks

Distributed QoS Guarantees for Realtime Traffic in Ad Hoc Networks

In this paper, we propose a new cross-layer framework, named QPART ( QoS br>rotocol for Adhoc Realtime Traffic), which provides QoS guarantees to real-time multimedia applications for wireless ad hoc networks. By adapting the contention window sizes at the MAC layer, QPART schedules packets of flows according to their unique QoS requirements. QPART implements priority-based admission control and conflict resolution to ensure that the requirements of admitted realtime flows is smaller than the network capacity. The novelty of QPART is that it is robust to mobility and variances in channel capacity and imposes no control message overhead on the network

Active Queue Management for Fair Resource Allocation in Wireless Networks

This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users