Sciweavers

1432 search results - page 207 / 287
» Hardness of robust network design
Sort
View
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 6 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
16 years 1 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
16 years 28 days ago
A highly resilient routing algorithm for fault-tolerant NoCs
Current trends in technology scaling foreshadow worsening transistor reliability as well as greater numbers of transistors in each system. The combination of these factors will so...
David Fick, Andrew DeOrio, Gregory K. Chen, Valeri...
NOSSDAV
2009
Springer
16 years 22 days ago
End-to-end secure delivery of scalable video streams
We investigate the problem of securing the delivery of scalable video streams so that receivers can ensure the authenticity (originality and integrity) of the video. Our focus is ...
Kianoosh Mokhtarian, Mohamed Hefeeda
CONEXT
2006
ACM
16 years 4 days ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford