• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1075-1084
• /
• 2022

Internet of Things(IoT) has become a key available technology for efficiently implementing device to device(D2D) services in various domains such as smart home, healthcare, smart city, agriculture, energy, logistics, and transportation. A lightweight publish/subscribe(Pub/Sub) messaging protocol not only establishes data dissemination pattern but also supports connectivity between IoT devices and their applications. Also, a Pub/Sub broker is deployed to facilitate data exchange among IoT devices. A scalable edge-based publish/subscribe (Pub/Sub) broker overlay networks support latency-sensitive IoT applications. In this paper, we design a hypercube grid quorum(HGQ) for distributed Pub/Sub systems based IoT applications. In designing HGQ, the network of hypercube structures suitable for the publish/subscribe model is built in the edge layer, and the proposed HGQ is designed by embedding a mesh overlay network in the hypercube. As their applications, we propose an HGQ-based mechansim for dissemination of the data of sensors or the message/event of IoT devices in IoT environments. The performance of HGQ is evaluated by analytical models. As the results, the latency and load balancing of applications based on the distributed Pub/Sub system using HGQ are improved.

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

• Journal of Korea Multimedia Society
• /
• v.24 no.8
• /
• pp.1101-1113
• /
• 2021

The rapid growth of sense-and-respond applications and the emerging cloud computing model present a new challenge: providing publish/subscribe middleware as a scalable and elastic cloud service. The publish/subscribe interaction model is a promising solution for scalable data dissemination over wide-area networks. In addition, there have been some work on the publish/subscribe messaging paradigm that guarantees reliability and availability in the face of node and link failures. These publish/subscribe systems are commonly used in information-centric networks and edge-fog-cloud infrastructures for IoT. The IoT has an edge-fog cloud infrastructure to efficiently process massive amounts of sensing data collected from the surrounding environment. In this paper. we propose a quorum-based hierarchical fault-tolerant publish/subscribe systems (QHFPS) to enable reliable delivery of messages in the presence of link and node failures. The QHFPS efficiently distributes IoT messages to the publish/subscribe brokers in fog overlay layers on the basis of proposing extended stepped grid (xS-grid) quorum for providing tolerance when faced with node failures and network partitions. We evaluate the performance of QHFPS in three aspects: number of transmitted Pub/Sub messages, average subscription delay, and subscritpion delivery rate with an analytical model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2535-2540
• /
• 2010

In traditional Publish/Subscribe system, the first procedure to deliver event from publisher to subscriber is that publisher publishes publisher's event to broker. Next step is that broker checks simple binary notion of matching : an event either matches a subscription or it does not. Lastly, broker delivers the event matched with subscriptions to the corresponding subscribers. In this system, information delivery has been accomplished in one way only. However, current some applications require two way delivery between subscriber and publisher. Therefore, we initiate an extended Publish/Subscribe system that supports two way delivery. Extended Publish/Subscribe system requires additional functions of delivering subscription to publisher and especially deciding top-n subscriptions using priority because broker might has a number of subscriptions. In this paper, we propose two priority retrieval techniques based on SIF using IS-List with deciding priority among subscriptions and defining SIF(Specific Interval First). The performance measurements show that RSO(resulting set sorting) technique results in better performance in index creation time and ITS&IS(insertion time sorting and inverse search using stack) technique results in better performance in search time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.801-804
• /
• 2007

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

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1369-1378
• /
• 2017

Pub/Sub (Publish/Subscribe) paradigm is a simple and easy to use model for interconnecting applications in a distributed environment. In general, subscribers register their interests in a topic or a pattern of events and then asynchronously receive events matching their interest, regardless of the events' publisher. In order to build a low latency lightweight pub/sub system for Internet of Things (IoT) services, we propose a GQSFPS (Group Quorum System-based Fog Pub/Sub) system that is a core component in the event-driven service oriented architecture framework for IoT services. The GQSFPS organizes multiple installed pub/sub brokers in the fog servers into a group quorum based P2P (peer-to-peer) topology for the efficient searching and the low latency accessing of events. Therefore, the events of IoT are cached on the basis of group quorum, and the delay-sensitive IoT applications of edge devices can effectively access the cached events from group quorum fog servers in low latency. The performance of the proposed GQSFPS is evaluated through an analytical model, and is compared to the GQPS (grid quorum-based pud/sub system).

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.368-378
• /
• 2008

In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pub-sub system, subscribed users specify their interest in profiles expressed in the XPath language, and each new content is matched against the user profiles so that the content is delivered to only the interested subscribers. As the number of subscribed users and their profiles can grow very large, the scalability of the system is critical to the success of pub-sub services. In this paper, we propose a fast and scalable XML filtering system called SFiST which is an extension of the FiST system. Sharable segments are extracted from twig patterns and stored into the hash-based Segment Table in SFiST system. Segments are used to represent user profiles as Terse Sequences and stored in the Compact Segment Index during filtering. Our experimental study shows that SFiST system has better performance than FiST system in terms of filtering time and memory usage.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.423-436
• /
• 2006

In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pub-sub system, subscribing users specify their interest in profiles expressed in the XPath language, and each new content is matched against the user profiles so that the content is delivered only to the interested subscribers. As the number of subscribed users and their profiles can grow very large, the scalability of the system is critical to the success of pub-sub services. In this paper, we propose a novel scalable filtering system called FiST(Filtering by Sequencing Twigs) that transforms twig patterns expressed in XPath and XML documents into sequences using Prufer's method. As a consequence, instead of matching linear paths of twig patterns individually and merging the matches during post-processing, FiST performs holistic matching of twig patterns with incoming documents. FiST organizes the sequences into a dynamic hash based index for efficient filtering. We demonstrate that our holistic matching approach yields lower filtering cost and good scalability under various situations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.187-193
• /
• 2015

The ICT healing platform sets a couple of goals including preventing chronic diseases and sending out early disease warnings based on personal information such as bio-signals and life habits. The 2-step open system(TOS) had a relay designed between the healing platform and the storage of personal health data. It also took into account a publish/subscribe(pub/sub) service based on large-scale connections to transmit(monitor) the data processing process in real time. In the early design of TOS pub/sub, however, the same buffers were allocated regardless of connection idling and type of message in order to encode connection messages into a deflate algorithm. Proposed in this study, the dynamic buffer allocation was performed as follows: the message transmission type of each connection was first put to queuing; each queue was extracted for its feature, computed, and converted into vector through tf-idf, then being entered into a k-means cluster and forming a cluster; connections categorized under a certain cluster would re-allocate the resources according to the resource table of the cluster; the centroid of each cluster would select a queuing pattern to represent the cluster in advance and present it as a resource reference table(encoding efficiency by the buffer sizes); and the proposed design would perform trade-off between the calculation resources and the network bandwidth for cluster and feature calculations to efficiently allocate the encoding buffer resources of TOS to the network connections, thus contributing to the increased tps(number of real-time data processing and monitoring connections per unit hour) of TOS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.12
• /
• pp.1134-1149
• /
• 2013

Pub/sub system enables data users to access any necessary data without knowledge of the data producer and synchronization with the data producer. It is widely used as the middleware technology for the data-centric services. DDS (Data Distribution Service) is a standard middleware supported by the OMG (Object Management Group), one of global standardization organizations. It is considered quite useful as a standard middleware for US military services. However, it is well-known that it takes considerably long time in searching the Participants and Endpoints in the system, especially when the system is booting up. In this paper, we propose a discovery scheme to reduce the latency when the participants and Endpoints are densely distributed in a small area. We propose to modify the standard DDS discovery process in three folds. First, we integrate the Endpoint discovery process with the Participant discovery process. Second, we reduce the number of connections per participant during the discovery process by adopting the concept of successors in Distributed Hashing scheme. Third, instead of UDP, the participants are connected through TCP to exploit the reliable delivery feature of TCP. We evaluated the performance of our scheme by comparing with the standard DDS discovery process. The evaluation results show that our scheme achieves quite lower discovery latency in case that the Participants and the Endpoints are densely distributed in a local network.