1768 search results - page 101 / 354 » Optimal routing in Chord |
90
Voted
PE
2002
Springer
15 years 14 days ago
2002
Springer
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
111
Voted
SAB
2010
Springer
14 years 11 months ago
2010
Springer
We introduce a new bee-inspired routing protocol for mobile ad hoc networks. Emphasis is given to the ability of bees to evaluate paths by considering several quality factors. In o...
141
Voted
ICC
2009
IEEE
14 years 10 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
77
Voted
SIGMETRICS
1999
ACM
15 years 5 months ago
1999
ACM
In this paperweconsidertheproblemof schedulingdifferentclasses of customerson multiple distributed serversto minimize an objective function basedon per-classmeanresponsetimes.This...
129
Voted
STACS
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...