Fair Bandwidth Distribution Research Articles

Comparative Analysis of Quality of Service (QoS) on WLAN Network Bandwidth Management using HTB Method with PCQ

This study explores bandwidth management on WLAN networks using Hierarchical Token Bucket (HTB) and Per Connection Queue (PCQ) methods to optimize Quality of Service (QoS). With the growing role of IT in both business and public sectors and increasing WLAN access, effective bandwidth management has become crucial to prevent certain users from monopolizing bandwidth for upload or download activities. The research involves data collection through observation and literature review, designing a network topology, implementing bandwidth management using HTB and PCQ, and analyzing performance with QoS parameters: throughput, delay, jitter, and packet loss. The results show that the HTB method achieves an average throughput of 97%, a delay of 98 ms, a jitter of 77 ms, and no packet loss, making it ideal for networks requiring priority-based bandwidth allocation for performance-sensitive applications. In contrast, the PCQ method yields an average throughput of 93.5%, a delay of 217 ms, a jitter of 55 ms, and no packet loss, which is better suited for evenly distributing bandwidth among users. Thus, HTB is recommended for priority-based networks, while PCQ supports fair bandwidth distribution across users.

BANDWIDTH OPTIMIZATION BY TRAFFIC CLASSIFICATION INMULTIMEDIA BROADBAND NETWORKS

In last decade, high bandwidth consumption of Peer to Peer (p2p) applications hasresulted increased bandwidth demandand service quality issues for critical business applications. Pastresearchsuggestedthat traffic filtering of unwanted traffic and rate limitation of bandwidth hungryapplications can result in fair distribution and optimization of available bandwidth. In this context weproposed and implemented internet traffic rate limiter and bandwidth optimizer based on FreeBSD(v8.1) operating system. The prioritized traffic flows throughput was increased by 5% and network latencywas reduced by 9.5%, which improved quality of service of prioritized traffic flows.

Fairness-Oriented Semichaotic Genetic Algorithm-Based Channel Assignment Technique for Node Starvation Problem in Wireless Mesh Networks.

Wireless mesh networks (WMNs) have emerged as a scalable, reliable, and agile wireless network that supports many types of innovative technologies such as the Internet of Things (IoT), Wireless Sensor Networks (WSN), and Internet of Vehicles (IoV). Due to the limited number of orthogonal channels, interference between channels adversely affects the fair distribution of bandwidth among mesh clients, causing node starvation in terms of insufficient bandwidth distribution, which impedes the adoption of WMN as an efficient access technology. Therefore, a fair channel assignment is crucial for the mesh clients to utilize the available resources. However, the node starvation problem due to unfair channel distribution has been vastly overlooked during channel assignment by the extant research. Instead, existing channel assignment algorithms equally distribute the interference reduction on the links to achieve fairness which neither guarantees a fair distribution of the network bandwidth nor eliminates node starvation. In addition, the metaheuristic-based solutions such as genetic algorithm, which is commonly used for WMN, use randomness in creating initial population and selecting the new generation usually leading the search to local minima. To this end, this study proposes a Fairness-Oriented Semichaotic Genetic Algorithm-Based Channel Assignment Technique (FA-SCGA-CAA) to solve node starvation problem in wireless mesh networks. FA-SCGA-CAA maximizes link fairness while minimizing link interference using a genetic algorithm (GA) with a novel nonlinear fairness-oriented fitness function. The primary chromosome with powerful genes is created based on multicriterion links ranking channel assignment algorithm. Such a chromosome was used with a proposed semichaotic technique to create a strong population that directs the search towards the global minima effectively and efficiently. The proposed semichaotic technique was also used during the mutation and parent selection of the new genes. Extensive experiments were conducted to evaluate the proposed algorithm. A comparison with related work shows that the proposed FA-SCGA-CAA reduced the potential node starvation by 22% and improved network capacity utilization by 23%. It can be concluded that the proposed FA-SCGA-CAA is reliable to maintain high node-level fairness while maximizing the utilization of the network resources, which is the ultimate goal of many wireless networks.

Adaptive Queue Management and Traffic Class Priority Based Fairness Rate Control in Wireless Sensor Networks

Congestion control in Wireless Sensor Networks (WSNs) is one of the key areas of research and different algorithms have been proposed using either of the notions of fair rate allocation, traffic class priority, and queue management. Use of the any one of the above is not adequate to address the challenges. Hence, in this paper, we have proposed a novel congestion control algorithm using the combined notions of fair allocation of bandwidth, prioritizing traffic classes, and Adaptive Queue Management (ADQM). The proposed Weighted Priority based Fair Queue Gradient Rate Control (WPFQGRC) scheme achieves the fair distribution of spare bandwidth by considering the traffic class priority, average queue size, and the connected loads of a node. Average queue size at every node is adapted based on the proposed notion of the gradient of the differential of Global Priority (GP) with respect to the differential of queue size. The output rate of a given node is computed based on the GP of the node and the average queue size. The spare bandwidth of a node is fairly distributed by taking into account the connected load of the given node. The proposed algorithm is developed to suit to a general topology of WSN, however for the sake of illustration, we have considered a tree topology network that deals with both Real-Time (RT) and Non-Real Time (NRT) traffic classes. The proposed algorithm is implemented in NS3 platform in Linux environment and the performance of the algorithm is evaluated in terms of throughput, packet loss, packet delay, traffic class patterns, node mobility, and the average queue size. The performance of the proposed algorithm is found to be superior to that of Yaghmaee et al. ’s, Brahma et al. ’s, Monowar et al. ’s, Sarode et al. ’s, Difference of Differentials Rate Control (DDRC), Weighted Priority based DDRC (WPDDRC), and Priority based Fairness Rate Control (PFRC) algorithms respectively.

Dynamic scheduling in TWDM-PONs using game theory

Efficient utilization of Passive Optical Networks (PONs) within a broad region of high user numbers, heavy bandwidth demand and large-scale central servicing stations seems a challenging task in explosive high-bandwidth environments. New Generation PONs (NG-PONs) enable multiple channels in both directions and they seem promising towards meeting advanced user applications and services. However, sophisticated bandwidth distribution should be in place to ensure appropriate allocation and efficient management of heavy user demands subject to the available channels. Most of the literature on dynamic bandwidth distribution in NG-PONs usually pertains to heuristic techniques that may be susceptible to expert bias, require substantial knowledge and experience to be applied and their evaluation may focus primarily on minor issues vs. few fundamental major ones. To surpass these limitations game theory can be applied to address efficiently the above heuristic disadvantages and solve the heavy user load-heavy demand over large bandwidth problem in a stochastic way. This work presents the next step forwards using multi-channel multi-stochastic reasoning by utilizing the full channel range to satisfy fairly user requests and high network traffic within a NG-PON2 network. We present the full algorithm as applied to standardized NG-PON2 as well as a series of evaluation experiments to prove its applicability in terms of fairness, goodput and delay. According to the simulation results, the proposed scheme succeeds to provide a fair bandwidth distribution, when triggered, while it is able to a) reduce the experienced delay from 1 to 6 msec and b) double the offered goodput compared to the pure allocation scheme.

Addressing the interdependence in providing fair and efficient bandwidth distribution in hybrid optical‐wireless networks

SummaryThe convergence of optical and wireless technologies may offer a compelling network access infrastructure because these technologies combine major benefits such as large coverage in the wireless part and huge bandwidth in the optical part of the converged access network. The convergence of the passive optical networks with 4G wireless standards, such as the Worldwide Interoperability for Microwave Access and the Long Term Evolution, constitutes a quite attractive solution to meet the challenges of the modern bandwidth‐hungry access networks. One of the most important objective a modern access network has to address is the adequate bandwidth distribution to the final users. In addition, several other aims are emerged towards this goal, such as fairness and quality of service provisioning. The adversity of designing an efficient bandwidth distribution scheme for hybrid optical‐wireless access networks lies in the interdependence of both domains: the bandwidth distribution in the wireless domain depends on the optical transmission grant opportunities, while the bandwidth coordinator in the optical part has to be aware of the mobile user heterogeneity in the wireless domain. Moreover, the bandwidth decision‐making module in both networks has to be aware of providing a fair allocation independently of the number of mobile users or the traffic requests in the network. In this work, we endeavor to address the aforementioned challenges. A novel, fair, and efficient bandwidth distribution scheme is proposed for hybrid optical‐wireless access networks. By using weighted fairness provisioning techniques, the proposed scheme intends to alleviate the interdependence of the two domains, offering a fair and efficient bandwidth distribution to the mobile users. The weights are properly defined, by utilizing suitable optimization techniques such as the Lagrange multiplies, so as to incorporate the underlying features of each traffic requests, such as the population density and the propagation delay. Extensive simulation results indicate the capability of the proposed scheme, compared with other competitive allocation schemes, in provisioning a more efficient and fair bandwidth distribution in terms of latency, throughput, and packet drop ratio. Copyright © 2015 John Wiley & Sons, Ltd.

The max–min fair approach on dynamic bandwidth allocation for XG‐PONs

AbstractXG‐PON is the latest ITU‐T PON standard for passive optical networks (PONs), which provide broadband access to the end user at line rates of up to 10 Gb/s. The most important issue that is not strictly defined in the standard and is left to vendors to implement is the allocation of the shared upstream bandwidth. An efficient allocation mechanism must be applied on the upstream direction in order to assure acceptable packet latency and fairness among multiple subscribers. Within this context, we propose an XG‐PON‐oriented dynamic bandwidth allocation algorithm that implements a max–min fair scheme to distribute the available upstream capacity to all the connected optical network units (ONUs) at the PON. Because frequent bandwidth granting and queue occupancy reporting account for low latency, our algorithm adopts a method in which every ONU is granted a portion of bandwidth at every downstream frame. The bandwidth grant is either calculated directly from the latest occupancy report or inferred from previous reports by means of traffic prediction. Our simulation results show that the proposed algorithm achieves fair bandwidth distribution among the ONUs along with low packet latency and latency jitter, irrespectively of the ONUs's spatial separation from the optical line terminal. Copyright © 2014 John Wiley & Sons, Ltd.

A Traffic Marker to Improve the Fairness among Aggregated Flows in DiffServ Networks

The fair distribution of bandwidth among different flows is an important research issue in the differentiated services architecture. In this paper FATM (a fair aggregate traffic marker) is proposed to provide the fairness among aggregate flows. FATM guarantees the fairness among the aggregate traffic flows by considering CIR of an aggregate traffic, and also considers maintaining estimated arrival rate for each flow within an aggregate at the boundary router.

Fair Bandwidth Sharing Scheme Based on Upload Traffic Control

The current paper presents the evaluation of new fair downstream bandwidth sharing strategy and effective shared link utilization for TCP/IP networks. The proposed method provides download bandwidth fair sharing among multiple data flows based on their upload per-flow rate limitation. We evaluate the current approach by controlling upload rate to obtain fair download bandwidth sharing for each of the flows in the link. The performance of the proposed method is evaluated on physical test network. The experimental results demonstrate that our approach can successfully provide fair bandwidth distribution among multiple data flows and can be promising method for bandwidth management in the real data networks. DOI: http://dx.doi.org/10.5755/j01.eee.20.1.6172

M2I2tswTCM: A new efficient optimization marker algorithm to improve fairness bandwidth in DiffServ networks

The Quality of Service (QoS) requirement Differentiated Services (DiffServ) typically having three main categories of performance metrics—bandwidth, latency and jitter. Although the DiffServ routers provide Per Hop Behaviours (PHBs) to aggregate traffic for different levels of service through the Assured Forwarding (AF) by provides service differentiation to aggregates, an unfairness problem still occurs in DiffServ networks. In order to improve bandwidth fairness along with efficient optimization to alleviate this problem, this article proposes a Double Modified Double Improved time sliding window Three Colour Marker (M2I2tswTCM) algorithm , which makes a new value of γ that depends on the logarithm peak information rate (PIR) and which is added to the adaptive factor that exists in the previous algorithm. Through extensive simulation implementation using the NS-2 under DiffServ network, we compare the fairness of the proposed algorithm with previous algorithms. The results show that the M2I2tswTCM algorithm performed better than the seven marker algorithms in terms of fair bandwidth distribution for different network provision levels.

Achieving fair bandwidth distribution in WiFi Networks: a Game Theoretical Approach

AbstractAchieving fair bandwidth distribution among uplink and downlink flows in IEEE 802.11 infrastructure networks is a complex issue, due to the well-known features of the Distributed Coordination Function (DCF) which regulates the access to the shared medium. Indeed, the dynamic adaptation of the contention windows causes phenomena of short-term unfairness, while the use of homogeneous contention parameters among the contending nodes makes the aggregated downlink bandwidth equal to the uplink bandwidth of a single node. We propose a dynamic tuning of the contention parameters used by the nodes, based on simple network monitoring functionalities and rational strategies. Specifically, we propose a game-theoretic analysis of such tuning, devised to guarantee a fair resource sharing among the nodes, while optimizing the per-node uploading and downloading bandwidth.

A provision-aware fair bandwidth distribution marker algorithm for DiffServ networks

The rise in demand for real-time applications on the Internet necessitates Quality of Service (QoS). Differentiated Services (DiffServ) is one of the technologies used currently to provide QoS and service differentiation. It is simple and scalable. It provides service differentiation to aggregates, mainly through the Assured Forwarding (AF) per-hop behaviour. Previous work on fair sharing of network bandwidth did not adequately address the Under-Provisioned Network (UPN) condition. In this paper, we propose a new three-colour marker, named paItswTCM (provision-aware Improved TSW based Three-Colour Marker). We compare our new algorithm with both time-sliding window markers and token-bucket-based markers using simulations. Results show that our new provision-aware marker outperforms these previous algorithms not only in the UPN condition but also for low to medium network provision levels. We conclude that to achieve proportional sharing of bandwidth, no packet type should be injected at the expense of others.

A Wavelength and Bandwidth Assignment Algorithm to Support Guaranteed Bandwidth Levels in Hybrid Time Division Multiplexing/Wavelength Division Multiplexing Ethernet Passive Optical Networks

A novel bandwidth assignment algorithm in wavelength division multiplexing Ethernet passive optical networks, called a dynamic wavelength assignment service level agreement, is proposed to efficiently provide subscriber differentiation. Simulation results show that the dynamic wavelength assignment service level agreement outperforms other bandwidth allocation algorithms in wavelength division multiplexing Ethernet passive optical networks, as it makes a fairer bandwidth distribution than other methods and is able to overcome the non-allowed packet fragmentation of the Ethernet passive optical network standard. Consequently, it greatly increases the achieved throughput and always ensures a minimum guaranteed bandwidth to every priority subscriber. Furthermore, the new algorithm obtains lower mean packet delay and packet loss rate for the highest priority subscribers when compared with other bandwidth distribution schemes in wavelength division multiplexing Ethernet passive optical networks.

High Throughput Disk Scheduling with Fair Bandwidth Distribution

Mainstream applications-such as file copy/transfer, Web, DBMS, or video streaming-typically issue synchronous disk requests. As shown in this paper, this fact may cause work-conserving schedulers to fail both to enforce guarantees and provide a high disk throughput. A high throughput can be, however, recovered by just idling the disk for a short time interval after the completion of each request. In contrast, guarantees may still be violated by existing time-stamp-based schedulers because of the rules they use to tag requests. Budget Fair Queuing (BFQ), the new disk scheduler presented in this paper, is an example of how disk idling, combined with proper back-shifting of request time stamps, may allow a time-stamp-based disk scheduler to preserve both guarantees and a high throughput. Under BFQ, each application is always guaranteed-over any time interval and independently of whether it issues synchronous requests-a bounded lag with respect to its reserved fraction of the total number of bytes transferred by the disk device. We show the single-disk performance of our implementation of BFQ in the Linux kernel through experiments with real and emulated mainstream applications.

EPON bandwidth allocation algorithm based on automatic weight adaptation to provide client and service differentiation

In this article, a new dynamic bandwidth allocation algorithm for the upstream channel of Ethernet Passive Optical Networks, called DySLa, is proposed not only to provide service differentiation but also to offer subscriber differentiation. In contrast to previous methods in which the performance of each class of service is not insured, DySLa is continuously evaluating the mean packet delay and guarantees that the highest priority services fulfil the packet delay requirements in the access network for every type of client. Simulation results show that DySLa can maintain both the mean packet delay and packet loss ratio below the maximum upper bounds permitted for the most sensitive services of every class of customer. Moreover, DySLa outperforms other dynamic bandwidth allocation algorithms which provide service and client differentiation and it makes a fairer bandwidth distribution than those methods.

Improving fairness among TCP flows by stateless buffer control with early drop maximum

Transmission control protocol (TCP) has been recognized as the most important transport-layer protocol for the Internet. It is distinguished by its reliable transmission, flow control, and congestion control. However, the issue of fair bandwidth-sharing among competing flows was not properly addressed in TCP. As web-based applications and interactive applications grow more popular, the number of short-lived flows conveyed on the Internet continues to rise. With conventional TCP, short-lived flows will be unable to obtain a fair share of available bandwidth. As a result, short-lived flows will suffer from longer delays and a lower service rate. It is essential for the Internet to come up with an effective solution to this problem in order to accommodate the new traffic patterns. With a more equitable sharing of bottleneck bandwidth as its goal, a stateless queue management scheme featuring early drop maximum (EDM) is developed and presented in this article. The fundamental idea is to drop packets from those flows having more than an equal share of bandwidth. The congestion window size of a TCP sender is carried in the options field on each packet. The proposed scheme will be exercised on routers and make its decision on packet dropping according to the congestion windows. In case of link congestion, the queued packet with the largest congestion window will be dropped from the queue. This will lower the sending rate of its sender and release part of the occupied bandwidth for the use of other competing flows. By so doing, the entire system will approach an equilibrium point with a rapid and fair distribution of bandwidth. As a stateless approach, the proposed scheme inherits numerous advantages in implementation and scalability. Extensive simulations were conducted to verify the feasibility and the effectiveness of the proposed approach. As revealed in the simulation results, the proposed scheme outperforms existing stateless techniques, including Drop-Tail and Random Early Drop, in many respects, such as a fairer sharing of available bandwidth and a shorter response time for short-lived flows.

Enhanced token bucket policer using reduced fair queuing for Ethernet access networks

An enhanced traffic policer capable of adaptive rate control to provide fair distribution of available network bandwidth is proposed. The policer also performs maximum rate control, limiting flow's use of network resources within a pre-defined bound. Since the enhanced policer is based on a token bucket policer, a flow is guaranteed to receive service at its reserved rate. The proposed policer partially employs a reduced fair queuing algorithm, which is designed for adaptive rate control based on the perceived traffic congestion level. The adaptive rate control requires measurement of the congestion level, which is approximated through examination of local buffer usage. As a result, the allocated service rate increase provided to the flows by the policer is inversely proportional to the network congestion level. In addition, far-travelling flows in multi-hop networks receive the same service rate enhancements as short-travelling flows. The proposed scheme is useful in Ethernet networks, especially access networks, where quality of service is not well organised.

A fair bandwidth distribution mechanism in a Diffserv network

Previous works for the Assured Forwarding (AF) service in a Diffserv network have no sufficient consideration on the target rate and the effect of RTT and UDP in achieving the fairness of bandwidth share. Also previous works act like Best-effort service in an Under-Provisioned Network (UPN) condition. In this paper, in order to solve these problems, we propose the Proportionally Fair Differentiated Service Architecture (PFDSA), which is composed of tcp-microflow based Target rate and RTT Aware Three Color Marker (tmTRA3CM), udp-microflow based Three Color Marker (um3CM), Target Rate Based Dropper (TRBD), and Target Rate Adjusting Function (TRAF). In the results of comparisons on the performance among existing mechanisms and the PFDSA in the OPN (Over-Provisioned Network) and the UPN conditions, the PFDSA was able to further mitigate the RTT and UDP effects than the previous works. The PFDSA was shown to provide better fair bandwidth distribution proportional to various target rates even in the UPN condition.

Architecture for dynamic and fair distribution of bandwidth

AbstractThe problem of fair distribution of available bandwidth among traffic flows or aggregates remains an essential issue in computer networks. This paper introduces a novel approach, called the Exact Bandwidth Distribution Scheme (X‐BDS), for dynamic and fair distribution of available bandwidth among individual flows. In this approach, the edge routers keep per‐flow information, while the core routers maintain the aggregate flow requirements. The X‐BDS approach employs a distributed message exchange protocol for providing network feedback and for distributing aggregate flow requirements among the nodes in the network. Based on the obtained feedback, the edge routers employ the X‐BDS resource management unit to dynamically distribute available bandwidth among individual flows. The X‐BDS admission control and resource management units are responsible for fair resource allocation that supports minimum bandwidth guarantees of individual flows. This paper evaluates the Bandwidth Distribution Scheme through simulation and shows that the X‐BDS is capable of supporting per‐flow bandwidth guarantees in a dynamically changing network environment. Copyright © 2006 John Wiley & Sons, Ltd.

An adaptive min–max fair bandwidth allocation scheme for cellular multimedia networks

AbstractDepending on the flexibility in controlling the transmission rate and the differences between on‐line (real time) and off‐line transmission modes, multimedia applications can potentially include a wide range of services, with the traditional stringent quality‐of‐service (QoS) requirement at the extreme to the highly adaptive ones that can tolerate or smartly adapt to the transient fluctuations in the QoS parameters. Keeping the cellular multimedia networks efficient with low call dropping and blocking rates and high bandwidth utilisation while maintaining a fair distribution of bandwidth by synergistically addressing the differences among these services remains a significant challenge. This paper addresses this issue by developing a novel min–max fairness scheme where bandwidth is distributed with equal share only after ensuring the minimum requirements. Besides borrowing in‐use bandwidth through redistribution, this scheme also allows for using the reserved bandwidth for the offline services. Simulation results confirm the superiority of this scheme against the rate‐based borrowing and the max–min fairness schemes, the two most recent works addressing similar issues. Copyright © 2005 AEIT.