Sciweavers

4037 search results - page 20 / 808
» Routing without ordering
Sort
View
QUESTA
2006
101views more  QUESTA 2006»
14 years 11 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
KIVS
2005
Springer
15 years 5 months ago
Recursive or iterative routing? Hybrid!
: In our current work with the Chord protocol [SMK+ 01] we had to decide whether to use iterative or recursive routing. Iterative routing provides the initiating node with a lot of...
Gerald Kunzmann
INFOCOM
2009
IEEE
15 years 6 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
MM
2010
ACM
150views Multimedia» more  MM 2010»
14 years 10 months ago
Photo2Trip: generating travel routes from geo-tagged photos for trip planning
Travel route planning is an important step for a tourist to prepare his/her trip. As a common scenario, a tourist usually asks the following questions when he/she is planning his/...
Xin Lu, Changhu Wang, Jiang-Ming Yang, Yanwei Pang...
SOICT
2010
14 years 6 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...