• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.579-581
• /
• 2017

OMG(Object Management Group)의 DDS(Data Distribution Service)는 Publish/Subscribe기반 통신 미들웨어로 DDS Participant Discovery를 사용하여 각 Topic에 대한 Participant 정보를 자동으로 교환하여 사용자에게 편의성을 제공하며 분산 환경에 적합한 통신 환경을 제공한다. 본 논문에서는 기존 DDS의 원격 도메인간의 Participant Discovery 문제 해결을 위해 SDN 기반 구조를 제안한다. 제안하는 구조는 DDS 미들웨어에 SDN Controller로 도메인 정보를 전달할 기능(function)을 추가하고 SDN controller상에 Participant Discovery를 위해 네트워크 설정을 수행할 컴포넌트들을 추가한다. 이 구조는 원격 도메인간 PDP Message가 전달되지 않는 문제를 해결하며 실제 네트워크에 전달되는 Participant Discovery 메시지 수를 감소시켜 DDS Discovery 기능을 효율적으로 확장시킨다.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.893-901
• /
• 2016

In Internet of Things (IoT) environments, users are required to search for IoT devices necessary to access services for accomplishing their tasks. As IoT technologies advance, a user task will utilize various types of IoT-based services that are deployed in an IoT environment. Therefore, to accomplish a user task effectively, the services that utilize IoT devices need to be found in a certain geographical region. In addition, the service discovery needs to be accomplished in a stable manner while considering dynamically changing IoT environments. To deal with these issues, we propose two service discovery methods that consider geographic cohesiveness of services in IoT environments. We compare the effectiveness of the proposed methods against a traditional service discovery algorithm that does not consider geographic cohesiveness.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.213-223
• /
• 2008

The efficient discovery of services from a large scale collection of services has become an important issue[7, 24]. We studied a syntactic method for Web service discovery, rather than a semantic method. We regarded a service discovery as a retrieval problem on the proprietary XML formats, which were service descriptions in a registry DB. We modeled services and queries as probabilistic values and devised similarity-based retrieval techniques. The benefits of our way are follows. First, our system supports ranked service retrieval by keyword search. Second, we considers both of UDDI data and WSDL definitions of services amid query evaluation time. Last, our technique can be easily implemented on the off-theshelf DBMS and also utilize good features of DBMS maintenance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.124-126
• /
• 2006

Mobile Ad hoc networking is an emerging technology and in these days many applications are being developed to run on these networks. In these networks lookup services are 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. Reliable and efficient scheme should be available for lookup services due to limited bandwidth and low computing power of devices in mobile ad hoc networks. Due to mobility and rapid change in network topology, lookup mechanism used in wired network is not appropriate. Service discovery mechanism can be divided into two main categories Centralized and Distributed. Centralized mechanism is not reliable as there is no central node in these networks. Secondly centralized mechanism leads toward single point failure. We can handle the service discovery mechanism by distributing server's information to each node. But this approach is also not appropriate due to limited bandwidth and rapid change in network. In this paper, we present reliable lookup service scheme which is based on distributed mechanism. We are not using replication approach as well due to low bandwidth of wireless networks. In this scheme service discovery mechanism will be handled through different lookup servers. Reliability is the key feature of our proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.908-917
• /
• 2013

In this paper, we propose a discovery protocol for finding nearby mobile applications and services in a device-to-device communications system. The device-to-device communication technology enables proximity-based services such as mobile social networks and mobile marketing. For realizing these proximity-based services, it is essential to design a discovery protocol which pinpoints the devices with mobile applications of interest among hundreds and thousands of devices in proximity. In the infrastructure-less networks such as ad hoc networks, we can design the discovery protocol that periodically broadcasts a short discovery code containing the compressed information of the mobile applications. In this paper, we design the discovery protocol with the discovery code generated by using a hash function and a Bloom filter. We also mathematically analyze the performance of the proposed protocol.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1688-1696
• /
• 2008

We propose a hierarchical service management method using Bloom filters for large MANETs. In this paper, a MANET is comprised of logical grid hierarchy, and each mobile node within the lowest service region multicasts the Attenuated Bloom Filter (ABF) for services itself to other nodes within the region. To advertise and discovery a service efficiently, the server node of the lowest server region sends the Summary Bloom Filter (SBF) for the ABFs to the server node of upper server region. Each upper server has the set of SBFs for lower vicinity service regions. The traffic load of the proposed method is evaluated by an analytical model, and is compared with that of two alternative advertisement solutions: complete advertisement and no advertisement. As a result, we identify that the traffic load of the proposed method is much lower than that of two alternative advertisement solutions.

• IE interfaces
• /
• v.25 no.1
• /
• pp.31-39
• /
• 2012

Discovering the suppliers capable of manufacturing the parts that satisfy buyer requirements via current online market places remains difficult due to semantic differences between what the suppliers can produce and what the buyer wants to acquire. One of the promising approaches to overcome the semantic difference is to adopt an ontology to describe the suppliers' manufacturing capabilities and the buyer requirements that range widely from manufacturing costs to eco-friendly design. Such an ontology dedicated to supplier discovery has yet to be developed. MSDL(Manufacturing Service Description Language) provides the basis for defining terms and their relationships in the ontology. Thus, the objective of this paper is to extend MSDL into a new ontology suitable for supplier discovery in mold manufacturing industry. In addition, a new ontology development method for supplier discovery will be proposed. Finally prototype demonstrations are provided to show a feasibility of the proposed ontology in mold manufacturing domains.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1777-1787
• /
• 2017

Federated authentication (FA) is a multi-domain authentication and authorization infrastructure that enables users to access nationwide R&D resources with their home-organizational accounts. An FA-enabled user is redirected to his/her home organization, after selecting the home from an identity-provider (IdP) discovery service, to log in. The discovery service allows a user to search his/her home from all FA-enabled organizations. Users get troubles to find their home as federation size increases. Therefore, a discovery service has to provide an intuitive way to make a fast IdP selection. In this paper, we propose a discovery system which leverages geographical information. The proposed system calculates geographical proximity and text similarity between a user and organizations, which determines the order of organizations shown on the system. We also introduce a server redundancy and a status monitoring method for non-stop service provision and improved federation management. Finally, we deployed the proposed system in a real service environment and verified the feasibility of the system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.312-313
• /
• 2010

Traditional service discovery mechanisms so far necessitate centralized registry containing all the service descriptions. Though centralized service registration is intuitive, it does not facilitate users in their usual ways of doing things. Moreover, centralized repository is not scalable for high query rate. We propose that service description be broadcast through the advertising data channels so that computers can parse and queue the service descriptions interesting to the users. The current technologies such as Digital Media Broadcast (DMB), Car Navigation Systems and Wireless Broadband can bring our idea to reality.

• Journal of Information Science Theory and Practice
• /
• v.10 no.4
• /
• pp.3-22
• /
• 2022

This paper provides an overview of the emergence of resource discovery systems and services, along with their advantages, best practices, and current landscapes. It outlines some of the key services and functionalities of a comprehensive discovery model suitable for academic libraries in developing countries. The proposed model (VuFind as a discovery tool) performs like other existing web-scale resource discovery systems, both commercial and open-source, and is capable of providing information resources from different sources in a single-window search interface. The objective of the paper is to provide seamless access to globally distributed subscribed as well as open access resources through its discovery interface, based on a unified index. This model uses Koha, DSpace, and Greenstone as back-ends and VuFind as a discovery layer in the front-end and has also integrated many enhanced search features like Bento-box search, Geodetic search, and full-text search (using Apache Tika). The goal of this paper is to provide the academic community with a one-stop shop for better utilising and integrating heterogeneous bibliographic data sources with VuFind (https://vufind.org/vufind).