1877 search results - page 235 / 376 » Network Locality at the Scale of Processes |
166
click to vote
KES
2008
Springer
15 years 4 months ago
2008
Springer
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
131
click to vote
INFOCOM
1998
IEEE
15 years 8 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
165
click to vote
MSWIM
2006
ACM
15 years 10 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
145
click to vote
PDPTA
2003
15 years 5 months ago
2003
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
177
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...