Max-min Utility Fairness in Link Aggregated Systems

Mohanty, S.R.; Liu, Changbin; Liu, Bin; Bhuyan, Laxmi N.

doi:10.1109/hpsr.2007.4281267

Cited by 8 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We assume the following four major network applications: a) VoIP traffic, b) IPTV traffic, c) TCP elastic traffic, and d) HTTP traffic. The respective utility functions of these services were previously defined in [11][12]. In this paper, we assume that the application types for light and heavy users are HTTP and TCP elastic, respectively, to simplify comparison scenarios.…”

Section: Utility Functionsmentioning

confidence: 99%

A study of dynamic network selection for HSPA dual-network users

Chung

Tsai

2011

The International Conference on Information Networking 2011 (ICOIN2011)

View full text Add to dashboard Cite

Due to the fact that existing 3.5G network cards usually select networks with the highest data rate as their priority choices, the radio resources may not be efficiently and equally utilized in a multiple network environment, even when the network with the highest rate is already congested. In this paper, we propose two dynamic resource allocation algorithms to resolve such issues assuming an HSPA dual-network architecture, which is common in many existing 3.5G networks. The presented algorithms include two major versions: 1) maximum utility algorithm and 2) enhanced maximum utility algorithm. Performance metrics such as the overall system utility (i.e. the satisfaction index), the blocking probability, and the system utilization are employed in the investigation of these two algorithms. Simulations show that the presented algorithms have significant improvements in the overall system performance than that of the existing algorithm. The system performance can be further improved if the concentration ratio can be dynamically adjusted.

show abstract

Section: Utility Functionsmentioning

confidence: 99%

A study of dynamic network selection for HSPA dual-network users

Chung

Tsai

2011

The International Conference on Information Networking 2011 (ICOIN2011)

View full text Add to dashboard Cite

show abstract

“…Moreover, varied types of services, which have different quality-of-service (QoS) requirements, affect the others. Utility-based bandwidth resource allocation solutions can provide QoS support for different services [6][7][8][9]. However, it is not utilized in DOCSIS.…”

Section: Introductionmentioning

confidence: 99%

Utility-Based Online Bandwidth Allocation for Bonded Channels

Yang¹,

Wang²,

Lin³

2013

JNW

View full text Add to dashboard Cite

This paper focuses on the bonding group online bandwidth allocation problem in DOCSIS3.0 network. Taking network maximization utility as the goal, an optimal model, which is the Bonding Group based rival service flow Set Utility Maximization (BG-SUM), is built firstly, and then a Bonding Group Online Bandwidth Allocation algorithm (BG-OBA) is proposed to perform fast near-optimal solution. By discretizing the utility functions of requests, the BG-OBA fast allocate bandwidth for service flows and then verifies the feasibility of the bandwidth redistributed to each channel in bonding group. The simulation results show that the convergence speed of BG-OBA is faster than 0-1 integer programming, and the total utility is close to the theoretical optimum, hence it is practical for online bandwidth allocatio

show abstract

Stabilization of max–min fair networks without per-flow state

Cobb

Gouda

2011

Theoretical Computer Science

View full text Add to dashboard Cite

Let a flow be a sequence of packets sent from a source computer to a destination computer. Routers at the core of the Internet do not maintain any information about the flows that traverse them. This has allowed for great speeds at the routers, at the expense of providing only best-effort service. In this paper, we consider the problem of fairly allocating bandwidth to each flow. We assume some flows request a constant amount of bandwidth from the network. The bandwidth that remains is distributed fairly among the rest of the flows. The fairness sought after is max-min fairness, which assigns to each flow the largest possible bandwidth that avoids affecting other flows. The distinguishing factor to other approaches is that routers only maintain a constant amount of state, which is consistent with trends in the Internet (such as the proposed Differentiated Services Internet architecture). In addition, due to the need for high fault-tolerance in the Internet, we ensure our protocol is self-stabilizing, that is, it tolerates a wide variety of transient faults.

show abstract

Max-min Utility Fairness in Link Aggregated Systems

Cited by 8 publications

References 14 publications

A study of dynamic network selection for HSPA dual-network users

A study of dynamic network selection for HSPA dual-network users

Utility-Based Online Bandwidth Allocation for Bonded Channels

Stabilization of max–min fair networks without per-flow state

Contact Info

Product

Resources

About