Sciweavers

675 search results - page 78 / 135
» Anonymous communication in overlay networks
Sort
View
SIGCOMM
2003
ACM
15 years 4 months ago
Forwarding in a content-based network
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...
Antonio Carzaniga, Alexander L. Wolf
DCOSS
2005
Springer
15 years 4 months ago
Stably Computable Properties of Network Graphs
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...
INFOCOM
2008
IEEE
15 years 5 months ago
Swarming on Optimized Graphs for n-Way Broadcast
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
Georgios Smaragdakis, Azer Bestavros, Nikolaos Lao...
USS
2010
14 years 8 months ago
BotGrep: Finding P2P Bots with Structured Graph Analysis
A key feature that distinguishes modern botnets from earlier counterparts is their increasing use of structured overlay topologies. This lets them carry out sophisticated coordina...
Shishir Nagaraja, Prateek Mittal, Chi-Yao Hong, Ma...
GLOBECOM
2007
IEEE
15 years 5 months ago
PMTA: Potential-Based Multicast Tree Algorithm with Connectivity Restricted Hosts
— A large number of overlay protocols have been developed, almost all of which assume each host has two-way communication capability. However, this does not hold as the deploymen...
Xiaohui Shi, Yang Chen, Guohan Lu, Beixing Deng, X...