• Journal of IKEEE
• /
• v.25 no.2
• /
• pp.291-301
• /
• 2021

OPC UA at the control and field level does not provide enough performance to replace the field bus. The OPC Foundation aims for a real-time and connection-less mechanism, and has added the OPC UA publish-subscribe model, a new specification that supports broker functions such as MQTT and AMQP, as the OPC UA Part 14 standard. This paper is about a gateway for interoperability between OPC UA publisher with the addition of OPC UA Part14 standard and DDS subscribers. Raspberry Pi 4 is used for the gateway proposed in this paper, and OpenDDS, an open source, is used for DDS. OPC UA publish-subscribe module used A-Open62541 publish-subscribe module, which additionally implements functions not provided by the corresponding source based on Open62541 publish-subscribe open source.

• Asia pacific journal of information systems
• /
• v.31 no.3
• /
• pp.277-295
• /
• 2021

This paper examines the features that make a YouTube channel attractive to users. Considering that drawing users' attention is challenging on this platform, where voluminous amounts of videos are available, it is crucial to identify the factors that make users intend to subscribe to a YouTube channel. In this study, we used an online survey to collect data from 1125 respondents and an SEM model using Smart PLS 3.2.8 to analyze it. The results show that integrity and familiarity with a YouTube channel are positively correlated with trust in its creator, which leads to subscribing to the YouTube channel; value and accuracy also positively affect intention to subscribe to a YouTube channel via trust in content. This study enriches the field of research about trust in the creator and trust in content.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.801-804
• /
• 2007

실 시간적인 데이터의 수집과 더불어 수집한 데이터의 실 시간적인 전송을 기반으로 정보를 보다 폭넓게 활용할 수 있는 환경을 제공하기 위해 시스템에서 자동적으로 정보를 배포해주는 Publish/Subscribe 시스템에 대한 요구가 증대되고 있다. 이러한 pub/sub 시스템은 사용자의 요구사항을 미리 저장, 이를 이용하여 수집되는 정보와 사용자의 요구와 사용자를 찾아 배포해주는 방법을 사용하는데, 이때, 일치 여부를 확인하는 매칭 과정에서의 많은 자원과 시간의 소모가 문제점으로 대두되고 있다. 따라서, 논문에서는 보다 효율적으로 데이터와 범위를 이용하여 나타내는 사용자의 요구를 매칭하는 방법을 제공하는 CGIM 알고리즘을 제안하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.121-123
• /
• 2002

본 논문은 기업 및 개인간의 정보 교환을 지원하는 토픽 기반 메시지 시스템을 구현한다. 기존의 등록(Subscribe)／발표(Publish) 메시지 시스템과 동일한 기능을 수행하는 등록(Subscribe)／발표(Post) 메시지 시스템으로 메시지를 처리하는 서버인 메시지 처리기와 ActiveX 컨트롤을 사용한 클라이언트로 구성된다. 메시지 처리기는 운영체계에 의존하지 않고 독립적으로 작동하고, 클라이언트는 Win32용과 웹 기반으로 구현하여 특정 운영체계에 국한되지 않고 웹 기반을 포함한 다양한 환경에서 사용 가능하도록 가용성을 높였다.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.227-242
• /
• 2012

Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.205-208
• /
• 2011

In recent years, the user interest has increased for DDS (Data Distribution Service) which is a data centric middleware based on publish-subscribe communication as the demands for real-time data exchange in distributed systems have been growing rapidly. To reflect these needs, many vendors and research groups provide their DDS middleware. However, there has been a problem with interoperability between DDS middlewares because of a lack of common communication rules such as the message exchange and the discovery manner. For this reason, OMG defines RTPS (Real-Time Publish-Subscribe) specification which is the standard network protocol used to exchange data between different implementations of DDS. In this paper, we analyze and design the SDP (Simple Discovery Protocol) of RTPS which enable DDS middleware to provide interoperable discovery mechanism.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.131-135
• /
• 2024

In the MQTT protocol, if the retained flag of a message published by a publisher is set, the message is stored in the broker as a retained message. When a new subscriber performs a subscribe, the broker immediately sends the retained message. This allows the new subscriber to perform updates on the current state via the retained message without waiting for new messages from the publisher. However, sending retained messages can become a traffic overhead if new messages are frequently published by the publisher. This situation could be considered an overhead when new subscribers frequently subscribe. Therefore, in this paper, we propose a retained message delivery scheme by considering the characteristics of the published messages. We model the delivery and waiting actions to new subscribers from the perspective of the broker using reinforcement learning, and determine the optimal policy through Q learning algorithm. Through performance analysis, we confirm that the proposed method shows improved performance compared to existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1527-1552
• /
• 2018

The rapidly-evolving demand of applications using wireless sensor networks in several areas such as building and industrial automation or smart cities, among other, makes it necessary to determine and provide QoS support mechanisms which can satisfy the requirements of applications. In this paper we propose a mechanism that establishes different QoS levels, based on Publish/Subscribe model for wireless networks to meet application requirements, to provide reliable delivery of packet and timeliness. The first level delivers packets in a best effort way. The second one intends to provide reliable packet delivery with a novel approach for Retransmission Timeout (RTO) calculation, which adjusts the RTO depending on the subscriber Packet Delivery Ratio (PDR). The third one provides the same reliable packet delivery as the second one, but in addition, it provides data aggregation trying to be efficient in terms of energy consumption and the use of network bandwidth. The last one provides timeliness in the packet delivery. We evaluate each QoS Level with several performance metrics such as PDR, Message Delivery Ratio, Duplicated and Retransmitted Packet Ratio and Packet Timeliness Ratio to demonstrate that our proposal provides significant improvements based on the increase of the PDR obtained.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.232-239
• /
• 2009

Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.102-105
• /
• 2010

Traditional Pub/Sub(Publish/Subscribe) Systems search all subscriptions that match an incoming event by broker(i.e. it is not considering the accuracy of matching between an incoming event and subscriptions and only consider that an event either matches a subscription or not). However, subscriptions that match an event may have priority, therefore, we need priority Pub/Sub system. In this paper, we define what the accuracy means in order to prioritize among subscriptions and propose the Priority Retrieval Technique based on accuracy that able to search subscriptions. The Priority Retrieval Technique is based on IS-Lists. We can search the results ordered by accuracy.