CycleMeter: Detecting Fraudulent Peers in Internet Cycle Sharing

@article{Zhang2006CycleMeterDF,
  title={CycleMeter: Detecting Fraudulent Peers in Internet Cycle Sharing},
  author={Zheng Zhang and Y.C. Hu and Samuel P. Midkiff},
  journal={ACM/IEEE SC 2006 Conference (SC'06)},
  year={2006},
  pages={32-32}
}
Internet cycle sharing systems that utilize idle computing resources dramatically increase the available resources for high performance computing. Fraudulent resource providers, however, can subvert these systems. While previous research has investigated protection against resource providers that return bad results, we consider a different fraudulent behavior - cycle short-changing - in which the resource provider faithfully executes the submitted job, but using a smaller percentage of the CPU… Expand
Incentive mechanisms in peer-to-peer networks
TLDR
This work develops incentive mechanisms, which enable the correct operation of peer-to-peer systems, imposing a balance between demand for resources and the existing offer, so that they do not pose an unnecessary burden, slowing down the system excessively. Expand
Deception in Cyberspace: Con-Man Attack in Cloud Services

References

SHOWING 1-10 OF 40 REFERENCES
Cluster Computing on the Fly: resource discovery in a cycle sharing peer-to-peer system
  • D. Zhou, V. Lo
  • Computer Science
  • IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004.
  • 2004
TLDR
This work conducts a comprehensive study of generic searching methods in a highly dynamic peer-to-peer environment for locating idle cycles for workpile applications which are heavy consumers of cycles. Expand
Lightweight Monitoring of the Progress of Remotely Executing Computations
TLDR
This paper describes a monitoring system that uses a sequence of program counter values to monitor program progress, and compiler techniques that automatically generate the monitoring code, which both simplifies and reduces the overhead of monitoring. Expand
Monitoring remotely executing shared memory programs in software DSMs
TLDR
The design and implementation of GripCop DSM is presented, a novel incremental execution monitoring and verification scheme for software distributed shared memory programs running on remote clusters that maximally leverages the shared memory abstraction provided by the SDSM system. Expand
Trust but verify: monitoring remotely executing programs for progress and correctness
TLDR
A novel feature of the GridCop system is that it constructs cooperating submitter and host programs from the original program, and these programs allow both progress and execution correctness to be monitored with negligible overhead while providing protection against common fraudulent behaviors. Expand
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
TLDR
A Wave Scheduler for workpile tasks that exploits idle night-time cycles using a geographic-based overlay and a Point-of-Presence Scheduler to discover and schedule hosts that meet application-specific requirements for location, topological distribution, and available resources are described. Expand
A Self-Organizing Flock of Condors
TLDR
A technique for resource discovery in distributed Condor pools using peer-to-peer mechanisms that are self-organizing, fault-tolerant, scalable, and locality-aware and reduces the maximum job wait time in queue for a heavily loaded pool by a factor of 10. Expand
Hiding communication latency and coherence overhead in software DSMs
TLDR
The simple hardware support proposed allows for the implementation of high-performance software DSMs at low cost and can improve running time performance by up to 50% for TreadMarks, which means that it can double the TreadingMarks speedups. Expand
Java, Peer-to-Peer, and Accountability: Building Blocks for Distributed Cycle Sharing
TLDR
A prototype of a scalable systems that provides facilities to locate resources, to be fair in the use of those resources, and to allow untrusted applications to be safely executed using those resources is described. Expand
Sender-Based Message Logging
TLDR
Sender-based message logging, a low-overhead mechanism for providing transparent fault-tolerance in distributed systems, is described, which allows one to recover from a single failure at a time without the expense of synchronously logging each message to stable storage. Expand
A framework for reducing the cost of instrumented code
TLDR
A general framework for performing instrumentation sampling to reduce the overhead of previously expensive instrumentation, using code-duplication and counter-based sampling to allow switching between instrumented and non-instrumented code. Expand
...
1
2
3
4
...