Sciweavers

180 search results - page 30 / 36
» Social DTN routing
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
IPTPS
2004
Springer
14 years 27 days ago
On the Cost of Participating in a Peer-to-Peer Network
In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate,...
Nicolas Christin, John Chuang
PET
2010
Springer
13 years 11 months ago
Drac: An Architecture for Anonymous Low-Volume Communications
We present Drac, a system designed to provide anonymity and unobservability for real-time instant messaging and voice-over-IP communications against a global passive adversary. The...
George Danezis, Claudia Díaz, Carmela Tronc...
IMCSIT
2010
13 years 5 months ago
ACO with semi-random start applied on MKP
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
Stefka Fidanova, Pencho Marinov, Krassimir T. Atan...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...