186 search results - page 15 / 38 » Bounded Fairness |
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
13 years 12 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
ICC
2000
IEEE
14 years 2 days ago
2000
IEEE
Abstract—Packet scheduling disciplines play an important role in providing Quality of Service (QoS) guarantees to applications traffic in high speed networks. Several scheduling...