The Experts below are selected from a list of 28539 Experts worldwide ranked by ideXlab platform
Hui Zhang - One of the best experts on this subject based on the ideXlab platform.
-
scalable web service discovery on p2p Overlay Network
IEEE International Conference on Services Computing, 2007Co-Authors: Gang Zhou, Rui Chen, Hui ZhangAbstract:Decentralized approaches for Web services discovery, such as peer-to-peer, become more and more attention - getting in the scientific community. In this paper, we propose a peer-to-peer framework, which adopts an enhanced skip graph named Servicelndex as the Overlay Network for service discovery. To guarantee discovery efficiency, Servicelndex schemed WSDL-S (Web services semantics) as semantic Web services description language and extracted its semantic attributes as indexing keys in skip graph. Also a multi-layer P2P Overlay Network was constructed to aggregate similar keys and keep load balancing on peer nodes. The evaluation showed that the Servicelndex system performs considerable service discovery efficiency.
Michael B Jones - One of the best experts on this subject based on the ideXlab platform.
-
skipnet a scalable Overlay Network with practical locality properties
USENIX Symposium on Internet Technologies and Systems, 2003Co-Authors: Nicholas J A Harvey, Marvin M Theimer, Michael B Jones, Stefan Saroiu, Alec WolmanAbstract:Scalable Overlay Networks such as Chord, CAN, Pastry, and Tapestry have recently emerged as flexible infrastructure for building large peer-to-peer systems. In practice, such systems have two disadvantages: They provide no control over where data is stored and no guarantee that routing paths remain within an administrative domain whenever possible. SkipNet is a scalable Overlay Network that provides controlled data placement and guaranteed routing locality by organizing data primarily by string names. SkipNet allows for both fine-grained and coarse-grained control over data placement: Content can be placed either on a pre-determined node or distributed uniformly across the nodes of a hierarchical naming sub-tree. An additional useful consequence of SkipNet's locality properties is that partition failures, in which an entire organization disconnects from the rest of the system, can result in two disjoint, but well-connected Overlay Networks.
-
overlook scalable name service on an Overlay Network
International Conference on Distributed Computing Systems, 2002Co-Authors: Marvin M Theimer, Michael B JonesAbstract:This paper indicates that a scalable fault-tolerant name service can be provided utilizing an Overlay Network and that such a name service can scale along a number of dimensions: it can be sized to support a large number of clients, it can allow large numbers of concurrent lookups on the same name or sets of names, and it can provide name lookup latencies measured in seconds. Furthermore, it can enable updates to be made pervasively visible in times typically measured in seconds for update rates of up to hundreds per second. We explain how many of these scaling properties for the name service are obtained by reusing some of the same mechanisms that allowed the underlying Overlay Network to scale. Finally, we observe that the Overlay Network is sensitive to bandwidth and CPU limitations.
Ronnie Belmans - One of the best experts on this subject based on the ideXlab platform.
-
A Robust Semantic Overlay Network for Microgrid Control Applications
Lecture Notes in Computer Science, 2008Co-Authors: Geert Deconinck, Koen Vanthournout, Hakem Beitollahi, Zhifeng Qui, Rui Duan, Bart Nauwelaers, Emmanuel Van Lil, Johan Driesen, Ronnie BelmansAbstract:Control systems for electrical microgrids rely ever more on heterogeneous off-the-shelf technology for hardware, software and Networking among the intelligent electronic devices that are associated with dispersed energy resources. For distributed microgrid applications in a dynamic environment, Overlay Networksprovide an opportunity for a flexible and robust logical communication infrastructure among these intelligent electronic devices. Agora is a semantic Overlay Network that allows to efficiently route queries -related to microgrid control- in the Overlay Network, based on an XML description of the static and dynamic characteristics of the intelligent electronic devices. It is robust against changes in the microgrid and ICT infrastructure, and provides graceful degradation in case of unrecovered failures.
Geert Deconinck - One of the best experts on this subject based on the ideXlab platform.
-
Agora: a semantic Overlay Network
International Journal of Critical Infrastructures, 2009Co-Authors: Geert Deconinck, Koen VanthournoutAbstract:Overlay Networks are increasingly receiving attention as a scalable and distributed platform to realise resource discovery for file-sharing applications. However, their potential application range is much broader, as they can even serve as a communications infrastructure for distributed control and automation, e.g., underlying the electricity infrastructure. This requires the support of generic primitives such as, e.g., attribute-based semantic routing. Due to their focus on file sharing, today's systems do not or inefficiently support attribute-based semantic routing. In response, this paper proposes an innovative Overlay class that supports attribute-based, semantic addressing. Agora, a set of algorithms, provides an implementation of such semantic Overlay Network. The simulation results confirm the claims.
-
A Robust Semantic Overlay Network for Microgrid Control Applications
Lecture Notes in Computer Science, 2008Co-Authors: Geert Deconinck, Koen Vanthournout, Hakem Beitollahi, Zhifeng Qui, Rui Duan, Bart Nauwelaers, Emmanuel Van Lil, Johan Driesen, Ronnie BelmansAbstract:Control systems for electrical microgrids rely ever more on heterogeneous off-the-shelf technology for hardware, software and Networking among the intelligent electronic devices that are associated with dispersed energy resources. For distributed microgrid applications in a dynamic environment, Overlay Networksprovide an opportunity for a flexible and robust logical communication infrastructure among these intelligent electronic devices. Agora is a semantic Overlay Network that allows to efficiently route queries -related to microgrid control- in the Overlay Network, based on an XML description of the static and dynamic characteristics of the intelligent electronic devices. It is robust against changes in the microgrid and ICT infrastructure, and provides graceful degradation in case of unrecovered failures.
Luigi Liquori - One of the best experts on this subject based on the ideXlab platform.
-
Resource Discovery in the Arigatoni Overlay Network
2010Co-Authors: Raphael Chand, Luigi Liquori, Michel CosnardAbstract:Arigatoni is a lightweight Overlay Network for dynamic and generic Resource Discovery. Entities in Arigatoni are organized in Colonies. A colony is a simple virtual organization composed by exactly one leader, offering some broker-like services, and some set of Individuals. Individuals are subcolonies of individuals, or basic units called Global Computers. Global computers communicate by first registering to the colony and then by mutually asking and offering services. The leader, called Global Broker, has the job to analyze service requests/responses coming from its own colony or arriving from a surrounding colony, and to route requests/responses to other individuals. After this discovery phase, individuals get in touch with each others without any further intervention from the system, typically in a P2P fashion. Communications over the behavioral units of the Overlay Network are performed by a simple Global Internet Protocol. Arigatoni provides fully decentralized, asynchronous and scalable resource discovery, that can be used for various purposes from P2P applications to more sophisticated Grid applications. The main focus of this paper is to present the resource discovery algorithm used in Arigatoni, that is reminiscent to some algorithms employed in the publish/subscribe paradigm. We show some simulations that show that resource discovery in Arigatoni is efficient and scalable.
-
Powerful Resource Discovery for Arigatoni Overlay Network
Future Generation Computer Systems, 2008Co-Authors: Raphael Chand, Michel Cosnard, Luigi LiquoriAbstract:Arigatoni 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.
-
Improving Resource Discovery in the Arigatoni Overlay Network
2007Co-Authors: Raphael Chand, Luigi Liquori, Michel CosnardAbstract:Arigatoni 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.
-
Arigatoni: A Simple Programmable Overlay Network
IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06), 2006Co-Authors: Didier Benza, Michel Cosnard, Luigi Liquori, Marc VesinAbstract:We 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)
