Sciweavers

11242 search results - page 1932 / 2249
» Designing a Super-Peer Network
Sort
View
SACMAT
2006
ACM
16 years 23 days ago
Traust: a trust negotiation-based authorization service for open systems
In recent years, trust negotiation (TN) has been proposed as a novel access control solution for use in open system environments in which resources are shared across organizationa...
Adam J. Lee, Marianne Winslett, Jim Basney, Von We...
SENSYS
2006
ACM
16 years 23 days ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
INFOCOM
2005
IEEE
16 years 12 days ago
Practical routing-layer support for scalable multihoming
— The recent trend of rapid increase in routing table sizes at routers comprising the Internet’s core is posing a serious challenge to the current Internet’s scalability, ava...
Ramakrishna Gummadi, Ramesh Govindan
INFOCOM
2005
IEEE
16 years 12 days ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
ISLPED
2003
ACM
115views Hardware» more  ISLPED 2003»
16 years 2 days ago
Reducing energy and delay using efficient victim caches
In this paper, we investigate methods for improving the hit rates in the first level of memory hierarchy. Particularly, we propose victim cache structures to reduce the number of ...
Gokhan Memik, Glenn Reinman, William H. Mangione-S...
« Prev « First page 1932 / 2249 Last » Next »