Sciweavers

1087 search results - page 58 / 218
» Distributed Oblivious Transfer
Sort
View
BROADNETS
2005
IEEE
14 years 2 months ago
A Lightweight framework for source-to-sink data transfer in wireless sensor networks
— Lightweight protocols that are both bandwidth and power thrifty are desirable for sensor networks. In addition, for many sensor network applications, timeliness of data deliver...
James Jobin, Zhenqiang Ye, Honomount Rawat, Srikan...
INFOCOM
2000
IEEE
14 years 1 months ago
Modeling TCP Latency
—Several analytic models describe the steady-state throughput of bulk transfer TCP flows as a function of round trip time and packet loss rate. These models describe flows base...
Neal Cardwell, Stefan Savage, Thomas E. Anderson
IPPS
2007
IEEE
14 years 3 months ago
Implementing Replica Placements: Feasibility and Cost Minimization
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
Thanasis Loukopoulos, Nikos Tziritas, Petros Lamps...
CLUSTER
2011
IEEE
12 years 8 months ago
Investigating Scenario-Conscious Asynchronous Rendezvous over RDMA
— In this paper, we propose a light-weight asynchronous message progression mechanism for large message transfers in Message Passing Interface (MPI) Rendezvous protocol that is s...
Judicael A. Zounmevo, Ahmad Afsahi
DPD
2002
168views more  DPD 2002»
13 years 8 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...