• Title/Summary/Keyword: Message Processing

Search Result 859, Processing Time 0.031 seconds

Routing Control Algorithm for SS7 Signaling Traffic with Distributed Message Handling Processors (분산 메시지처리기 구조에서의 공통선 신호 트래픽루팅 제어 기법)

  • Cho, Young-So;Ryu, Keun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1797-1803
    • /
    • 1997
  • Message handling function of the SS7(Signaling System N0.7) provides signaling traffic routing capabilities to transfer the signaling traffic to the destination nodes in the signaling network. This message handling function should be handled without any transfer delay for real time processing of large amount of signaling traffic for data communication service, and visual information service. In this paper, we suggest two routing algorithms working on the distributed message handling processors which were specially designed for message handling function. The one is an internal distributing algorithm for equal distribution of signaling traffic among the distributed message handling processors and the other is a distributing algorithm for distribution of signaling traffic in the multiple signaling routes. Both of algorithms are using signaling link selection codes labled in each signaling messages. It is shown that the suggested algorithms are very efficient for routing signaling traffic at the fault condition of signaling routes and the restoration of unavailable signaling routes.

  • PDF

A Rule-based JMS Message Routing System for Dynamic Message Communication in based Distributed Systems (분산환경에서 동적 메시지 교환을 위한 룰 기반 JMS 메시지 라우팅 시스템)

  • Cho, Poong-Youn;Choi, Jae-Hyun;Park, Jae-Won;Lee, Nam-Yong
    • The Journal of Society for e-Business Studies
    • /
    • v.13 no.3
    • /
    • pp.1-20
    • /
    • 2008
  • Today's computing environment which is getting distributed to communicate with various systems needs dynamic inter-connectivity of the systems. MOM(Message Oriented Middleware) is popularly used for transmitting XML messages among the distributed systems for the inter-connectivity. But, they do not support event-based message routing functionalities with XML transformation for processing effective message routing, which is essential to inter-connectivity, and there is no integrated platform to cope with these requirements. Although event-based message routing and XML transformation have been studied in a wide range of computer science areas, development of message routing systems is considered as a tough job due to the technological difficulties. In order to address these requirements, we proposed a novel system, named RMRS(Rule-based Message Routing System), which supports event-based message routing as well as XML message transformation. To make the proposed system easy to use, we also redesigned ECA(Event- Condition-Action) rule to fit in our system and developed a tool to map source XML structure into target XML structure.

  • PDF

Message Routing Algorithm on an Injured Hypercube (손상된 하이퍼큐브상의 메세지 라우팅 알고리즘)

  • Gong, Heon-Taek;U, Ji-Un
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.2
    • /
    • pp.242-250
    • /
    • 1996
  • Communications on hypercube nodes are done by explicit message routing. So efficient message routing is very important for the performance of hypercube multicomputers. However, hypercube nodes can be faulty due to hardware and/o r software problems, which is called an injured hypercube. A reliable hypercube system should tolerate the problems. One of the methods to enhance reliability on injured hypercube is to use fault-tolerant message routing algorithms. In this paper, we propose a message routing algorithm with possible shortest distance using disjoint paths. To analyze the performance, the algorithm is simulated and evaluated.

  • PDF

The Game Engine Architecture for free game experience based on a storyline (스토리라인 기반의 자유로운 게임 플레이를 위한 게임 엔진 설계)

  • Kim, Seok-Hyun
    • Journal of Digital Contents Society
    • /
    • v.8 no.4
    • /
    • pp.615-622
    • /
    • 2007
  • A game engine should have the architecture that can manage various interactions between entities in a game for offering users various game experience. For this purpose, the game engine architecture based on message system is used. But only by this message based system, it is difficult to change game world continuously according to some storylines. The reason of this is event-driven system like message based system is appropriate for processing individual message but is not appropriate for processing more bigger logical work unit. For this purpose this paper proposes the storyline entity. The storyline entity has logical flows for a storyline and is called by engine continuously. By this proposed game engine architecture he or she can maintain free game experience by message based system and can add some progressing of storylines.

  • PDF

Recoverable Distributed shared Memory Systems Using Object-Oriented Dependency Tracking and Checkpointing (객체지향 종속 추적 및 체크포인팅(checkpointing)을 이용한 복구 가능한 분산 공유 메모리 시스템)

  • Kim, Jae-Hun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.476-484
    • /
    • 1999
  • Many message logging and checkpointing schemes are proposed for fault tolerance in distributed systems in which nodes communicate by message passing. Most researches for recoverable distributed shared memory (DSM) also adopt similar schemes used in message passing systems. However, schemes used in message passing systems are not always appropriate to be directly used in DSM systems because the two systems, message passing systems and DSM systems, have different natures (function shipping and data shipping). Many modified schemes have been proposed for DSM systems to resolve these differences. In this paper, an object oriented approach is proposed for recoverable DSM. We present a new dependency tracking scheme between pages instead of processes. Based on this scheme, we propose new checkpointing and recovery schemes that can reduce overhead to make DSM recoverable.

  • PDF

Efficient Checkpoint Algorithm for Message-Passing Parallel Applications on Cloud Computing (클라우드컴퓨팅에서 메시지패싱방식 응용프로그램의 효율적인 체크포인트 알고리즘)

  • Le, Duc Tai;Dao, Manh Thuong Quan;Ahn, Min-Joon;Choo, Hyun-Seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.156-157
    • /
    • 2011
  • In this work, we study the checkpoint/restart problem for message-passing parallel applications running on cloud computing environment. This is a new direction which arises from the trend of enabling the applications to run on the cloud computing environment. The main objective is to propose an efficient checkpoint algorithm for message-passing parallel applications considering communications with external systems. We further implement the novel algorithm by modifying gSOAP and OpenMPI (the open source libraries) which support service calls and checkpoint message-passing parallel programs, especially. The simulation showed that additional costs to the executing and checkpointing application of the algorithm are negligible. Ultimately, the algorithm supports efficiently the checkpoint/restart service for message-passing parallel applications, that send requests to external services.

Securing the MQTT Protocol using the LEA Algorithm (LEA 알고리즘을 이용한 MQTT 프로토콜 보안)

  • Laksmono Agus Mahardika Ari;Iqbal Muhammad;Pratama Derry;Howon Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.175-178
    • /
    • 2024
  • IoT is becoming more and more popular, along with the massive availability of cheap and easy-to-use IoT devices. One protocol that is often used in IoT devices is the Message Queuing Telemetry Transport (MQTT) protocol. By default, the MQTT protocol does not activate encrypted data security features. This MQTT default feature makes the transmitted and received message data vulnerable to attacks, such as eavesdropping. Therefore, this paper will design and implement encrypted data security using the lightweight cryptography algorithm. The focus of this paper will be on securing MQTT message data at the application layer. We propose a method for encrypting specific MQTT message fields while maintaining compatibility with the protocol's functionalities. The paper then analyzes the timing performance of the MQTT-LEA implementation on the Raspberry Pi 3+. Our findings demonstrate the feasibility of using LEA at the application layer to secure MQTT message communication on resource-constrained devices.

The Design and Implementation of Secure-ReXpis System with Internet Environment (인터넷 환경 하에서의 Secure-ReXpis 시스템 설계 및 구현)

  • 안경림;박상필;백혜경;임병찬;박준홍;고대식
    • The Journal of Society for e-Business Studies
    • /
    • v.6 no.3
    • /
    • pp.101-113
    • /
    • 2001
  • Security is very important in EC(Electronic Commerce) environment because exchanged information(that is transaction details, private data, charges data(card-no, accounts), etc) is various and is very sensitive. So, In this paper, we propose Secure-ReXpis(Reliable St excellent Xh3 Processing Infrastructure) System that transfer message and support Message Level Security(Encryption/Decryption and Digital Signature). And we implement Message Confidentiality Service, User Authentication & Message Integrity Service and Non-Repudiation Service among the various Security Services. This system support XML message format and EDI message, WEB Data and Private Format Data, etc.

  • PDF

A New Instant Messaging System using Extended CPL in SIP Environment (SIP 환경에서의 확장 CPL을 사용한 새로운 인스턴트 메시징 시스템)

  • Jang, Choon-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.9
    • /
    • pp.67-74
    • /
    • 2009
  • The presence informations of users of Instant Messaging System In SIP(Session Initiation Protocol) environment are obtained by presence server, and message waiting indication event package is used to provide various message informations stored in the message server. In this paper, I have proposed a new method in which Extended CPL(Call Processing Language) has been applied to presence service to provide various functions to the users. A user of Instant Messaging System subscribes presence information and CPL scripts which describe his requirements, and presence server executes CPL scripts when instant messaging service is subscribed and notifies presence informations. Several CPL operation tags are added, and therefore various services which combine presence service and call processing can be provided in this system. Furthermore a new method has been proposed in which message server and presence server correlate in Instant Messaging System. When changes of message status informations occur, message server send these informations to the presence server, and presence server provides both presence informations and message status informations in extended format. As this method can be a substitute for message waiting indication event package, the system operating efficiency can be increased. The performance of this proposed system is evaluated by experiments.