The last several years has seen a renewed interest in smart queue management to curb excessive network queueing delay, as people have realised the prevalence of bufferbloat in real networks. However, for an effective deployment at today's last mile connections, an improved queueing algorithm is not enough in itself, as often the bottleneck queue is situated in legacy systems that cannot be upgraded. In addition, features such as per-user fairness and the ability to de-prioritise background traffic are often desirable in a home gateway.In this paper we present Common Applications Kept Enhanced (CAKE), a comprehensive network queue management system designed specifically for home Internet gateways. CAKE packs several compelling features into an integrated solution, thus easing deployment. These features include: bandwidth shaping with overhead compensation for various link layers; reasonable DiffServ handling; improved flow hashing with both per-flow and per-host queueing fairness; and filtering of TCP ACKs. Our evaluation shows that these features offer compelling advantages, and that CAKE has the potential to significantly improve performance of last-mile internet connections.
Prioritisation of different traffic classes can be performed by reacting to DiffServ markings @cite_22 . This is commonly used in WiFi networks, where DiffServ code points map traffic into four priority levels @cite_9 . For the home gateway use case, various schemes have been proposed in the literature (e.g., @cite_15 ), but as far as we are aware, none have seen significant deployment.
@cite_9 @cite_22 @cite_15
2058680606 1624947366 2133967495 2129263279
DiffServ-aware MPLS-TE (DS-TE) allows bandwidth reservation for Traffic Classes (TCs) in MPLS-based engineered networks and, as such, improves the basic MPLS-TE model. In DS-TE networks, per-Class quality of service guarantees are provided while being possible to achieve improved network utilization. DS-TE requires the use of a Bandwidth Allocation Model (BAM) that establishes the amount of bandwidth per-Class and any eventual sharing among them. This paper proposes a new bandwidth allocation model (AllocTC-Sharing) in which the higher priority traffic classes are allowed to use non allocated resources of lower priority traffic classes and vice versa. By adopting this “dual sense” allocation strategy for dynamic bandwidth allocation, it is shown that AllocTC-Sharing model preserves bandwidth constraints for traffic classes and improves overall link utilization. MPLS-TE (Multiprotocol Label Switching - Traffic Engineering) and DiffServ are technical alternatives used for supporting Traffic Engineering and QoS-demanding applications, such those typically found in multimedia multiservice networks. This paper proposes the ADAPT-RDM algorithm, suitable to allocation or not of LSPs (Label Switch Paths) according DiffServ-aware MPLS Traffic Engineering (DS-TE) and with the utilization of the RDM (Russian Doll Model) bandwidth constraint model. The principal objectives of the ADAPT-RDM algorithm are fundamentally the class types (CTs) priority preservation and the management of the bandwidth sharing capabilities of the RDM model. The paper describes the proposed algorithm and evaluates its results considering different implementation scenarios. A number of works have tried to adjust the contention window in order to provide differentiated quality of service in IEEE 802.11-based wireless networks. By giving different service classes different CWs, the distribution of backoff intervals (chosen randomly, on the interval [O, CW]) will reflect the desired service classes. However, these protocols cannot deliver firm service guarantees while maintaining high network utilization, particularly under congested network conditions. In this article we propose a new MAC protocol featuring a sliding CW (SCW) for each network flow. The SCW dynamically adjusts to changing network conditions, but remains within a per-class predefined range in order to maintain a separation between different service classes. Each flow's SCW reacts based on the degree to which class-defined QoS metrics are satisfied. Simulation results show that compared to the enhanced distributed coordination function (EDCF) scheme of 802.11e, SCW consistently excels, in terms of network utilization, strict service separation, and service-level fairness. We propose an efficient client-based approach for channel management (channel assignment and load balancing) in 802.11-based WLANs that lead to better usage of the wireless spectrum. This approach is based on a “conflict set coloring” formulation that jointly performs load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsically exposes opportunities for better channel re-use. Finally, algorithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a wide-range of in-building as well as outdoor scenarios. We have performed extensive packet-level simulations and measurements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in addition to single network scenarios, the conflict set coloring formulation is well suited for channel assignment where multiple wireless networks share and contend for spectrum in the same physical space. Our results over a wide range of both simulated topologies and in-building testbed experiments indicate that our approach improves application level performance at the clients by upto three times (and atleast 50 ) in comparison to current best-known techniques.