31 search results - page 3 / 7 » Efficient and scalable query routing for unstructured peer-t... |
DEXA
2004
Springer
13 years 9 months ago
2004
Springer
Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to informati...
GLOBECOM
2006
IEEE
13 years 12 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
COLCOM
2007
IEEE
14 years 3 days ago
2007
IEEE
—Recently, unstructured peer-to-peer (P2P) applications have become extremely popular. Searching in these networks has been a hot research topic. Flooding-based searching, which ...
CCGRID
2007
IEEE
14 years 4 days ago
2007
IEEE
Grid applications need efficient access to information about available resources and services. Typically, this access is provided by information services that are often organized ...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...