972 search results - page 192 / 195 » Performance of data networks with random links |
CN
2008
14 years 9 months ago
2008
This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window...
133
click to vote
ADHOC
2010
14 years 6 months ago
2010
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
SIGMOD
1998
ACM
15 years 1 months ago
1998
ACM
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
WWW
2003
ACM
15 years 10 months ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
CF
2006
ACM
15 years 3 months ago
2006
ACM
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...