390 search results - page 45 / 78 » Computing shortest paths for any number of hops |
ASMTA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Service differentiation in IP core networks may be supported by dedicated path selection rules. This paper investigates the degree of service distinction achievable when ...
135
click to vote
ADHOCNOW
2005
Springer
15 years 7 months ago
2005
Springer
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
127
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In off-line streaming, packet level erasure resilient Forward Error Correction (FEC) codes rely on the unrestricted buffering time at the receiver. In real-time streaming, the ext...
RAS
1998
15 years 1 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....