Figure 5 - uploaded by Asma Adala
Content may be subject to copyright.
Example of Chord overlay network.

Example of Chord overlay network.

Source publication
Article
Full-text available
Currently Web Service (WS) systems are based on central registries for publication and discovery. With the growing number and the dynamicity of WS, this centralized approach rapidly becomes inefficient and impractical. Furthermore, existing WS standards such as WS Description Language (WSDL) and Universal Description, Discovery and Integration (UDD...

Context in source publication

Context 1
... the example of Chord-based overlay network formed by four nodes arranged on a circle with an identifier space from 0 to 2 3−1 (m = 3), as shown in Figure 5. We present an example of a finger table at node 2. ...

Similar publications

Article
Full-text available
In a growing web services environment, the usage, design and composition methods of web services require proper and reliable information about web services quality. Quality-of- Service (QoS) is usually referred to the non-functional characteristics of web services which can be used as an important role to differentiate between different web service...
Article
Full-text available
p class="0abstractCxSpFirst">Muti-view Web services have brought many advantages regarding the early abstraction of end users needs and constraints. Thus, security has been positively impacted by this paradigm, particularly, within Web services applications area, and then Multi-view Web services. In our previous work, we introduce the concept of Mu...
Article
Full-text available
In the past years various methods have been developed which require semantic annotations of Web services as an input. Such methods typically leverage discovery, match-making, composition and execution of Web services in dynamic settings. At the same time a number of automated Web service annotation approaches have been proposed for enabling applica...
Article
Full-text available
Active XML (AXML) as intensional data aims to exploit potential computing powers of XML, Web services and P2P architecture. It is considered a powerful extension of XML to deal with dynamic XML data from autonomous and heterogeneous data sources on a very large scale via Web services. However, AXML is still at an immature stage and various issues n...
Article
Full-text available
Web Services have been steadily gaining maturity as their adoption in the software industry grew. Accordingly, metric suites for assessing different quality attributes of Web Service artifacts have been proposed recently - e.g., for services interfaces in WSDL (Web Service Description Language). Like any other software artifact, WSDL documents have...

Citations

... The network-based service discovery method performs distributed discovery of services. Adala et al. [1] proposed a system that uses peer-to-peer technology to achieve effective semantic publication and discovery in a completely decentralized network. Boukhadra et al. [9] proposed a hybrid P2P network for semantic web service discovery that could solve the efficiency of a singlehop service discovery network. ...
Article
Full-text available
As an application field of service science, cloud manufacturing (CM) has been widely studied in vertical and horizontal services. At present, CM’s vertical service research is limited to the technical research of specific processing and manufacturing and gives less consideration to the background of horizontal integration services. The research on horizontal service judges the effect of the combination only according to quality of service (QoS) attributes. In the actual processing process, the combination’s effect depends not only on QoS but also on the geographical aspects, company, and other attributes. Based on this, we propose a tool combination model based on the task sequence (TCMbTS). The TCMbTS establishes the association ontology model of tool resources and tasks and proposes a mapping method to provide vertical service for CM. Then proposed optimized orientation genetic algorithm (OPOGA) to solve the combination optimization and recommendation problem of TCMbTS and provide horizontal services for CM. Finally, an experiment is performed to verify OPOGA with validity and efficiency.
... Semantic routing and search are important aspects of P2P networks because they aid efficient peer discovery [56][57][58][59][60], [109]. The approach varies, depending on the type of overlay network, it could be structured or unstructured. ...
... In [58], the authors proposed a decentralized system for Semantic Web Services. In order to reduce overhead and complex computation, the approximate solution was sought via sampling-based method; with that assumption that a sample, which is independent and identically distributed, is present at a location to generate a set of candidate items set. ...
Article
Full-text available
Centralized file-sharing networks have low reliability, scalability issues, and possess a single point of failure, thus making peer-to-peer (P2P) networks an attractive alternative since they are mostly anonymous, autonomous, cooperative, and decentralized. Although, there are review articles on P2P overlay networks and technologies, however, other aspects such as hybrid P2P networks, modelling of P2P, trust and reputation management issues, coexistence with other existing networks, and so on have not been comprehensively reviewed. In addition, existing reviews were limited to articles published in or before 2012. This paper performs a state-of-the-art literature survey on the emerging research areas of P2P networks, applications and ensuing challenges along with proposed solutions by scholars. The literature search for this survey was limited to the top-rated publisher of scholarly articles. This research shows that issues with security, privacy, the confidentiality of information and trust management will need greater attention, especially in sensitive applications like health services and vehicle to vehicle communication ad hoc networks. In addition, more work is needed in developing solutions to effectively investigate and curb deviant behaviours among some P2P networks.
... The WSN constituted by all the DAs is based on Chord [34]. Chord is a scalable distributed lookup protocol which has been applied to service discovery [35][36][37]. The most important operation that Chord provides is mapping a given key onto a node. ...
Article
Full-text available
Due to the characteristics of a MANET, none of the existing solutions for service discovery work well in decentralized mobile environments. In this paper, we propose a collaborative self-governing privacy-preserving wireless sensor network architecture to address the issue of service discovery in MANET environment. The proposed architecture is able to dynamically adjust the working modes between directory-based and directory-less modes according to the network status of a MANET. The dynamic network status of a MANET is monitored by a wireless sensor network. Two location optimization algorithms are developed for topology control and the preservation of user location privacy. Simulation results show that the proposed architecture can greatly improve the performance of service discovery.
... In the past decade, many protocols on how to support semantic location in P2P networks are reported, which can be classified into two categories. In [8][9][10][11][12][13], the researchers tried to improve scalability and avoid broadcast storm through reducing flood scope on the basis of unstructured P2P mode. In these methods, member nodes are clustered into groups according to their common interests among nodes, and file location is implemented in the common interest cluster firstly. ...
Article
In peer-to-peer (P2P) networks, with the aim to support semantic search and keep scalability at the same time, a novel double-layer P2P protocol is proposed. Firstly, keywords representing resource characteristics are compressed into bloom filters and structured P2P layer is constructed. Secondly, through analyzing one's bloom filters, each node extracts its interest, which is represented by a characteristic vector V. After obtaining common interest among nodes through comparing their Vs, a small-world model is constructed, and another unstructured P2P layer is obtained. Consequently, on the basis of the decentralized architecture, a double-layer semantic search P2P protocol is structured. When objective resource is being located, its similarity to local interest is used to determine whether it should be located in unstructured P2P semantic layer or structured layer adaptively, which not only improves search efficiency but also supports semantic location more widely. Copyright © 2013 John Wiley & Sons, Ltd.
... Service discovery is a topic that has been researched thoroughly in wired networks. Protocols such as the Service Location Protocol of IETF [17], the Jini Standard of Sun Microsystems [3], and others, such as the one in [1], which were designed for Web Services over wired network, do not directly dwell on MANET environments where self-configurability is the key [13]. With the deployment of wireless ad hoc networks, several service discovery protocols (SDPs) have been proposed for mobile devices and MANETs [4,6,11,14,16,18,19,23,27,30,31]. ...
Article
SUMMARY This paper presents a quality-of-service (QoS) distributed service discovery approach for mobile ad hoc network environments. The approach builds upon a clustered topology, where the clusterhead (CH) is assigned additional roles having to do with maintaining a directory of services in the network and aggregating and computing QoS scores about service providers (SPs) from requesting nodes (RNs) and the providers themselves. To reduce the amount of overhead traffic, the design makes extensive use of piggybacking for relaying and updating the CHs with QoS scores. A mobile device that is interested in a certain service submits a request to its CH, which uses cached QoS data to return a ranked list of SPs that offer the type of requested service. On the basis of its interaction with the SP, the device sends the CH next time it makes a request a score reflecting its perception of the SP's QoS. Over time, the CH develops robust QoS data that it uses to help devices obtain the best available service. Theoretical analysis and experimental evaluation based on simulations prove the advantages of the proposed system and the effectiveness of its operations. Copyright © 2013 John Wiley & Sons, Ltd.
Article
In service-oriented computing networks, it is urgently needed to objectively evaluate service entity's QoS. In previous studies, service entity's QoS is only a weighted QoS that is perceived by users. It cannot objectively reflect the QoS that the service entity can provide in actual network environment. Combined with the actual service composition environment of service entities to characterize QoS of the service entity, a policy for the trusted QoS evaluation and service selection with environment aware is proposed: (1) the QoS of service entity is characterized with different load QoS feature vectors; (2) a trust reasoning and evolution mechanism subjected to trusty entity is established to effectively avoid the shortage of creditable generalization in the trust evolution mechanism; (3) the creditability of service entities and QoS feature vector are deduced based on service entities through the trust evolution; (4) combined with the current service load, a more objective evaluation of QoS that service entities actually provide is obtained. Finally, an integrated trusted QoS evaluation and service selection algorithm is given. Experimental results demonstrate the effectiveness of the policy.
Article
Web Services publication and discovery are commonly implemented over a centralized client-server approach. Therefore, at high requests' rate server nodes are bottlenecked and the system scale is unable to follow the increasing load. To address this issue, we consider the Cloud computing concept where huge amount of resources such as, storage, processing and bandwidth capacities are available on demand. In this paper, we propose a decentralized cloud system, which aims to improve the system performances, such as requests latency and reliability, in compare with the classical centralized cloud architecture. Our solution, called C-Chord, is based on peer-to-peer hierarchical Chord network operating over a fully decentralized Infrastructure as a Service (IaaS) cloud system. In order to enhance the reliability of Web services, C-Chord relies on virtual peers that support diversification of Web Services class. It also introduces a multi-keys Web service query instead of one single key.
Article
The discovery and management of desired network services present significant challenges for mobile networks. Based on the Service Location Protocol, this paper proposes an integrated service discovery architecture for vehicular ad hoc networks. The proposed approach divides the network into several logical zones. The zone structure is formed virtually based on position information. Each logical zone may have a zone directory agent to manage registered services from service providers. The proposed architecture considers both vehicle-to-infrastructure and vehicle-to-vehicle communication modes and introduces roadside directory agents and vehicle directory agents to reduce deployment costs. We also introduce a substitute query technique, cache mechanism, and backup mechanism to improve the request hit ratio and reduce the message overhead of the substitute query. Finally, we implement the proposed mechanisms in Network Simulator version 2, with simulation results showing that the proposed architecture can provide a high average data hit ratio and low message overhead. Copyright © 2015 John Wiley & Sons, Ltd.
Article
The centralized Web services discovery mechanism has some problems such as single point of failure, performance bottleneck, and service invalidation and so on. This paper analyzes the similarity and the common features between Web services and P2P computing environment itself, and presents a Web service discovery mechanism based on improved P2P network. Because of this mechanism utilizing layering thought, the whole P2P network is divided into three-layer chord structure which consists of field ring, service ring and regional ring. And intelligent selection mechanism of nodes is established in regional community to optimize network structure and improve service discovery efficiency. The experimental results in Openchord platform show that this mechanism can effectively deal with the problem of the centralized mechanism for Web service discovery during the Server Oriented Computing.
Article
In this paper, we propose a gradually adaptive recommendation model based on the combination of both users' commonalities and individualities that depend on the semantic mapping of users' interest correlations. We analyze users' information access behaviors and histories to extract users' interests and trace their transitions. In details, according to a set of bookmark tags classified by a semantic means, the pages accessed by users are assigned into several tag classes, which will finally be clustered into different groups in accordance with the types of interests that belong to two categories: personal and common interests, respectively. Based on the detection of users' interest focus transitions through interactions between users, we provide a series of information seeking actions in sequence to the target users. Besides, according to the reference groups which are defined to describe different relations with the target users, the successful experience is extracted and recommended. After the description of the definitions and measures, the mechanism to infer the interest focus, the system architecture and experimental evaluation results are described and demonstrated. Copyright © 2014 John Wiley & Sons, Ltd.