1008 search results - page 136 / 202 » Routing in intermittent network topologies |
177
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
179
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, net...
178
click to vote
ICWN
2007
15 years 7 months ago
2007
This paper presents a tractable optimization strategies of sensing workload scheduling in wireless sensor networks using Divisible Load Theory (DLT). Because of the limited batter...
169
click to vote
SIGMETRICS
2003
ACM
15 years 11 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
203
click to vote
INFOCOM
2008
IEEE
16 years 24 days ago
2008
IEEE
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...