12 search results - page 1 / 3 » Resource Allocation in Bounded Degree Trees |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
101
click to vote
ECRTS
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...