118 search results - page 17 / 24 » The Performance of Routing Algorithms under Bursty Traffic L... |
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
ITNG
2008
IEEE
14 years 1 months ago
2008
IEEE
In our previous work, a Multi-Path Routing (MPR) scheme was proposed to maximize the data throughput for torus-based NoCs by utilizing multiple paths for concurrent data transmiss...
IJCAI
2001
13 years 8 months ago
2001
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
JVM
2004
13 years 8 months ago
2004
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...