Sciweavers

1498 search results - page 85 / 300
» Collection tree protocol
Sort
View
CCS
2008
ACM
15 years 4 months ago
A fast real-time memory authentication protocol
We propose a new real-time authentication scheme for memory. As in previous proposals the scheme uses a Merkle tree to guarantee dynamic protection of memory. We use the universal...
Yin Hu, Ghaith Hammouri, Berk Sunar
JNW
2006
120views more  JNW 2006»
15 years 2 months ago
An EMST Based Look-up Protocol for Peer to Peer Networks
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...
Tarun Bansal, Pankaj Ghanshani
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
15 years 8 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev
FOCS
2004
IEEE
15 years 6 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
ITIIS
2008
84views more  ITIIS 2008»
15 years 2 months ago
A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss
Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss amon...
Jinsuk Baek, Jehan-François Pâris