Sciweavers

48 search results - page 7 / 10
» Quantifying and Querying Network Reachability
Sort
View
ICNP
2009
IEEE
13 years 5 months ago
Quality of Name Resolution in the Domain Name System
The Domain Name System (DNS) is integral to today's Internet. Name resolution for a domain is often dependent on servers well outside the control of the domain's owner. I...
Casey T. Deccio, Chao-Chih Chen, Jeff Sedayao, Kri...
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
P2P
2005
IEEE
119views Communications» more  P2P 2005»
14 years 1 months ago
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts, efficient algorithms for guaranteed location of shared content in unst...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, As...
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 7 months ago
Efficient Verification of Shortest Path Search via Authenticated Hints
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 2 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...