Enhancement of fairness among broadband users with heterogeneous access network resources management

Matsumoto, Tadahiko; Hayashi, Tetsuya; Nishimura,; Tanaka, M.

doi:10.1109/acp.2010.5682703

Search citation statements

Order By: Relevance

Paper Sections

Select...

Per-user Fairness For Flow-aware Networking1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If j is not in the PFL, the user counter (i_counter) is not greater than the fixed value N, and the outgoing link is not congested, the packet can be accepted (lines [4][5][6][7][8][9][10][11]. In such a case, j is added to the PFL, i is added (if not added before) to the active user list (AUL), and i_counter is increased by one.…”

Section: Per-user Fairness For Flow-aware Networkingmentioning

confidence: 99%

A new concept of fairness in flow‐aware networking

Wójcik

Domżał

Gawłowicz

2017

Int J Communication

View full text Add to dashboard Cite

We demonstrate a new approach to assuring fairness in flow-aware networking. Standard routine in flow-aware networking guarantees that each flow receives the same amount of resources. This property can be exploited by dividing a single transmission into a number of flows. We propose and evaluate the per-user fair packet scheduling mechanism, which ensures fairness among users (not flows). We also compare the new mechanism with the one already known from the literature, which is based on altering the admission control routine. Evaluation shows that the new concept of fairness provides better performance and fair resource distribution regardless of the behavior of users.

show abstract