Sciweavers

765 search results - page 56 / 153
» Self-organization of Internet Paths
Sort
View
OTM
2010
Springer
13 years 6 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang
COREGRID
2007
Springer
14 years 3 months ago
Synthetic Coordinates for Disjoint Multipath Routing
We address the problem of routing packets on multiple, router-disjoint, paths in the Internet using large-scale overlay networks. Multipath routing can improve Internet QoS, by rou...
Andrei Agapi, Thilo Kielmann, Henri E. Bal
NSDI
2007
13 years 11 months ago
Mutually Controlled Routing with Independent ISPs
Abstract – We present Wiser, an Internet routing protocol that enables ISPs to jointly control routing in a way that produces efficient end-to-end paths even when they act in th...
Ratul Mahajan, David Wetherall, Thomas E. Anderson
GLOBECOM
2007
IEEE
14 years 3 months ago
Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 8 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