Sciweavers

9949 search results - page 408 / 1990
» On the Network Complexity of Selection
Sort
View
ACSAC
2002
IEEE
16 years 19 days ago
Networking in The Solar Trust Model: Determining Optimal Trust Paths in a Decentralized Trust Network
The Solar Trust Model provides a method by which the sender of a message can be authenticated, and the level of trust that can be placed in the sender of the message or the messag...
Michael Clifford
CNSR
2006
IEEE
16 years 1 months ago
Trusted Computing for Protecting Ad-hoc Routing
Ad-hoc networks rely on participation and cooperation of nodes within the network to transmit data to destinations. However, in networks where participating nodes are controlled b...
Michael Jarrett, Paul Ward
IC
2003
15 years 9 months ago
Denying Denial-of-Service Attacks: A Router Based Solution
Distributed Denial-of-Service (DDoS) attacks prevent users from accessing services on the target network by flooding the target network with a large volume of traffic. In this pap...
Zhang Shu, Partha Dasgupta
MASCOTS
2001
15 years 9 months ago
Minimizing Routing State for Light-Weight Network Simulation
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
Polly Huang, John S. Heidemann
SPAA
2010
ACM
16 years 15 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...