2796 search results - page 156 / 560 » The coolest path problem |
179
click to vote
IWSOS
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
150
click to vote
WEA
2007
Springer
16 years 7 days ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
168
click to vote
ICMCS
2006
IEEE
16 years 5 days ago
2006
IEEE
Video transmission over unreliable packet network is in general hampered by the packet losses and constraint by stringent playback deadline. With these two key factors in consider...
154
click to vote
SIGCOMM
2006
ACM
16 years 3 days ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
171
click to vote
AINA
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...