Sciweavers

72 search results - page 6 / 15
» Quantifying path exploration in the internet
Sort
View
84
Voted
IMC
2010
ACM
14 years 7 months ago
Measuring path MTU discovery behaviour
Path MTU Discovery (PMTUD) is widely believed to be unreliable because of firewalls that discard ICMP "Packet Too Big" messages. This paper measures PMTUD behaviour for ...
Matthew J. Luckie, Ben Stasiewicz
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
15 years 9 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
INFOCOM
2011
IEEE
14 years 27 days ago
QoF: Towards comprehensive path quality measurement in wireless sensor networks
Abstract—Due to its large scale and constrained communication radius, a wireless sensor network mostly relies on multi-hop transmissions to deliver a data packet along a sequence...
Jiliang Wang, Yunhao Liu, Mo Li, Wei Dong, Yuan He
101
Voted
PAM
2011
Springer
14 years 9 days ago
On the Feasibility of Bandwidth Detouring
Internet applications that route data over default Internet paths can often increase performance by sending their traffic over alternative “detour” paths. Previous work has sho...
Thom Haddow, Sing Wang Ho, Jonathan Ledlie, Cristi...
VISSYM
2007
14 years 12 months ago
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
Daniel Archambault, Tamara Munzner, David Auber