Locating Information with Uncertainty in Fully Interconnected Networks: The Case of Nondistributed Memory

Networks

Volumn 42, Issue 3, 2003, Pages 169-180

  Kirousis, Lefteris M ^a   Kranakis, Evangelos ^b   Krizanc, Danny ^c   Stamatiou, Yannis C ^d  

^a UNIVERSITY OF PATRAS   (Greece)

^b CARLETON UNIVERSITY   (Canada)

^c WESLEYAN UNIVERSITY   (United States)

^d UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

Complete network; Information retrieval; Random walks; Search; Uncertainty

Indexed keywords

COMPLETE NETWORK; RANDOM WALKS; SEARCH; UNCERTAINTY;

ALGORITHMS; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PROBABILITY; PROBLEM SOLVING; SERVERS; WORLD WIDE WEB;

INTERCONNECTION NETWORKS;

EID: 2142736174     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10094     Document Type: Article

References (24)

1. Y. Afek, E. Gafni, and M. Ricklin, Upper and lower bounds for routing schemes in dynamic networks, Proc 30th Symp on Foundations of Computer Science, 1989, pp. 370-375.
2. S. Albers and M. Henzinger, Exploring unknown environments, Proc 29th Symp on Theory of Computing, 1999, pp. 416-425.
3. B. Awerbuch, B. Patt-Shamir, and G. Varghese, Self-stabilizing end-to-end communication, J High Speed Networks 5 (1996), 365-381.
4. R.A. Baeza-Yates, J.C. Culberson, and G.J.E. Rawlins, Searching in the plane, Info Comput 106 (1993), 234-252.
5. D. Bienstock and P. Seymour, Monotonicity in graph searching, J Alg 12 (1991), 239-245.
6. R. Cole, B. Maggs, and R. Sitaraman, Routing on butterfly networks with random faults, Proc 36th Symp on Foundations of Computer Science, 1995, pp. 558-570.
7. X. Deng and C. Papadimitriou, Exploring an unknown graph, Proc 31st Symp on Foundations of Computer Science, 1990, pp. 356-361.
8. S. Dolev, E. Kranakis, D. Krizanc, and D. Peleg, Bubbles: Adaptive routing scheme for high-speed networks, SIAM J Comput 29 (1999), 804-833.
9. W. Evans and N. Pippenger, Lower bounds for noisy Boolean decision trees, Proc 28th Symp on Theory of Computing, 1996, pp. 620-628.
10. U. Fiege, D. Peleg, P. Raghavan, and E. Upfal, Computing with uncertainty, Proc 22nd Symp on Theory of Computing, 1990, pp. 128-137.
11. A.C. Kaporis, L.M. Kirousis, E. Kranakis, D. Krizanc, Y.C. Stamatiou, and E.G. Stavropoulos, Locating information with uncertainty in fully interconnected networks with applications to World Wide Web information retrieval, Comput J 44 (2001), 221-229.
12. S. Karlin and H.T. Taylor, A first course in stochastic processes, 2nd ed., Academic Press, New York, 1975.
13. L. Kirousis and C. Papadimitriou, Interval graphs and searching, Discr Math 55 (1985), 181-184.
14. E. Kranakis and D. Krizanc, Searching with uncertainty, Proc 6th Intl Colloq on Structural Information and Communication Complexity (SIROCCO), C. Gavoille, J.-C. Bermond, and A. Raspaud (Editors), Carleton Scientific, Ottawa, 1999, pp. 194-203.
15. T. Leighton and B. Maggs, Expanders might be practical, Proc 30th Symp on Foundations of Computer Science, 1989, pp. 384-389.
16. L. Lovász, Random walks on graphs: A survey, Combinatorics 2 (1993), 1-46.
17. N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou, The complexity of searching a graph, J ACM 35 (1988), 18-44.
18. P. Panaite and A. Pelc, Exploring unknown undirected graphs, Proc 9th Symp on Discrete Algorithms, 1998, pp. 316-322.
19. C.H. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theor Comput Sci 84 (1991), 127-150.
20. N. Pippenger, On networks of noisy gates, Proc 26th Symp on Foundations of Computer Science, 1985, pp. 30-36.
21. P. Raghavan, Robust algorithms for packet routing in a mesh, Proc 1st Symp on Parallel Algorithms and Architectures, 1989, pp. 344-350.
22. T.E.S. Raghavan, T.S. Ferguson, T. Parthasapathy, and O.J. Vrieze (Editors), Stochastic games and related topics, Kluwer, Dordrecht, 1991.
23. W.H. Ruckle, Geometric games and their applications, Research Notes in Mathematics, Pitman, New York, 1983.
24. R. Sedgewick and P. Flajolet, An introduction to the analysis of algorithms, Addison-Wesley, Boston, 1996.