Sciweavers

180 search results - page 20 / 36
» Social DTN routing
Sort
View
SIGECOM
2005
ACM
98views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Hidden-action in multi-hop routing
In multi-hop networks, the actions taken by individual intermediate nodes are typically hidden from the communicating endpoints; all the endpoints can observe is whether or not th...
Michal Feldman, John Chuang, Ion Stoica, Scott She...
INFOCOM
2005
IEEE
14 years 1 months ago
A cost-based analysis of overlay routing geometries
— In this paper, we propose a cost-based model to evaluate the resources that each node has to contribute for participating in an overlay network. Such a cost model allows to gau...
Nicolas Christin, John Chuang
GIS
2009
ACM
14 years 2 months ago
Trajectory simplification method for location-based social networking services
The increasing availabilities of GPS-enabled devices have given rise to the location-based social networking services (LBSN), in which users can record their travel experiences wi...
Yukun Chen, Kai Jiang, Yu Zheng, Chunping Li, Neng...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 1 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
INFOCOM
2006
IEEE
14 years 1 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda