105 search results - page 10 / 21 » Distributed Algorithms for Computing Alternate Paths Avoidin... |
SIGCOMM
2004
ACM
14 years 29 days ago
2004
ACM
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
ICDCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
CAD
2004
Springer
13 years 7 months ago
2004
Springer
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
NAS
2010
IEEE
13 years 6 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...