27 search results - page 1 / 6 » Fair and timely scheduling via cooperative polling |
EUROSYS
2009
ACM
14 years 1 months ago
2009
ACM
IAJIT
2010
13 years 3 months ago
2010
: Several polling algorithms have been proposed to overcome the slot wastage problem due to the exchange of POLL or NULL packets in the case of no data to transmit. However, most o...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we study how the cooperative relaying can improve both capacity and fairness in cellular network. The capacity and fairness have a trade-off relationship, so inc...
SIGMETRICS
2012
ACM
11 years 7 months ago
2012
ACM
Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbate...
COMSWARE
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—In this paper we propose two polling based scheduling schemes for applications based on TCP in a multipointto-point IEEE 802.16 network. The first scheme uses TCP conge...