Sciweavers

6480 search results - page 1236 / 1296
» Proximity Communication and Time
Sort
View
SIGCOMM
2005
ACM
14 years 3 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
SIGCSE
2005
ACM
163views Education» more  SIGCSE 2005»
14 years 3 months ago
Using SeSFJava in teaching introductory network courses
Networking course projects are usually described by an informal specification and a collection of test cases. Students often misunderstand the specification or oversimplify it t...
Tamer Elsharnouby, A. Udaya Shankar
SPAA
2005
ACM
14 years 3 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
SPAA
2005
ACM
14 years 3 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
WPES
2005
ACM
14 years 3 months ago
Anonymous yet accountable access control
This paper introduces a novel approach for augmenting attributebased access control systems in a way that allows them to offer fully anonymous access to resources while at the sam...
Michael Backes, Jan Camenisch, Dieter Sommer
« Prev « First page 1236 / 1296 Last » Next »