Improving Resource Discovery in the Arigatoni Overlay Network

International audienceArigatoni is a structured multi-layer overlay network providing various services with variable guarantees, and promoting an intermittent participation to the virtual organization where peers can appear, disappear and organize themselves dynamically. Arigatoni mainly concerns with how resources are declared and discovered in the overlay, allowing global computers to make a secure, PKI-based, use of global aggregated computational power, storage, information resources, etc. Arigatoni provides fully decentralized, asynchronous and scalable resource discovery, and provides mechanisms for dealing with dynamic virtual organizations. This paper introduces a non trivial improvement of the original resource discovery protocol by allowing to register and to ask for multiple instances. Simulations show that it is efficient and scalable

Logical Networks: Self-organizing Overlay Networks and Overlay Computing Systems: [EPI Proposal V2.0]

Contents 1 Team on March 15, 2010 ...........................................42 Capsule ...........................................52.1 Slogan and logo............................................ 5 2.2 One equation fits all and keywords ................................. 6 2.3 How to read this proposal ...................................... 63 Vertical view ...........................................63.1 Panorama............................................... 6 3.2 General definitions .......................................... 8 3.3 Virtual organization ......................................... 9 3.4 Execution model ........................................... 94 Horizontal view ...............................................94.1 Panorama............................................... 94.2 Arigatoni overlay network ...................................... 10 4.2.1 Arigatoni units........................................ 10 4.2.2 Virtual organizations in Arigatoni ............................. 12 4.2.3 Resource discovery protocol (RDP)............................. 12 4.2.4 Virtual Intermittent Protocol (VIP) ............................ 13 4.2.5 iNeu: librairies for network computing........................... 144.3 Babelchord, a DHT’s tower ..................................... 144.4 Synapse,interconnecting heterogeneous overlay networks. . . . . . . . . . . . . . . . . . . . . 154.5 Cross-layer overlay design for geo-sensible applications . . . . . . . . . . . . . . . . . . . . . . 175 Diagonal view...............................................175.1 Panorama............................................... 17 5.2 Trees versus graphs: a conflict without a cause .......................... 17 5.3 Fault tolerance ............................................ 18 5.4 Parametricity and universality ................................... 18 5.5 Social networking........................................... 19 5.6 Choice of development platform................................... 19 5.7 Quality metrics for an overlay computer .............................. 19 5.8 Trust and security .......................................... 20 5.9 New models of computations .................................... 216 Topics and time line...............................................226.1 Panorama............................................... 226.2 Topicview............................................... 22 6.2.1 Vertical issues......................................... 22 6.2.2 Horizontal issues ....................................... 22 6.2.3 Diagonalissues........................................ 236.3 Timeview............................................... 23 6.3.1 Short-term .......................................... 23 6.3.2 Medium-term......................................... 24 6.3.3 Long-term........................................... 247 Potential application domains ...........................................247.1 Panorama............................................... 24 7.2 P2P social networks ......................................... 25 7.3 Overlay computer for mobile ad hoc networks........................... 25 7.4 OverStic: the mesh overlay network in Sophia Antipolis ..................... 27 7.5 Reducing the Digital Divide..................................... 28 7.6 GRID applications: scenario for seismic monitoring ....................... 29 7.7 Interconnection of heterogeneous overlay networks ........................ 30 7.8 Toward an overlay network of things (RFID) ........................... 318 Software ...........................................328.1 Panorama............................................... 328.2 Prototype software.......................................... 32 8.2.1 Arigatoni simulator ..................................... 32 8.2.2 Ariwheels........................................... 32 8.2.3 BabelChord.......................................... 36 8.2.4 Synapse............................................ 37 8.2.5 Open-Synapse Client..................................... 38 8.2.6 myTransport Gui....................................... 39 8.2.7 CarPal: a P2P carpooling service ............................. 39 8.2.8 Husky interpreter....................................... 408.3 Potential software .......................................... 41 8.3.1 myMed (in french), see http://www-sop.inria.fr/mymed . . . . . . . . . . . . . . . . 419 Contracts...........................................439.1 INTERREG Alcotra: myMed,2010-2013.............................. 43 9.2 COLOR:JMED,2010 ........................................ 43 9.3 FP6 FET GlobalComputing: IST AEOLUS, 2006-2010 ..................... 43 9.4 JET TEMPUS DEUKS, 2007-2009................................. 4410 Collaborations ...........................................4411 Self assessment ...........................................4411.1 Trivia ................................................. 45 11.2 Conclusions.............................................. 45We propose foundations for generic overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computational agents, virtually organized in colonies or virtual organizations, and ruled by a leader (broker) who is elected democratically (vox populi, vox dei) or imposed by system administrators (primus inter pares). Every agent asks the broker to log in the colony by declaring the resources that can be offered (with variable guarantees). Once logged in, an agent can ask the broker for other resources. Colonies can recursively be considered as evolved agents who can log in an outermost colony governed by another super-leader. Communications and routing intra-colonies goes through a broker-2-broker PKI-based negotiation. Every broker routes intra- and inter- service requests by filtering its resource routing table, and then forwarding the request first inside its colony, and second outside, via the proper super-leader (thus applying an endogenous-first-estrogen- last strategy). Theoretically, queries are formulæ in first-order logic equipped with a small program used to orchestrate and synchronize atomic formulæ (atomic services). When the client agent receives notification of all (or part of) the requested resources, then the real resource exchange is performed directly by the server(s) agents, without any further mediation of the broker, in a pure peer-to-peer fashion. The proposed overlay promotes an intermittent participation in the colony, since peers can appear, disappear, and organize themselves dynamically. This implies that the routing process may lead to failures, because some agents have quit or are temporarily unavailable, or they were logged out manu militari by the broker due to their poor performance or greediness. We aim to design, validate through simulation, and implement these foundations in an overlay network computer system. (From [Liquori-Cosnard TGC-07 paper])

Powerful Resource Discovery for Arigatoni Overlay Network

International audienceArigatoni is a structured multi-layer overlay network providing various services with variable guarantees, and promoting an intermittent participation in the overlay since peers can appear, disappear, and organize themselves dynamically. Arigatoni provides fully decentralized, asynchronous and scalable resource discovery; it also provides mechanisms for dealing with an overlay with a dynamic topology. This paper introduces a non trivial improvement of the resource discovery protocol by allowing the registration and request of multiple instances of the same service, service conjunctions, and multiple services. Adding multiple instances is a non trivial task since the discovery protocol must keep track (when routing requests) of peers that accept to serve and peers that deny the service. Adding service conjunctions allows a single peer to offer different services at the same time. Simulations show that it is efficient and scalable

Designing and Handling Failure issues in a Structured Overlay Network Based Grid

Grid computing is the computing paradigm that is concerned with coordinated resource sharing and problem solving in dynamic, autonomous multi-institutional virtual organizations. Data exchange and service allocation between virtual organizations are challenging problems in the field of Grid computing, due to the decentralization of Grid systems. The resource management in a Grid system ensures efficiency and usability. The required efficiency and usability of Grid systems can be achieved by building a decentralized multi-virtual Grid system. In this thesis we present a decentralized multi-virtual resource management framework in which the system is divided into virtual organizations, each controlled by a broker. An overlay network of brokers is responsible for global resource management and managing the allocation of services. We address two main issues for both local and global resource management: 1) decentralized allocation of tasks to suitable nodes to achieve both local and global load balancing; and 2) handling of both regular and broker failures. Experimental results verify that the system achieves dependable performance with various loads of services and broker failures

Arigatoni: A Simple Programmable Overlay Network

International audienceWe design a lightweight Overlay Network, called Arigatoni, that is suitable to deploy the Global Computing Paradigm over the Internet. Communications over the behavioral units of the model are performed by a simple communication protocol. Basic Global Computers can communicate by first registering to a brokering service and then by mutually asking and offering services, in a way that is reminiscent to Rapoport's "tit-for-tat" strategy of cooperation based on reciprocity. In the model, resources are encapsulated in the administrative domain in which they reside, and requests for resources located in another administrative domain traverse a broker-2-broker negotiation using classical PKI mechanisms. The model is suitable to fit with various global scenarios from classical P2P applications, like file sharing, or band-sharing, to more sophisticated Grid applications, like remote and distributed big (and small) computations, to possible, futuristic real migrating computations. Indeed, our model fits some of the objectives suggested by the CoreGrid Network of Excellence, as described in Schwiegelshohn et al. (Schwiegelshohn et al., 2005)