Sciweavers

1061 search results - page 104 / 213
» On Compact Routing for the Internet
Sort
View
WEBI
2005
Springer
15 years 3 months ago
A Method of Web Search Result Clustering Based on Rough Sets
Due to the enormous size of the web and low precision of user queries, finding the right information from the web can be difficult if not impossible. One approach that tries to ...
Chi Lang Ngo, Hung Son Nguyen
HT
2000
ACM
15 years 2 months ago
Clustering hypertext with applications to web searching
Clustering separates unrelated documents and groups related documents, and is useful for discrimination, disambiguation, summarization, organization, and navigation of unstructure...
Dharmendra S. Modha, W. Scott Spangler
SASO
2009
IEEE
15 years 4 months ago
Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays
—In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The exi...
Wojciech Galuba, Karl Aberer, Zoran Despotovic, Wo...
SIGCOMM
2009
ACM
15 years 4 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
AINA
2006
IEEE
15 years 4 months ago
V6Gene: A Scalable IPv6 Prefix Generator for Route Lookup Algorithm Benchmark
Most conventional IPv4-based route lookup algorithms are no more suitable for IPv6 packet forwarding due to the significantly increased 128-bit-long address. However, as a result o...
Kai Zheng, Bin Liu