• Title/Summary/Keyword: Service Discovery

Search Result 409, Processing Time 0.048 seconds

Efficient Service Discovery Scheme based on Clustering for Ubiquitous Computing Environments (유비쿼터스 컴퓨팅 환경에서 클러스터링 기반 효율적인 서비스 디스커버리 기법)

  • Kang, Eun-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.123-128
    • /
    • 2009
  • In ubiquitous computing environments, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery scheme that is combined a node id-based clustering service discovery scheme and a P2P caching-based information spreading scheme. To search quickly a service, proposed scheme store key information in neighbor's local cache and search services using it's information. We do not use a central look up server and do not rely on flooding. Through simulation, we show that the proposed scheme improves the performance of response time and network load compared to other methods.

  • PDF

Ontology describing Process Information for Web Services Discovery (웹 서비스 발견을 위해 프로세스 정보를 기술하는 온톨로지)

  • Yu, Jeong-Youn;Lee, Kyu-Chul
    • The Journal of Society for e-Business Studies
    • /
    • v.12 no.3
    • /
    • pp.151-175
    • /
    • 2007
  • Until now, most semantic web service discovery research has been carried out using either Web Service Modeling Ontology (WSMO) or a profile of OWL-based Web Service ontology (OWL-S). However, such efforts have focused primarily on service name and input/output ontology. Thus, the internal information of a service has not been utilized, and queries regarding internal information such as 'Find book-selling services allowing payment after delivery' are not addressed. This study outlines the development of TM-S (Topic Maps for Service) ontology and TMS-QL (TM-S Query Language), two novel technologies that address the aforementioned issues in semantic web service discovery research. TM-S ontology describes the behavior of services using process information and consists of three sub-ontologies: process signature ontology, process structure ontology and process concept ontology. TMS-QL allows users to describe service discovery requests.

  • PDF

A Study on Discovery Service using JClarens in Grid Computing Environment (Grid 컴퓨팅 환경에서 JClarens를 이용한 Discovery Service 연구)

  • Shim Eui-Kyu;Lee Moo-Hun;Park Hee-Yong;Choi Eui-In
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1451-1454
    • /
    • 2006
  • Grid 컴퓨팅은 과학 분야에서 처음 시작되어 현재 과학 분야뿐만 아니라 e-business와 같은 더 많은 분야에서 폭 넓은 활용을 위하여 SOA(Services Oriented Architecture)를 채택하게 되었으며, SOA 프레임워크에 있는 기존의 어플리케이션과 프로그래밍 라이브러리를 통합하게 되었다. 특히 SOA에 기반을 둔 Clarens Grid 서비스 프레임워크는 권한 부여(authorization), 접근 제어(access control), Discovery Service를 제공한다. 본 논문에서는 Java로 구현한 JClarens를 이용하여 Discovery Service를 구현하는 두 가지 방법을 기술하고, 그 구현 방법으로 인해 발생할 수 있는 서비스 재등록으로 인한 네트워크 트래픽 증가에 대한 문제점을 진단하고 재등록을 위한 시간 간격을 차등화 함으로서 이 문제점을 해결할 수 있는 방안을 제안하였다. 따라서 Discovery Service는 Grid 컴퓨팅 환경에서 사용자에게 가장 적절한 자원을 발견할 수 있도록 지원 할 것이다.

  • PDF

Service Discovery Mechanism based on Trustable DHT in MANET (MANET에서 신뢰성 있는 DHT기반의 서비스 발견 기법)

  • Han, In-Sung;Ryou, Hwang-Bin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1947-1954
    • /
    • 2009
  • Service discovery mechanism is a core technique for getting a desired service in MANET(Mobile Ad-Hoc NETwork) environment. However, As feature of MANET, existing mechanisms have some problem that service requester search for trustable service. also it can not support scalability. in this paper, how to reliably support applications such as service discovery on top of MANET. we are firstly finding a trustable service provider and configure DHT(Distributed Hash Table). P2P's DHT can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. Especially, Proposed DHT systems used for P2P overlay network can be effective in reducing the communication overhead in service discovery. So proposed mechanism can support for reliably searching required service and scalability. Simulation results show that our mechanism is scalable and outperforms existing service discovery mechanism.

Distributed Hash Table based Service Discovery in Mobile Ad Hoc Network (모바일 애드 혹 네트워크에서 분산 해쉬 테이블 기반의 서비스 탐색 기법)

  • Jung, Jae-Hoon;Lee, Seung-Hak;Kim, Nam-Gi;Yoon, Hyn-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.91-97
    • /
    • 2008
  • In order to get a desired service in such environments, we need a service discovery method for discovering a device providing that service. In this paper, we propose a service discovery protocol which is based on DHTs (Distributed Hash Tables) to solve these problems. Our protocol is scalable since it does not require a central lookup server and does not rely on multicast or flooding. Simulation results show that our protocol is scalable and outperforms existing service discovery protocols.

A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments

  • Kang, Sae-Hoon;Kim, Dae-Woong;Lee, Young-Hee;Hyun, Soon-J.;Lee, Dong-Man;Lee, Ben
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.545-558
    • /
    • 2007
  • This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

  • PDF

Cross-Layer Service Discovery Scheme for Hybrid Ad-hoc Networks (하이브리드 애드-혹 네트워크를 위한 크로스-레이어 서비스 검색 기법)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.223-228
    • /
    • 2009
  • Efficient service discovery mechanism is a crucial feature for a hybrid ad-hoc network supporting extension of a wireless ad-hoc network to the Internet. We propose an efficient cross-layer service discovery mechanism using non-disjoint multi-path source routing protocol for hybrid ad-hoc networks. Our scheme has advantages of multi-path routing protocol and cross-layer service discovery. Intuitively, it is not difficult to imagine that the cross-layer service discovery mechanism could result in a decreased number of messages compared to the traditional approach for handling routing independently from service discovery. By simulation, we show that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.

Performance Analysis of TNS System for Improving DDS Discovery (DDS 검색 방식 개선을 위한 TNS 시스템 성능 분석)

  • Yoon, Gunjae;Choi, Jeonghyun;Choi, Hoon
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.14 no.6
    • /
    • pp.75-86
    • /
    • 2018
  • The DDS (Data Distribution Service) specification defines a discovery method for finding participants and endpoints in a DDS network. The standard discovery mechanism uses the multicast protocol and finds all the endpoints in the network. Because of using multicasting, discovery may fail in a network with different segments. Other problems include that memory space wastes due to storing information of all the endpoints. The Topic Name Service (TNS) solves these problems by unicasting only the endpoints, which are required for communication. However, an extra delay time is inevitable in components of TNS, i.e, a front-end server, topic name servers, and a terminal server. In this paper, we analyze the performance of TNS. Delay times in the servers of TNS and time required to receive endpoint information are measured. Time to finish discovery and number of receiving endpoints compare with the standard discovery method.

Consistent Distributed Lookup Service Architecture for Mobile Ad-hoc Networks

  • Malik Muhammad Ali;Kim Jai-Hoon
    • International Journal of Contents
    • /
    • v.2 no.2
    • /
    • pp.29-31
    • /
    • 2006
  • Mobile Ad hoc network is a self configuring network of mobile nodes. It allows mobile nodes to configure network spontaneously and share their services. In these networks, service discovery is very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Some service discovery protocols have been proposed in last couple of years but they include significant traffic overhead and for small scale MANETS. In this paper, we present extensible lookup service scheme based on distributed mechanism. In our scheme neighboring nodes of service provider monitor service provider and send notification to lookup server when the service provider terminates its services unexpectedly. Lookup server can find other service provider or other alternative services in advance because of advance notification method and can provide consistent lookup services. In our scheme neighboring nodes also monitor lookup server and send notification to network when lookup server terminates unexpectedly. Simulation results show that our scheme can reduce up to 70% and 30% lookup failure as compare to centralize and simple distributed mechanism respectively.

  • PDF

Implementation of service discovery protocol on routing layer in Ad-hoc network environment (Ad-hoc라우팅 계층에서의 서비스 디스커버리 프로토콜 구현)

  • 김보성;고영배;노용성
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.292-294
    • /
    • 2004
  • 향후 세상의 모습을 그려볼 때 흔히들 유비쿼터스 시대를 언급한다. 이를 위해서는 다양한 서비스 공급자들과 사용자들이 서로 네트워크로 묶여 있어야 하며, 이때의 네트워크는 선이 없는 무선 환경이고, 국소 지역을 커버하는 Ad-hoc망이 기본 네트워크 망이 될 것이다. 이러한 네트워크로 이루어진 다양한 장소, 임의의 시간에 존재하는 다수의 서비스들 중에서 원하는 서비스를 찾는 일을 service discovery라고 하며, 이를 위해서 기존의 wired 망에서는 네트워크 계층 위에서 이를 수행하는 작업이 이루어져 왔다. 본 논문에서는 service discovery 실행을 별도의 에이전트나 응용 레벨에 두지 않고, 이를 Ad-hoc 라우팅 계층에서 수행 함으로써 오버헤드 트래픽이 줄어들고, 응답 시간이 짧아지는 성능 향상이 있음을 제시하고 있다. E한 동적/부분 caching 기법에 대해서도 제시하고 있다. 아울러 다양한 사용자의 기호(User Preference)를 표현하고, 이를 바탕으로 서비스를 검색하기 위한 새로운 서비스 표현/검색 모델을 제시하였다. 실제로 이러한 service discovery 기능을 Ad-hoc 라우팅 계층에서 처리하도록 하는 Ad-hoc 라우팅 데몬을 구현하고, 테스트 베드를 구축하여 동작 시킴으로써 실제 상황에서도 얼마나 효율적인가를 구체적으로 제시하고 있다.

  • PDF