• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.1-11
• /
• 2009

A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.138-149
• /
• 2006

As the environment with sensor network and ubiquitous computing is emerged, there are many demands of handling continuous, fast data such as streaming data. As work about streaming data has begun, work about management of streaming data in Publish-Subscribe system is started. The recent emergence of XML as a standard for information exchange on Internet has led to more interest in Publish - Subscribe system. A filtering technique of streaming XML data in the existing Publish- Subscribe system is using some schemes based on automata and YFilter, which is one of filtering techniques, is very popular. YFilter exploits commonality among path queries by sharing the common prefixes of the paths so that they are processed at most one and that is using the top-down approach. However, because partial matching path queries interrupt the common prefix sharing and don't calculate from root, throughput of YFilter decreases. So we use sharing of commonality among path queries with the common postfixes of the paths and use the bottom-up approach instead of the top-down approach. This filtering technique is called as PoSFilter. And we verify this technique through comparing with YFilter about throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.493-502
• /
• 2010

In this paper we propose a scalable sensor network system that makes mesh network among the sink nodes to solve the scalability problem of existing sensor network which is caused by multi-hop networking between the sensor nodes. In the proposed system, the sink nodes have the wireless networking ability to communicate with another sink nodes in mesh fashion, and with the monitoring nodes which is located in the local area or internet area. Especially, the system includes L4(Application Layer) routing mechanism that provides subscribe/publish service to serve selective transmission of sensor data to the specific monitoring nodes. The collected sensor data is transmitted to the monitoring nodes when the sensor data is matched with the monitoring node's interesting value.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1272-1281
• /
• 2006

RFID 기술을 이용함으로써 얻을 수 있는 많은 장점으로 인하여, 공급망에서 발생하는 실시간 제품 정보를 수집하고 관리하기 위하여 RFID 기술이 도입되고 있다. 기존의 RFID 기반의 공급망 관리 시스템은 제품의 위치에 따른 가시성은 확보할 수 있지만, 제품의 모든 상태에 따른 가시성은 확보하지 못한다는 단점이 있다. 이러한 단점을 해결하기 위해, 본 논문에서는 공급망 상의 제품 이동을 계획하고, 제품이 계획에 따라 이동할 때 발생하는 정보를 실시간으로 모니터링하고 통제할 수 있는 제품 상태 기반의 물류 통제 시스템을 설계하고 개발하였다. 이를 위해 본 연구에서는 첫째, 공급망에서 발생하는 제품 상태의 정의와 상태 변화의 흐름을 state chart로 표현하고, 둘째, 공급망에서의 폐쇄형관리 패러다임을 통한 제품 통제(감시 및 예외처리)를 정의하였으며, 셋째, Temporal data modeling을 통해 RFID 데이터 기반의 Database를 설계하고, 마지막으로, Publish/Subscribe 모델을 통해 효율적인 제품 상태 기반의 물류 통제 시스템 아키텍처를 설계하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.728-731
• /
• 2012

최근 분산 임베디드 시스템에서 실시간 데이터 교환에 대한 요구가 증가하면서 발간/구독(Publish/Subscribe) 기반의 데이터 중심 통신 미들웨어인 DDS(Data Distribution Service)에 대한 활용 분야가 증가하고 있다. 국방 분야의 시스템과 같은 고신뢰성을 요구하는 환경에서는 시스템 개발에 앞서, DDS 통신에 동적으로 참여하게 하는 디스커버리 과정의 안정적인 성능 검증을 요구한다. 성능 검증 및 신뢰성 있는 시스템 개발을 위해 실제 시스템과 유사한 환경에서 DDS의 디스커버리 사전시험(Prototype)을 수행하는 데, 이 때 많은 시간과 비용을 소요하게 된다. 본 논문에서는 DDS의 표준 프로토콜인 RTPS(Real-Time Publish-Subscribe)에서 필수로 요구하는 SDP(Simple Discovery Protocol)를 이용하여 디스커버리 시간을 추정할 수 있는 계산식을 제안한다. 계산식은 참여자(Participant) 수를 이용한 연결 쌍(pair)의 수식과 단말개체(Endpoints) 수를 이용한 가중치(weight) 수식을 이용하며, 실제 상용 DDS 미들웨어를 이용하여 유형별로 DDS 디스커버리 시험을 수행한 결과와 비교하여 계산식을 실제로 사용할 수 있음을 보인다.

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

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.721-733
• /
• 2010

In this paper, we propose a scalable content-based routing scheme for the tactical mobile ad-hoc networks where the nodes usually move together forming a group. Our scheme is classified as a content-based routing scheme based on publish and subscribe model. The nodes compose a cluster according to their position and interest. Our scheme allows multi-level cluster nesting. As a publish/subscribe model does, each node announces its interest to the cluster head who aggregates and announces the interests from cluster members to its neighbor cluster head. Actual data messages are delivered to the end node via cluster header in the reverse direction of the interest announcement. Using Qualnet simulator, we evaluated the performance of our scheme in comparison with two well-known content-based routing schemes. Simulation results show that our scheme maintains higher message delivery ratio as number of nodes increases whereas the two schemes show much lower delivery ratio. In addition, as the group mobility gets faster our scheme incurs less or similar control message overhead compared with the two schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1359-1370
• /
• 2009

In wireless sensor networks, data dissemination is based on data-centric routing that well matches the publish/subscribe communication paradigm. The publish/subscribe paradigm requires decoupling properties: space, time, and synchronization decoupling. For large-scale applications, the three decoupling properties provide scalability and robust communication. However, existing data dissemination schemes for wireless sensor networks do not achieve full decoupling. Therefore, we propose a novel data dissemination scheme that fully accomplishes the three decoupling, called ARBIETER. ARBITER constructs an independent network structure as a logical software bus. Information interworking between publishers and subscribers is indirectly and asynchronously performed via the network structure. ARBITER also manages storage and mapping of queries and data on the structure because of supporting different time connection of publishers and subscribers. Our simulation proves ARBITER show better performance in terms of scalability, network robustness, data responsibility, mobility support, and energy efficiency.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.186-190
• /
• 2008

This paper analyzes previous work on publish/subscribe in mobile ad-hoc networks with respect to collaboration methods among distributed event brokers. Our experiments suggest that approaches building event delivery structures are suitable for a scenario where there are events of various types each of which is consumed by a few subscribers. However, these approaches based on independent periodic exchange of network topology information may fail to reflect the up-to-date information when building event delivery paths. For this reason they do not correctly recover a broken path caused by node mobility, which results in lower event delivery rates. This paper proposes a scheme for building and maintaining event delivery paths based on advertisements initiated by and hence propagated from the root node. This guarantees correct recovery of event delivery paths within each period. Our experiments show that, our proposed scheme gives a better event delivery ratio with lower overhead.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.211-215
• /
• 2008

the data-centric publish/subscribe middle-ware is suitable for a communication environment in which various devices dynamically forms a network domain and same type of data are frequently exchanged. For this purpose, OMG has standardized DDS (Data Distribution Service) specification. In this study, we designed the RiTiCoM, data distribution service system that observes the OMG DDS (Data Distribution Service) standard specification and supports the automation of system management, and analyzed the performance and compared with the JMS.