UARA in edge routers: an effective approach to user fairness and traffic shaping

Khosroshahy, Masood

doi:10.1002/dac.1262

Cited by 8 publications

(10 citation statements)

References 22 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mello et al introduced a mechanism that can guarantee service availability for dynamic traffic connections while minimizing the required backup network resources in SBPP schemes. The research study in focuses on survivable traffic grooming policies, as to whether working connections and backup connections should be groomed onto the same lightpath (LP) . Lin et al introduced a measurement metric for relating network availability to its performance in terms of traffic connections acceptance rate.…”

Section: Related Workmentioning

confidence: 99%

Dynamic connection provisioning with shared protection in IP/WDM networks

Alshaer

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYInternet protocol (IP) traffic connections arrive dynamically at wavelength‐division multiplexing (WDM) network edges with low data rates compared with the wavelength capacity, availability, and quality‐of‐service (QoS) constraints. This paper introduces a scheme to be integrated into the control and management plane of IP/WDM networks to satisfy the availability and QoS required for IP traffic connections bundled onto a single wavelength (lightpath) in WDM networks protected by shared‐backup path protection (SBPP). This scheme consists of two main operations: (i) routing multi‐granular connections and traffic grooming policies, and (ii) providing appropriate shared protection on the basis of subscribers’ service‐level agreements in terms of data rate, availability, and blocking probability. Using the Markov chain process, a probabilistic approach is developed to conceive connection blocking probability models, which can quantify the blocking probability and service utilization of M:N and 1:N SBPP schemes. The proposed scheme and developed mathematical models have been evaluated in terms of bandwidth blocking ratio, availability satisfaction rate, network utilization, and connection blocking probability performance metrics. The obtained research results in this paper provide network operators an operational setting parameter, which controls the allocation of working and backup resources to dynamic IP traffic connections on the basis of their priority and data rate while satisfying their requirements in terms of bandwidth and availability. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Section: Related Workmentioning

confidence: 99%

Dynamic connection provisioning with shared protection in IP/WDM networks

Alshaer

2013

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Unfortunately, RED is unable to provide fairness, especially for heterogeneous traffic. Based on RED, several variants have been proposed that enhance the fairness or robustness of RED parameters [13][14][15][16][17][18]. Self-Configuring RED changes dropping probabilities according to the variations in average queue sizes [13].…”

Section: Introductionmentioning

confidence: 99%

Adaptive Filtering Queueing for Improving Fairness

Yang¹

2015

Applied Sciences

View full text Add to dashboard Cite

Abstract:In this paper, we propose a scalable and efficient Active Queue Management (AQM) scheme to provide fair bandwidth sharing when traffic is congested dubbed Adaptive Filtering Queueing (AFQ). First, AFQ identifies the filtering level of an arriving packet by comparing it with a flow label selected at random from the first level to an estimated level in the filtering level table. Based on the accepted traffic estimation and the previous fair filtering level, AFQ updates the fair filtering level. Next, AFQ uses a simple packet-dropping algorithm to determine whether arriving packets are accepted or discarded. To enhance AFQ's feasibility in high-speed networks, we propose a two-layer mapping mechanism to effectively simplify the packet comparison operations. Simulation results demonstrate that AFQ achieves optimal fairness when compared with Rotating Preference Queues (RPQ), Core-Stateless Fair Queueing (CSFQ), CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows (CHOKe) and First-In First-Out (FIFO) schemes under a variety of traffic conditions.

show abstract

“…To manage the limited buffer more efficiently, a plentiful number of active queue management (AQM) schemes have been proposed to overcome the early drop-tail policy [1][2][3][4]. To manage the limited buffer more efficiently, a plentiful number of active queue management (AQM) schemes have been proposed to overcome the early drop-tail policy [1][2][3][4].…”

Section: Introductionmentioning

confidence: 99%

“…A router buffer is a shared resource used by numerous network nodes. To manage the limited buffer more efficiently, a plentiful number of active queue management (AQM) schemes have been proposed to overcome the early drop-tail policy [1][2][3][4]. For instance, to achieve a hard fairness, router buffer elements are allocated to each flow evenly, that is, buffer size/number of active flows.…”

Section: Introductionmentioning

confidence: 99%

A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

Hwang¹,

Byun

2014

Int J Communication

View full text Add to dashboard Cite

During the last decade, a plentiful number of active queue management schemes have been proposed, but their main objectives are simply allocating the buffer resource to all flows evenly, or protecting responsive flows from being degraded by unresponsive flows. However, the sending rates of the responsive flows can be determined diversely, and not all unresponsive flows have aggressively high sending rates. Furthermore, it is rational to reserve a portion of the buffer resource for certain privileged traffic. Grounded by these evidences, in this paper, we present a resilient active queue management algorithm, named Prior-Core-based Buffer Allocation considering diverse congestion control algorithms, fair-unresponsive flows, and some privileged traffic. Our approach is based on stochastic cooperative game theory, where the payoffs yielded by cooperation are described by random variables, and the core is defined only over the distribution of these random payoffs; the core in this situation is called the prior-core. As a result, it is shown that our buffer allocation, yielded by the prior-core, achieves completely fair allocation for those flows whose requirement does not exceed the fair-share regardless of the responsiveness, whereas aggressive flows are restricted according to availability of the buffer; all these are verified through ns-2 simulation experiments. Every one second, we count the number of packets arrived in the buffer as a sample for the ith flow and calculate its weighted moving average: Sampli ng t D w Sampli ng t 1 C .1 w/ .a sample/, where w is 0.8.

show abstract

UARA in edge routers: an effective approach to user fairness and traffic shaping

Cited by 8 publications

References 22 publications

Dynamic connection provisioning with shared protection in IP/WDM networks

Dynamic connection provisioning with shared protection in IP/WDM networks

Adaptive Filtering Queueing for Improving Fairness

A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

Contact Info

Product

Resources

About