Sciweavers

133 search results - page 11 / 27
» A k-anonymous communication protocol for overlay networks
Sort
View
CONEXT
2009
ACM
13 years 8 months ago
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...
GLOBECOM
2007
IEEE
14 years 1 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...
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 2 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
NOMS
2008
IEEE
115views Communications» more  NOMS 2008»
14 years 1 months ago
A scheme for dynamic monitoring and logging of topology information in Wireless Mesh Networks
—We propose a distributed monitoring scheme for an ad-hoc/MESH network topology, and design a Distributed Hash Table based Peer-to-Peer system to log the topology information. A ...
Cristian Popi, Olivier Festor
NOMS
2010
IEEE
172views Communications» more  NOMS 2010»
13 years 6 months ago
WiMFlow: a distributed, self-adaptive architecture for flow monitoring in Wireless Mesh Networks
—We present WiMFlow, a dynamic and self-organized flow monitoring framework in Wireless Mesh Networks. The protocol allows for an autonomic organization of the probes, with the ...
Cristian Popi, Olivier Festor