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

• Smart Media Journal
• /
• v.4 no.3
• /
• pp.9-15
• /
• 2015

A pub(lish)/sub(scribe) system is a data forwarding system which forwards only interesting data among the whole published data, which is related to the subscriptions registered by end users. Classical pub/sub systems are realized by constructing a network of brokers which are responsible for storing or forwarding data. Along with the substantial increase of the population mobile users, it is required that the pub/sub system handles the subscriptions of user locations which changes continuously and frequently. In this paper, a new broker network based pub/sub system which efficiently handles the frequent changes of subscriptions related to user locations is proposed. In consideration of moving patterns of users and geographical property, the proposed pub/sub system categorize the entire data space into Slow Moving Region and Normal Moving Region, and manages the brokers which are responsible for these regions by using Q+R tree in order to handle user requests more efficiently. Through the extensive simulation, it is presented that the proposed Q+R tree based pub/sub system can reduce unnecessary needs of brokers and network traffic and can support the dynamic subscription related to user location.

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

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.11
• /
• pp.403-408
• /
• 2014

In the Internet of Things(IoT) era, many of the things or objects that enclose our environments are able to associate with those things on the Internet. To construct IoT systems, it needs to consider a component for acquiring and aggregating of sensory data via things with sensors and instruments, which is connected by diverse networks, in IoT environment. An IoT system is intrinsically distributed in a variety of ways. In addition, to manage an IoT system efficiently, interoperability is needed to meet requirements while the IoT system is designed to deliver data among its applications. In this paper, a reference architecture based on asynchronous messaging is defined and used for designing an IoT system. To apply the architecture, we discuss how to manage data streams with real-time characteristics and make a prototype based on pipe-and-filter to produce and consume them by a pub/sub messaging system NaradaBrokering.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.209-217
• /
• 2022

Naval CMS(Combat Management System) is linked to various sensors and weapon equipment and use DDS(Data Distribution Service) for efficient data communication between ICU(Interface Control Unit) Node and IPN(Information Processing Node). In order to use DDS, software in the system communicates in an PUB/SUB(Publication/Subscribe) based on DDS topic. If the DDS messages structure in this PUB/SUB method does not match, problems such as incorrect command processing and wrong information delivery occur in sending and receiving application software. To improve this, this paper proposes a DDS message structure integrity verification method. To improve this, this paper proposes a DDS message structure integrity verification method using a hash tree. To verify the applicability of the proposed method to Naval CMS, the message integrity verification rate of the proposed method was measured, and the integrity verification method was applied to CMS and the initialization time of the existing combat management system was compared and the hash tree generation time of the message structures was measured to understand the effect on the operation and development process of CMS. Through this test, It was confirmed that the message structure verification method for system stability proposed in this paper can be applied to the Naval CMS.

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

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