4131 search results - page 809 / 827 » Compactness in Topology and Computation |
MOBICOM
2004
ACM
14 years 4 months ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
SIGCOMM
2004
ACM
14 years 4 months ago
2004
ACM
This paper presents a methodology for identifying the autonomous system (or systems) responsible when a routing change is observed and propagated by BGP. The origin of such a rout...
SIGCOMM
2004
ACM
14 years 4 months ago
2004
ACM
Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion manag...
STOC
2004
ACM
14 years 4 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
MIDDLEWARE
2004
Springer
14 years 4 months ago
2004
Springer
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...