615 search results - page 31 / 123 » Relatively inertial delays |
162
click to vote
INFOCOM
2009
IEEE
16 years 22 days ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
224
Voted
SCP
2011
15 years 1 months ago
2011
Active libraries can be defined as libraries which play an active part in the compilation, in particular, the optimisation of their client code. This paper explores the implement...
180
Voted
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—There has been recent interest within the networking research community to understand how performance scales in cognitive networks with overlapping n primary nodes and m seconda...
135
click to vote
ESA
2009
Springer
16 years 20 days ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
163
click to vote
INFOCOM
2008
IEEE
16 years 15 days ago
2008
IEEE
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...