• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.229-236
• /
• 2009

Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users' queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.67-82
• /
• 2000

In this paper we have developed a message transfer protocol, CMP, which improves MSP's message processing capability. The proposed method has taken into account document classification to improve the efficiency of message processing. The difference between the conventional MSP and CMP has been addressed. The CMP's performance has been shown by various experiments including number, alphabet, Korean letter, Chinese letter, music sound and compression file transmission. And security capability of both protocols has been compared based on the specification of FIPS 140-2. The CMP's overall performance is shown to be superior to that of MSP on the processing speed in the performance perspective and on the function of cryptographic module interface and cryptographic key management in the security perspective respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.637-640
• /
• 2022

To maximize performance in a high-performance multicore processor system. it is essential to enable effective data communication between processing cores. Data communication between processor nodes can be broadly classified into collective and point-to-point communications. Collective communication comprises scattering and gathering. This paper presents a efficient message scattering and gathering based on processing node status. In the proposed algorithms, the transmission order is changed according to the data size of the pre-existing communication, to reduce the waiting time required until the collective communications begin. From the simulation, the performances of the proposed message scattering and gathering algorithms were improved by approximately 71.41% and 69.84%.

• Journal of Information Technology Services
• /
• v.9 no.2
• /
• pp.179-192
• /
• 2010

In order to resolve the problems of traditional Enterprise Application Integration (EAI) for system integration and to establish flexible enterprise IT environments, Enterprise Service Bus(ESB) which have distributed architecture and support Service Oriented Architecture(SOA) has introduced. Particularly, JBI which developed by the Java Community Process is most widely used to implement ESB for advantages of Java technology. In ESB based on JBI, reliable message delivery is very important to ensure stability of services and systems because it is a message driven architecture. But, it is difficult to verify messages and trace messages when system fault or service error occurred because JBI specification is not enough to address them. In this paper we has proposed the Message Monitoring Framework for JBI-based ESBs which for using in monitoring messages efficiently. It provides foundations for gathering and tracing message-related information about component installation, message exchange, service deploy by using proxy-based change tracking and delegation mechanism for data processing. The proxy which used in our solutions collects data about message automatically when it changed, and the delegation mechanism provides users flexibility for data processing. Also, we describe the performance evaluation results of our solution which is acceptable. We expect to it enables users to ensure reliability and stability of the JBI-based ESB by systematic monitoring and managing messages being used to interact among components.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.173-180
• /
• 2012

It is important to consider saving location of message structures, structure of parser and creating method of parser generator for adopting KVMF to increase interoperability among different weapon systems. Especially, it requires to design the message parser by analyzing performance and maintenance when we adopting KVMF to previously developed weapon systems. In this paper, we propose the method of concurrent dynamic message processing for KMVF message based on KVID to support the developed and next-developed weapon systems. We show message conversion accuracy and performance effectiveness by adopting proposed method to Batallion Tactical Combat System.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.152-159
• /
• 2008

In this paper, we have studied a new method in which multimedia message can be processed effectively in SIP(Session Initiation Protocol)-based Instant Messaging service. Total system is composed of multimedia message server, presence server and user system. To provide effectively message informations such as number of messages stored in the multimedia message server, waiting status and message types to users, we have proposed a new method which can be a substitute for message waiting indication event package. In our proposed method, when changes of messages status informations occur, these informations are sent to the presence server, and can be transferred as a separate tag within notification message. The presence server processes subscription requests and notifications, and efficiency can be improved as it provides both message status informations and several communication status informations such as on-line status to service users. Partial publication is used in our system to improve data transfer efficiency more between user system and the presence server. The performance of our proposed model is evaluated by experiments measuring multimedia message transfer speed and server processing time.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1162-1170
• /
• 1995

In this paper, we present a message transfer scheme for efficient message passing in the hierarchically structured multiprocessor computer SPAX(Scalable Parallel Architecture computer based on X-bar network). The message transfer scheme provides interface not only with operating system but also with end users. In order to transfer two types of control message and data message efficiently, it supports both of memory-mapped transfer and DMA-based transfer. Dual-port RAMs are used as message buffers, and control and status registers provide efficient programming interface. Interlaced parity scheme is adopted for error control. If any error is detected at receiving node, errored packet is resent by sender according to retry mechanism. In conjunction with retry mechanism, watchdog timers are used to protect infinite waiting and repeated retry. The proposed message transfer scheme can be applied to input/output nodes and communication connection nodes as well as processing nodes in the SPAX.

• KIISE Transactions on Computing Practices
• /
• v.23 no.12
• /
• pp.670-676
• /
• 2017

Naval combat systems use real-time processing and compositing of collected information to provide the optimal combat capabilities that maximize survival and ensure mission effectiveness. The software for a combat system has dozens to thousands of components depending on the size of the system, and the communication between the components is achieved via DDS. Although the message interface of the combat system is managed through MDMS, an increase in the system size can result in problems such as the deterioration of the development efficiency. In this paper, we implement XMDMS to operate a distributed processing environment and then solve the problem of the reduction in the development efficiency caused by a load at the server. The experimental results shows that XMDMS improves the processing delay and network performance compared to MDMS.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.143-154
• /
• 2003

There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.465-482
• /
• 2015

IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.