Sciweavers

417 search results - page 63 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
SIGCOMM
2009
ACM
14 years 3 months ago
Resonance: dynamic access control for enterprise networks
Enterprise network security is typically reactive, and it relies heavily on host security and middleboxes. This approach creates complicated interactions between protocols and sys...
Ankur Kumar Nayak, Alex Reimers, Nick Feamster, Ru...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 3 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
EUROPAR
2006
Springer
14 years 12 days ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
GLOBECOM
2009
IEEE
13 years 6 months ago
Time-Critical Data Dissemination in Cooperative Peer-to-Peer Systems
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
Chi-Jen Wu, Cheng-Ying Li, Kai-Hsiang Yang, Jan-Mi...
MOBIHOC
2012
ACM
11 years 11 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn