By Topic

Rapid P2P Overlay Network Programming on a Distributed Reduction Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Saito, K. ; Res. Inst. for Digital Media & Content, Keio Univ., Yokohama ; Miyazawa, K.

To build dependable and sustainable systems requires many iterative trials and stepwise improvements. Rapid programming methods and languages have been studied in the field of peer-to-peer overlay network for this reason. This paper proposes a method for quick programming using Overlay GHC[1] language, an extension of Guarded Horn Clauses[2] for overlay network programming. The method involves a technique called RGP (Remote Goal Placement) instead of RPC over an environment that is viewed as a distributed reduction machine.

Published in:

Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE

Date of Conference:

10-13 Jan. 2009