2005
DOI: 10.1016/j.comnet.2004.12.008
|View full text |Cite
|
Sign up to set email alerts
|

Fair and efficient dynamic bandwidth allocation for multi-application networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 18 publications
(7 citation statements)
references
References 37 publications
0
7
0
Order By: Relevance
“…A generalized scheduling approach for both single-wavelength and WDM PONs, referred to as the K-out-of-N technique, was presented and analyzed in [23]; with this technique, efficiency is improved by having the OLT grant the top K requests out of the N ONUs for transmission within a round, where K is a tunable parameter. Finally, several DBA variants that use quality of service (QoS) and fairness criteria have been proposed in [24][25][26][27][28]; these schemes aim to support differentiated services and applications with heterogeneous requirements while making efficient use of the network resources. For an in-depth discussion of DBA algorithms for EPONs, please refer to [9].…”
Section: A Related Workmentioning
confidence: 99%
“…A generalized scheduling approach for both single-wavelength and WDM PONs, referred to as the K-out-of-N technique, was presented and analyzed in [23]; with this technique, efficiency is improved by having the OLT grant the top K requests out of the N ONUs for transmission within a round, where K is a tunable parameter. Finally, several DBA variants that use quality of service (QoS) and fairness criteria have been proposed in [24][25][26][27][28]; these schemes aim to support differentiated services and applications with heterogeneous requirements while making efficient use of the network resources. For an in-depth discussion of DBA algorithms for EPONs, please refer to [9].…”
Section: A Related Workmentioning
confidence: 99%
“…Any telecommunications business will need to assess their income as part of their operations viability and hence we investigate this aspect here. Other targets, which have been suggested in the research community are: i) Welfare maximisation: max u i (where u i is the utility of user i), and ii) Fairness: max(min i u i ) [25]. We note that the target of welfare maximisation could be achieved within the framework presented in this work, where instead of price we would consider the utility of the user.…”
Section: Qualitymentioning
confidence: 99%
“…Our proposal can rely on a WFQ algorithm (see e.g. [25]), where the weights for packets of each class depend on the number of active flows for the class and the allocated bandwidth per flow. Potential users of the network with specific requirements arrive according to a Poisson process and if the QoS and the price for a class are acceptable for them then they request admission for this specific class.…”
Section: Single-link Service and Demand Model For Dynamically Chmentioning
confidence: 99%
“…For example, in [22] the proportional fairness principle was used to assign rates fairly to different contending elastic data traffic demands. For more on fairness and optimization the reader is referred to [23], [24]. With this choice of objective function in mind, the socket controllers (agents) set the recharging rate of connected EVs by solving the following optimization problems.…”
Section: A Problem Formulation Notationmentioning
confidence: 99%