Sliding-Mode-Based Congestion Control and Scheduling for Multiclass Traffic Over Per-Link Queueing Wireless Networks

Abstract

This paper considers the problem of joint congestion control and scheduling in wireless networks with quality of service (QoS) guarantees. Different from per-destination queueing in the existing works, which is not scalable, this work considers per-link queueing at each node, which significantly reduces the number of queues per node. Under per-link queueing, we formulate the joint congestion control and scheduling problem as a network utility maximization (NUM) problem and use a dual decomposition method to separate the NUM problem into two sub-problems, i.e., a congestion control problem and a scheduling problem. Then, we develop a sliding mode (SM) based distributed congestion control scheme, and prove its convergence and optimality property. Different from the existing schemes, our congestion control scheme is capable of providing multi-class QoS under the general scenario of multi-path and multi-hop; in addition, it is robust against network anomalies, e.g., link failures, because it can achieve multi-path load balancing. Index TermsSliding mode control, per-link queue, QoS, multi-path, stochastic optimization, interactive multimedia, robustness against network anomalies.

Joint QoS provisioning and congestion control for multi-hop wireless networks

“…Huang et al combined a window-based flow control and a distributed rate-based scheduling with the objective of maximizing the total utility and achieving low end-to-end delay [18]. Zhou et al proposed a joint rate control, routing, and scheduling algorithm to provide proportional delay services [44] or maximize network utility [45]. We focus congestion control and QoS provisioning from the protocol perspective and study a novel joint DQS and Semi-TCP scheme in this paper.…”

Congestion Control Based on Sliding Mode Control and Scheduling With Prioritized Queuing for Wireless Networks

“…Where, is Lagrangian price [1], this lagrangian price can be updated according to λ i,j t = [ y i,j X, t x i,j − F i,j 0 + F i,j in ] (5)…”

“…In wireless networks congestion control and scheduling are the key features that are to be considered. The joint congestion control and scheduling in wireless network can be represented by NUM problem which calculates the sum of link prices [1]- [3].…”