Sciweavers

6907 search results - page 818 / 1382
» Securing distributed adaptation
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
SCN
2008
Springer
15 years 7 months ago
An Identity-Based Key Agreement Protocol for the Network Layer
A new identity-based key agreement protocol designed to operate on thenetworklayerispresented. Endpoint addresses, namelyIP and MAC addresses, areusedaspublickeystoauthenticatethe ...
Christian Schridde, Matthew Smith, Bernd Freislebe...
TISSEC
2008
100views more  TISSEC 2008»
15 years 7 months ago
Message Dropping Attacks in Overlay Networks: Attack Detection and Attacker Identification
Overlay multicast networks are used by service providers to distribute contents such as web pages, streaming multimedia data, or security updates to a large number of users. Howeve...
Liang Xie, Sencun Zhu
TPDS
1998
95views more  TPDS 1998»
15 years 6 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
CCR
2010
104views more  CCR 2010»
15 years 4 months ago
I know what you will do next summer
This is a brief journey across the Internet privacy landscape. After trying to convince you about the importance of the problem I will try to present questions of interest and how...
Balachander Krishnamurthy