DocumentCode
2996098
Title
Shortest path problem with cache dependent path lengths
Author
Fu, Zhaohui ; Kurnia, A. ; Lim, Andrew ; Rodrigues, IBrian
Author_Institution
Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore
Volume
4
fYear
2003
fDate
8-12 Dec. 2003
Firstpage
2756
Abstract
Here, we are motivated by the problem of finding the shortest path in a network when traversing Web pages where cache size determines path length. The shortest path problem with cache-dependent path lengths is shown to be NP-complete. It is a new problem for which we propose several effective heuristics, including a Dijkstra heuristic, genetic algorithms and tabu search.
Keywords
Internet; cache storage; computational complexity; genetic algorithms; search problems; Dijkstra heuristic; NP-complete; Web pages traversal; cache-dependent path length; genetic algorithm; shortest path problem; tabu search; Computer network management; Computer science; Costs; Drives; Genetics; HTML; Protocols; Shortest path problem; Stochastic processes; World Wide Web;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN
0-7803-7804-0
Type
conf
DOI
10.1109/CEC.2003.1299437
Filename
1299437
Link To Document