Distributed Service Discovery Research Articles

Edge Cloud Selection: The Essential Step for Network Service Marketplaces

The evolution of 5G network service ecosystems raises the need for the discovery of services among multiple (edge) clouds with potentially heterogeneous resources and features. Besides 5G service deployment, such a service discovery architecture could provide the means for cross-service communication (CSC), that is, the consumption of a network service (NS) by another NS, empowering the service capabilities of the latter. This article presents a distributed service discovery framework for network service marketplaces (NSMs) in edge computing. We exemplify the operation of a new distributed service discovery mechanism that relies on a cache-based protocol for the discovery of NSs among edge clouds. We also present a multi-criteria ranking mechanism, which identifies the most suitable edge cloud according to the client's functional, performance, and cost requirements. Our evaluation results indicate that the proposed service discovery mechanism (SDM) yields service discovery effectiveness on par with other approaches, while drastically reducing the communication overhead.

An IOTA-Based Service Discovery Framework for Fog Computing

With the rise in fog computing, users are no longer restricted to only accessing resources located in central and distant clouds and can request services from neighboring fog nodes distributed over networks. This can effectively reduce the network latency of service responses and the load of data centers. Furthermore, it can prevent the Internet’s bandwidth from being used up due to massive data flows from end users to clouds. However, fog-computing resources are distributed over multiple levels of networks and are managed by different owners. Consequently, the problem of service discovery becomes quite complicated. For resolving this problem, a decentralized service discovery method is required. Accordingly, this research proposes a service discovery framework based on the distributed ledger technology of IOTA. The proposed framework enables clients to directly search for service nodes through any node in the IOTA Mainnet to achieve the goals of public access and high availability and avoid network attacks to distributed hash tables that are popularly used for service discovery. Moreover, clients can obtain more comprehensive information by visiting known nodes and select a fog node able to provide services with the shortest latency. Our experimental results have shown that the proposed framework is cost-effective for distributed service discovery due to the advantages of IOTA. On the other hand, it can indeed enable clients to obtain higher service quality by automatic node selection.

A New Approach Customizable Distributed Network Service Discovery System

Computer systems and applications on the internet provide services to outsiders and, at the same time, the vulnerabilities may be exploited by attackers and leak some sensitive private information. To collect and monitor the service information provided by the network environment such as IoT (Internet of Things), vehicular networks, cloud computing, and cloud storage, it is particularly important that a system can provide faster service discovery for discovering and identifying specific network services. The current service discovery systems mainly use port scanning technology, including Nmap, Zmap, and Masscan. However, these technologies hard code the service features and only support common services so that cannot cope with real‐time updates and changing network services. To solve the above problems, this paper proposed a customizable distributed network service discovery system based on stateless scanning technology of Masscan and proposed a customizable interactive pattern set syntax. The system used random destination address technologies to scan for Ipv4 address allocation and used a distributed deployment scheme. Experimental results show that the system has high scanning speed and has high adaptability to new services and special services.

Cluster Based Distributed Service Discovery in Internet of Vehicle

Cluster Based Distributed Service Discovery in Internet of Vehicle

ADSDA: Adaptive Distributed Service Discovery Algorithm for Internet of Things Based Mobile Wireless Sensor Networks

Emerging technologies and applications in the Internet of Things (IoT) domain require highly dynamic sensor network infrastructure. Discovering service available on such dynamic networks is a fundamental but challenging problem that needs to be addressed. In this paper, we present a new adaptive distributed service discovery algorithm (ADSDA) that allows service discovery (SD) and selection of services for IoT-based highly dynamic sensor network environments. The proposed lightweight context-aware service discovery architecture provides an effective infrastructure to facilitate environment-aware and user-centric SD. The performance of the proposed ADSDA is analyzed through extensive simulation. The evaluation and comparison of results with the existing baseline approaches prove the effectiveness of our proposed ADSDA in terms of query success rate, number of transmission messages, and transmission cost per query.

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

New systems can be designed, developed, and managed as societies of agents that interact with each other by offering and providing services. These systems can be viewed as complex networks where nodes are bounded rational agents. In order to deal with complex goals, they require cooperation of the other agents to be able to locate the required services. The aim of this paper is formally and empirically analyze under which circumstances cooperation emerges in decentralized search of services. We propose a repeated game model that formalizes the interactions among agents in a search process where agents are free to choose between cooperate or not in the process. Agents make decisions based on the cost of their actions and the expected reward if they participate forwarding queries in a search process that ends successfully. We propose a strategy that is based on random-walks, and we study under what conditions the strategy is a Nash equilibrium. We performed several experiments in order to evaluate the model and the strategy and to analyze which network structures are more appropriate to promote cooperation.

Towards efficient distributed service discovery in low-power and lossy networks

Low-power and Lossy Networks (LLNs) have been recognised as a promising technology to achieve ubiquity in the internet of things era. To realise this, service oriented architectures and the emerging IPv6 over low-power wireless personal area network (6LoWPAN) standard are identified as key paradigms. One of the main elements to succeed any service oriented approach is a proficient service discovery protocol. In this paper, we propose EADP: an efficient protocol to announce and discover services in 6LoWPAN networks. EADP adopts a fully distributed approach using an adaptive push---pull model to ensure fast discovery times, low energy consumption and low generated overhead with timely reaction to network dynamics. EADP achieves this by using context-awareness information, delivered by a trickle algorithm. EADP was implemented and evaluated in Contiki using the Cooja simulator. Simulation results show EADP's capability to realise fast discovery times with low cost in terms of energy and overhead. These achievements make EADP very suitable for pervasive LLN applications.

Distributed Service Discovery Algorithm Based on Ant Colony Algorithm

UDDI is a universal description, discovery and integration protocol. As a public registry of Web service, it is designed to store information about each company and its service. Traditional centralized service discovery structure of UDDI service registration center does not apply to large- scale service discovery. When all the services register to a center, the service bottleneck, failure of single point and the poor scalability defects will occur. In addition, traditional service matching mechanisms are mainly based on keywords method which lacks of semantic description and makes the service publisher and demanders cannot reach a common semantic understanding. This will lead to the problems of semantic conflicts and low accuracy that seriously affects the precision and recall of service matching. To address these shortcomings of the centralized service discovery structure of UDDI, we propose a distributed semantic service registration center which is in the construction of loosely coupled P2P network enabled the progressive massive search. In the P2P distributed network, there can be a large number of nodes to store the registration information which is suitable for large-scale service because of the adaptivity, scalability and good fault tolerance characteristics. In order to reduce the number of concurrent transmitted packets, the advanced ant colony algorithm is introduced to forward packets by probabilistic choice. The results comparison with the traditional algorithm is given through the simulation experiments and it has shown that the proposed method has good performance for the distributed service discovery Index Terms—UDDI, P2P distributed network, Semantic, Ant colony algorithm

Quality‐of‐service‐aware cluster‐based service discovery approach for mobile ad hoc networks

SUMMARYThis 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.

Proxy-based Selective Forwarding in Distributed Service Discovery using Application Oriented Networking

Proxy-based Selective Forwarding in Distributed Service Discovery using Application Oriented Networking

Distributed geographic service discovery for mobile sensor networks

Many of the recent sensor network applications assume node mobility. The service provisioning protocol should therefore be designed to be stateless and scalable for continuously changing link states of typical mobile sensor nodes. In this paper, we propose DSDP, Distributed Service Discovery Protocol, for mobile sensor networks. DSDP organizes the network area into hierarchical regions to reduce service update cost. Regions at the lowest hierarchy cover a two-hop range area, and nodes freely move within the larger area without updating the service coordinators. Due to the low hierarchy architecture, the increased size of the minimal regions helps to reduce the runtime overhead. Node mobility is specifically considered in DSDP. Depending on the nodes’ mobility, nodes in DSDP work as service coordinators for requested services, and the discovery protocol runs in a distributed manner to lessen the overhead. Both the simulation and experimental results show that the proposed mechanism achieves a high service query success rate and low service update overhead in mobile sensor networks.

Distributed Service Discovery Based on Agent and Ant Colony Algorithm

PDF HTML阅读 XML下载 导出引用 引用提醒 基于Agent和蚁群算法的分布式服务发现 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant Nos.60773103, 60903161, 60903162, 90912002 (国家自然科学基金); the National Basic Research Program of China under Grant No.2010CB328104 (国家重点基础研究发展计划(973)); the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No.200802860031 (高等学校博士学科点专项科研基金); the Jiangsu Provincial Natural Science Foundation of China under Grant Nos.BK2007708, BK2008030 (江苏省自然科学基金); the Jiangsu Provincial Key Laboratory of Network and Information Security of China under Grant No.BM2003201 (江苏省网络与信息安全重点实验室); the Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education of China under Grant No.93K-9 (东南大学计算机网络和信息集成教育部重点实验室) Distributed Service Discovery Based on Agent and Ant Colony Algorithm Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:提出一种类似蚂蚁觅食活动的Agent服务发现机制.有两类Agent 合作寻找目标服务:Search Agent和Guide Agent.前者模拟蚂蚁的行为在网络上发现目标服务,后者管理一个由信息素和跳数组成的服务路由表,用以指导Search Agent的行进路线.动态变化的信息素可以让Search Agent感知到网络拓扑和服务资源的变化,而跳数可以让它们了解距离.路由选择中还使用语义相似度作为启发因子,用于提高召回率.Search Agent生命周期控制机制使查询流量负载成为可控的,并具有确定的上界.实验结果表明,该方法在大规模的分布式计算环境下具有良好的可扩展性和动态环境下的适应性. Abstract:This paper suggests an ant-like agent service discovery mechanism. There are two types of agents cooperating to search target services: Search Agent and Guide Agent. Search Agent simulates the behavior of an ant that searches for services on the network. Guide Agent is responsible to manage a service route table that consists of pheromone and hop count, instructing Search Agent’s routing. Volatile pheromones make Search Agent sense the change of topology and service resource, and hop count makes them know the distance. Semantic similarity is also introduced in routing selection as a heuristic factor, which improves the recall. The life-span control policy makes query traffic controllable. With system size increasing, the query traffic would increase slightly and has an upper bound. The result of simulation shows that the suggested mechanism is scalable and adaptable enough to be suitable for large-scale dynamic computing environments. 参考文献 相似文献 引证文献

A Light-Weight Service Discovery Protocol for Ad Hoc Networks

Problem statement: In mobile ad hoc networks devices do not rely on a fixed infrastructure and thus have to be self-organizing. This gives rise to various challenges to network applications. Existing service discovery protocols fall short of accommodating the complexities of the ad-hoc environment. However, the performance of distributed service discovery architectures that rely on a virtual backbone for locating and registering available services appeared very promising in terms of average delay but in terms of message overhead, are the most heavy-weight. In this research we propose a very light-weight, robust and reliable model for service discovery in wireless and mobile networks by taking into account the limited resources to which are subjected the mobile units. Approach: Three processes are involved in service discovery protocols using virtual dynamic backbone for mobile ad hoc networks: registration, discovery and consistency maintenance. More specifically, the model analytically and realistically differentiates stable from unstable nodes in the network in order to form a subset of nodes constituting a relatively stable virtual Backbone (BB). Results: Overall, results acquired were very satisfactory and meet the performance objectives of effectiveness especially in terms of network load. A notable reduction of almost 80% of message signaling was observed in the network. This criterion distinguishes our proposal and corroborate to its light-weight characteristic. On the other hand, results showed reasonable mean time delay to the requests initiated by the clients. Conclusion: Extensive simulation results obtained confirm the efficiency and the light-weight characteristic of our approach in significantly reducing the cost of message overhead in addition to having the best delay values when compared with strategies well-known in the literature.

DSDM: A Distributed Service Discovery Model for Manets

Service discovery is indispensable to ad hoc networking where establishing a stand-alone and self-configurable communication environment is the main objective. This paper concentrates on designing a distributed service discovery model for service sharing among diverse mobile devices in mobile ad hoc networks. This model is built on top of the network layer of the TCP/IP stack and benefits from the up-to-date routing information enabled by proactive routing protocols that attempt to keep the information in the routing tables of the mobile nodes current. The designed system is based on storing service descriptions in selected nodes that are searched in accordance to a proposed Minimum Distance Packet Forwarding (MDPF) algorithm. In addition to identifying and analyzing the design parameters of the system, this paper studies the delay and traffic performance using analytical derivations and experimental evaluation based on the ns-2 network simulation software. The system is intended to be used in a collaborative mobile ad hoc network environment whereby a mobile node can consume services, share them, or facilitate such sharing by helping other nodes find them.

Context-Sensitive Service Discovery Experimental Prototype and Evaluation

The amount of different networks and services available to users today are increasing. This introduces a need for ways to locate and sort out irrelevant services in the process of discovering available services for a user. In this paper, we describe and evaluate a prototype of an automated discovery and selection system, which locates services that are relevant to a user based on his/her context and the context of the available services. The prototype is based on a multi-level, hierarchical system approach and introduces entities called User-nodes, Super-nodes, and Root-nodes. These entities separates the network into domains that handle the complex distributed service discovery, which is based on dynamically changing context information. In the prototype, a method for performing context-sensitive service discovery has been achieved. The service discovery part utilizes UPnP, which has been extended in order to increase network scalability. The experimental analysis of service discovery times, based on different scenarios is used to optimize parameter settings of the service discovery system in order to achieve short response times.

Towards a web services and intelligent agents-based negotiation system for B2B eCommerce

With the explosive growth of the number of transactions conducted via electronic channels, there is a pressing need for the development of intelligent support tools to improve the degree and sophistication of automation for eCommerce. With reference to the BBT business model, negotiation is one of key steps for B2B eCommerce. Nevertheless, classical negotiation models are ineffective for supporting multi-agent multi-issue negotiations often encountered in eBusiness environment. The first contribution of this paper is the exploitation of Web services and intelligent agent techniques for the design and development of a distributed service discovery and negotiation system to streamline B2B eCommerce. In addition, an effective and efficient integrative negotiation mechanism is developed to conduct multi-party multi-issue negotiations for B2B eCommerce. Finally, an empirical study is conducted to evaluate our intelligent agents-based negotiation mechanism and to compare the negotiation performance of our software agents with that of their human counterparts. Our research work opens the door to the development of the next generation of intelligent system solutions to support B2B eCommerce.

Toward Distributed service discovery in pervasive computing environments

The paper proposes a novel distributed service discovery protocol for pervasive environments. The protocol is based on the concepts of peer-to-peer caching of service advertisements and group-based intelligent forwarding of service requests. It does not require a service to be registered with a registry or lookup server. Services are described using the Web Ontology Language (OWL). We exploit the semantic class/subClass hierarchy of OWL to describe service groups and use this semantic information to selectively forward service requests. OWL-based service description also enables increased flexibility in service matching. We present simulation results that show that our protocol achieves increased efficiency in discovering services (compared to traditional broadcast-based mechanisms) by efficiently utilizing bandwidth via controlled forwarding of service requests.

Service Composition for Mobile Environments

Service Composition, that is, the development of customized services by discovering, integrating and executing existing services has received a lot of attention in the last couple of years with respect to wired-infrastructure or Internet web services. With the advancement in the wireless technology and rapid deployment of mobile devices, we envision that in the near future wirelessly connected mobile devices in a given vicinity will also provide services that can be leveraged in the composition process. This is particularly true of what have been described as “pervasive computing” environments. However, wired-infrastructure based service composition architectures are not designed to consider the various factors like mobility, device heterogeneity, resource variability and reliability in a mobile environment. In this paper, we describe the issues related to service composition in mobile environments and evaluate criteria for judging protocols that enable such composition. We present a distributed architecture and associated protocols for service composition in mobile environments that take into consideration mobility, dynamic changing service topology and device resources. The composition protocols are based on distributed brokerage mechanisms and utilize a distributed service discovery process over ad-hoc network connectivity. We present simulation results of our protocols, and compare them with a centralized service composition protocol traditionally used for wired-infrastructure environments. The results show that our approach clearly outperforms the existing centralized approaches, and that our protocols are able to adapt and better utilize the changing service topology and resources in a mobile environment.

Service discovery in mobile ad hoc networks: an overall perspective on architectural choices and network layer support issues

Service discovery is indispensable to ad hoc networking where establishing a stand-alone and self-configurable communication environment is the main objective. In this paper, we first discuss possible service discovery architectures along with the required network support for their implementation in mobile ad hoc networks. We then propose a distributed service discovery architecture that relies on a virtual backbone for locating and registering available services within a dynamic network topology. Our proposal consists of two independent components: (i) formation of a virtual backbone and (ii) distribution of service registrations, requests, and replies. The first component creates a mesh structure from a subset of a given network graph that includes the nodes acting as service brokers and also a subset of paths (which we refer to as virtual links) connecting them. Service broker nodes (SBNs) constitute a dominating set, i.e. all the nodes in the network are either in this set or only one-hop away from at least one member of the set. The second component establishes sub-trees rooted at service requesting nodes and registering servers for efficient dissemination of the service discovery control messages. Extensive simulation results are provided for comparison of performance measures, i.e. latency, success rate, and control message overhead, when different architectures and network support mechanisms are utilized in service discovery.

DSI: distributed service integration for service grid

This paper presents DSI, a distributed service discovery and integration utility for service grid. The goal of DSI is efficiently to improve service publishing, deletion and lookup, decentralized control, scalability, and availability. DSI comprises a logically global metadata pool and a double-layered DHT (Distributed Hash Table). Efficient service publishing and lookup are achieved by adopting DHT. Clean service deletion is guaranteed by time-stamping. And system availability is improved by replication combined with automatic indexer selection. Experiments show that DSI can achieve short response time, low processing cost and high availability.