• Title/Summary/Keyword: Message Processing

Search Result 859, Processing Time 0.038 seconds

Real-time Message Network System for a Humanoid Robot

  • Ahn, Sang-Min;Gong, Jung-Sik;Lee, Bo-Hee;Kim, Jin-Geol;Huh, Uk-Youl
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2296-2300
    • /
    • 2005
  • This paper deals with the real-time message network system by a CAN (controller area network) based on the real-time distributed control scheme to integrate actuators and sensors in a humanoid robot. In order to apply the real-time distributed processing for a humanoid robot, each control unit should have the real-time efficient control method, fast sensing method, fast calculation and real-time valid data exchange method. Moreover, the data from sensors and encoders must be transmitted to the higher level of control units in maximum time limit. This paper describes the real-time message network system design and the performance of the system.

  • PDF

A New Presence Lists Service in SIP Environment (SIP 환경에서의 새로운 프레즌스 리스트 서비스)

  • Jang, Choon-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.12
    • /
    • pp.67-73
    • /
    • 2010
  • In SIP(Session Initiation Protocol) environment, the presence event notification operation makes presence service user to recognize presence information status changes of the other party. In conventional method, the user should send each SIP SUBSCRIBE message containing the address of the other party to the presence server. Furthermore each presence subscription requires refresh messages, and the amount of notification messages from the other party becomes large. These facts increases network traffic and the load of presence server. In this paper, to solve these problems a new presence list service has been suggested. It uses a presence list consists of URI of the other party and make it possible to subscribe by using one SUBSCRIBE message. So this method decreases the amount of SUBSCRIBE messages and refresh messages, and it also decreases the amount processing event notification messages from the subscribed the other party. And to increase the efficiency, a presence filtering method which enables to include some parts of selected presence information into the notification message body has been also suggested. The implemented system can reduce SIP message related network traffic and message processing time of the presence server. The performance of this proposed system has been evaluated by experiments, and the results showed decreasing of server processing time.

Active-Active Message Replica Scheme for Enhancing Performance of Distributed Message Broker (분산 브로커의 가용성 향상을 위한 메시지 레플리카 액티브-액티브 구조 기법)

  • Seo, Kyeonghee;Yeo, Sangho;Oh, Sangyoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.6
    • /
    • pp.145-154
    • /
    • 2018
  • A loosely coupled message broker system is a popular method for integrating distributed software components. Especially, a distributed broker structure with multiple brokers with active-standby or active-active message replicas are used to enhance availability as well as message processing performance. However, there are problems in both active-standby and active-active replica structure. The active-standby has relatively low processing performance and The active-active structure requires a high synchronization overhead. In this paper, we propose an active-active structure of replicas to increase the availability of the brokers without compromising its high fault-tolerancy. In the proposed structure, standby replicas process the requests of the active replicas so that load balancing is achieved without additional brokers, while the distributed coordinators are used for the synchronization process to decrease the overhead. We formulated the overhead incurred when synchronizing messages among replicas, and the formulation was used to support the experiment results. From the experiment, we observed that replicas of the active-active structure show better performance than the active stand-by structure with increasing number of users.

Performance Measurement and Analysis of RTI in the HLA-based Real-time Distributed M-SAM Simulation (HLA 기반 실시간 분산 M-SAM 시뮬레이션에서 RTI성능 측정 및 분석)

  • Choi Sang-Yeong;Cho Byung-Kyu;Lee Kil-Sup
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.2
    • /
    • pp.149-156
    • /
    • 2005
  • The HLA is the simulation architecture standard that the civilian and military simulation communities are deeply interested in. We can find various successful practices applying HLA to constructive simulations such as war games in domestics and overseas. However, any case of real-time distributed simulations has not been reported. The reason is that a message transmission period via RTI in a network layer varies according to computing power, simulation nodes, transmission types, and packet size; further a message processing time in an application layer depends on its processing methods, thus too difficult to set up real-time constraints for the enhancement of a real-time resolution. Hence, in this paper we have studied the real-time constraints of RTI for the development of the M-SAM simulator. Thus we have developed a HLA based pilot simulator using 6 PC's in LAN and then measured and analysed the performance of the RTI. As the results of our work, we could obtain the quantitative values for message delay, RTI overhead and RTI packet transmission ratio by a real operation scenario and loads, which are not shown in the previous works. We also expect that the results can be used as a guideline to set up the number of targets, transmission frequency and message processing method in the development of the M-SAM simulator and similar applications.

Event Message Processing in Virtual Environment Using the Extended Area of Interest Model (확장 관심영역 모델을 이용한 가상공간 이벤트 메시지 처리기법)

  • Yu Seok-Jong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.4
    • /
    • pp.482-489
    • /
    • 2006
  • How to process event message traffic efficiently is important to collaboration among multiple distributed users, and it is a key research issue in the virtual environment fields. AOI model is one of solutions for this problem; which reduces message traffic by restricting event propagation region into an area in which a user is interested. However, in previous systems, it is difficult to adapt to dynamic environment where changes in the number and movement of participants are frequent. This paper proposes a new event management model, called extended AOI model, which is helpful to improve flexibility and efficiency of traditional models, and is able to extend its functions by introducing multi-layered regions. The proposed model can be applied to DVE and MMORPG as an event filtering model.

  • PDF

An Opportunistic Routing Scheme Based on Social Relations in Delay-Tolerant Networks (지연 감내 네트워크에서 사회관계기반 기회적 라우팅 기법)

  • Kim, Chan-Myung;Kang, In-Seok;Oh, Young-Jun;Han, Youn-Hee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.1
    • /
    • pp.15-22
    • /
    • 2014
  • Delay-Tolerant Network employs message forwarding based on a Store, Carry and Forward method to conquer no guarantee of continue connectivity. For this reason, a lot of DTN routing scheme have been proposed recently. message forwarding is an important research issue in delay-tolerant network and In this paper, we propose a efficiency DTN routing scheme using node's social relation and expanded Ego-network betweenness centrality. Our simulation results show that it is more efficient to message delivery cost than Epidemic routing, Friendship routing while it has a little performance degradation of message delivery ratio.

XMPP/SIP Presence Service System using Efficient Message Control Method (효율적 메시지 제어방식을 사용한 XMPP/SIP 프레즌스 서비스 시스템)

  • Jang, Choonseo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2678-2684
    • /
    • 2014
  • In this paper a new message control method that can reduce server load and network traffic in XMPP/SIP presence service system has been proposed. This presence service system can process both XMPP(Extensible Massaging and Presence Protocol) based presence information and SIP(Session Initiation Protocol) based presence information. A new XMPP stanza architecture with added elements for presence stanza and IQ stanza has been designed, and a new presence information data processing method which can reduce size of SIP notification message and SIP PUBLISH message has been suggested. Furthermore a messages exchanging procedure that can transfer presence information between XMPP domain and SIP domain has been also suggested. The performance of the proposed system has been analysed by simulation.

Personalized Message Syndication As a Smart Media (스마트 미디어로서의 개인화된 메시지 신디케이션)

  • Lee, Seo-Young;Kim, Nam-Yun;Lee, Bong-Gyou
    • The KIPS Transactions:PartA
    • /
    • v.19A no.1
    • /
    • pp.61-68
    • /
    • 2012
  • Since the increasing use of smart devices such as smartphone and tablet PC improves the quality of convergence of broadcasting and telecommunication, many new media have been created. This smart device can provide personal environments based on user's profile (age, gender, and job) and current location. In addition, it can be regarded as a media platform with two-way communication. This paper proposes personalized message syndication, called PMS, based on smart devices and then analyzes its business and technical issues. The PMS service as a smart media provides consumers customized information and can be used for producer's marketing tools which can lead consumers' heart and participation.

An Efficient Location Tracking Method for Mobile Agent Communication (이동 에이전트 통신을 위한 효율적인 위치 추적 방법)

  • Song, Sang-Hoon
    • The KIPS Transactions:PartA
    • /
    • v.11A no.5
    • /
    • pp.347-354
    • /
    • 2004
  • The provision of location tracking for mobile agents is designed to deliver a message to a moving object in a network. Most tracking methods exploit relay stations that hold location information to forward messages to a target mobile agent. In this paper, we propose an efficient location tracking method for mobile agents using the domain-based proxy as a relay station. Mobile agents can reduce the length of their migration paths by visiting hosts in the same domain first, rather than selecting hosts randomly. The proposed method exploits the domain-based moving patterns of mobile agents and minimizes registration and message delivery costs. Since the long proxy chain can contribute to the high message delivery cost, we also propose a compressing method to reduce the message delivery cost.

Efficient Scheme for Secret Hiding in QR Code by Improving Exploiting Modification Direction

  • Huang, Peng-Cheng;Li, Yung-Hui;Chang, Chin-Chen;Liu, Yanjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2348-2365
    • /
    • 2018
  • QR codes as public patent are widely used to acquire the information in various fields. However, it faces security problem when delivering the privacy message by QR code. To overcome this weakness, we propose a secret hiding scheme by improving exploiting modification direction to protect the private message in QR code. The secret messages will be converted into octal digit stream and concealed to the cover QR code by overwriting the cover QR code public message bits. And the private messages can be faithfully decoded using the extraction function. In our secret hiding scheme, the QR code public message still can be fully decoded publicly from the marked QR codes via any standard QR Code reader, which helps to reduce attackers' curiosity. Experiments show that the proposed scheme is feasible, with high secret payload, high security protection level, and resistant to common image post-processing attacks.