• Title/Summary/Keyword: 결함허용네트워크

Search Result 59, Processing Time 0.02 seconds

A Fast Transmission of Mobile Agents Using Binomial Trees (바이노미얼 트리를 이용한 이동 에이전트의 빠른 전송)

  • Cho, Soo-Hyun;Kim, Young-Hak
    • The KIPS Transactions:PartA
    • /
    • v.9A no.3
    • /
    • pp.341-350
    • /
    • 2002
  • As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM's Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.

A Fault-Recovery Agent for Distance Education on Home Network Environment (홈 네트워크 환경에서 원격 교육을 위한 결함 복구 에이전트)

  • Ko, Eung-Nam
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.479-484
    • /
    • 2007
  • This paper explains the design and implementation of the FRA(Fault Recovery Agent). FRA is a system that is suitable for recovering software error for multimedia distance education based on home network environment. In terms of distributed multimedia systems, the most important catagories for quality of service are a timeless, volume, and reliability. In this paper, we discuss a method for increasing reliability through fault tolerance. This paper explains a performance analysis of an error recovery system running on distributed multimedia environment using rule-based DEVS modeling and simulation techniques. In DEVS, a system has a time base, inputs, states, outputs, and functions. The proposed method is more efficient than the other method in comparison with error ration and processing time.

  • PDF

Minimizing Stuffing-bit of CAN Message (CAN 메시지의 Stuffing-bit 최소화)

  • Kang, Min-Koo;Park, Kie-Jin;Shin, Dong-Min
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10a
    • /
    • pp.429-432
    • /
    • 2006
  • CAN(Controller Area Network) 프로토콜은 데이터 링크 계층(Data Link Layer)에서 여러 가지 결함 허용(Faulttolerant) 메커니즘을 기본적으로 제공하기 때문에, 고신뢰성, 고안전성이 요구되는 임베디드 제어 시스템(예: 자동차, 산업제어 등)에서 많이 사용되고 있다. 하지만 제한된 네트워크 대역폭과 이에 따른 응답시간 지연이라는 문제점을 가지고 있으며, 이에 본 논문에서는 전송될 CAN 메시지의 길이를 감소시키기 위해 CAN 메시지의 Stuffing-bit를 최소화하는 메커니즘을 제안하였다. 실험을 통해, CAN 메시지 길이의 축소로 인해 CAN 버스의 부하(Load)를 덜게 되었으며, 네트워크 대역폭 이용률이 증가하는 것을 확인하였다.

  • PDF

Evaluation and Comparative Analysis of Scalability and Fault Tolerance for Practical Byzantine Fault Tolerant based Blockchain (프랙티컬 비잔틴 장애 허용 기반 블록체인의 확장성과 내결함성 평가 및 비교분석)

  • Lee, Eun-Young;Kim, Nam-Ryeong;Han, Chae-Rim;Lee, Il-Gu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.2
    • /
    • pp.271-277
    • /
    • 2022
  • PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that can achieve consensus by resolving unintentional and intentional faults in a distributed network environment and can guarantee high performance and absolute finality. However, as the size of the network increases, the network load also increases due to message broadcasting that repeatedly occurs during the consensus process. Due to the characteristics of the PBFT algorithm, it is suitable for small/private blockchain, but there is a limit to its application to large/public blockchain. Because PBFT affects the performance of blockchain networks, the industry should test whether PBFT is suitable for products and services, and academia needs a unified evaluation metric and technology for PBFT performance improvement research. In this paper, quantitative evaluation metrics and evaluation frameworks that can evaluate PBFT family consensus algorithms are studied. In addition, the throughput, latency, and fault tolerance of PBFT are evaluated using the proposed PBFT evaluation framework.

A Fault-Tolerance Agent for Multimedia Collaboration Works running on Vehicle Environment (차량 환경 상에서 멀티미디어 공동 작업을 위한 결함 허용 에이전트)

  • Ko, Eung-Nam
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.1
    • /
    • pp.157-161
    • /
    • 2011
  • This paper explains an error process for multimedia collaboration works with session management running on vehicle network environment. This system consists of an FDA and FRA. FDA is an agent that detects an error by hooking techniques for multimedia system based on vehicle network environment with session management. FRA is a system that is suitable for recovering software error for multimedia system with session management based on vehicle network environment. This paper describes only FRA. When multiple local sessions is opened, each local session manager sends information of participant to global session manager and take current information about session of processing in network.

Design of Fault-tolerant MA Migration Scheme based on Encrypted Checkpoints (암호화된 체크포인트를 이용한 결함 허용성을 가지는 이동 에이전트의 이주 기법 설계)

  • 김구수;엄영익
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.6
    • /
    • pp.77-84
    • /
    • 2003
  • A mobile agent is a program which represents a user in a network and is capable of migrating from one node to another node, performing computations on behalf of the user. In this paper, we suggest a scheme that can safely recover mobile agent using the checkpoint that is saved at the platform that it visited previously and restart its execution from the abnormal termination point of the mobile agent. For security, mobile agent uses its public key to encrypt the checkpoint and the home platform uses the private key of the mobile agent to decrypt the encrypted checkpoints at the recovery stage. When home platform receives the checkpoint of the mobile agent, home platform verifies the checkpoint using message digest. Home platform verifies the correctness of the checkpoint by comparing the message digest generated at checkpoint mention time with the message digest generated at mobile agent recovery time.

Rosary : Topology-Aware Structured P2P Overlay Network for CDN System (Rosary : CDN 시스템을 위한 구조화된 토폴러지-인식 P2P 오버레이 네트워크)

  • Shin Soo-Young;Namgoong Jung-ll;Park Soo-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12B
    • /
    • pp.818-830
    • /
    • 2005
  • Recently, Peer-to-Peer (P2P) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. Content Delivery Network (CDN) is an intermediate layer of infrastructure that helps to efficiently deliver the multimedia content from content providers to clients. In this paper, We propose a topology-aware P2P overlay network for CDN, Rosary, in which CDN servers perform Intra-Pastry and Inter-Pastry routing based on a two-level structured overlay network. This proposed system extends pastry by adapting itself to CDN environments, where a semi-hashing based scheme for Intra-Pastry routing is introduced, and dynamic landmark technology is used to construct the topology-aware overlay network. Through simulations on NS-2, it is shown that Rosary is scalable, efficient, and flexible.

Design of Itinerary Based Migration Scheme with Fault Tolerance for Mobile Agent (이동 에이전트를 위한 이주 스케줄 기반의 이주 기법 설계)

  • Kim, Gu-Su;Eom, Young-Ik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05b
    • /
    • pp.847-850
    • /
    • 2003
  • 이동 에이전트란 컴퓨터 네트워크 상에서 사용자를 대신하여 특정 작업을 수행하는 프로그램이 독자적으로 여러 노드들을 이동하면서 필요한 작업을 수행하고 그 결과를 사용자에게 전달하도록 작성된 프로그램을 말하며, 이런 이동 에이전트를 수행할 수 있도록 컴퓨팅 환경을 제공하는 것을 이동 에이전트 컴퓨팅 환경이라고 한다. 본 연구에서는 이동 에이전트 운영에 필수 기능인 이동 에이전트 이주 기능을 이주 시작 이전에 이주 경로를 선정하여 이주 스케줄(Itinerary)로 관리하는 기법과 이동 에이전트가 이주할 시점에서 자율적으로 이주 목적지를 선정하고 선정된 목적지의 정보를 홈에 있는 Itinerary에 저장하여 관리하는 기법을 설계하였다. 그리고 이주한 방문지에서 수행 결과를 체크포인트로 저장하여 예외나 비정상적인 종료를 하였을 때 Itinerary의 내용을 보고 성공적으로 수행한 가장 마지막 플랫폼에게 이동 에이전트의 복원 및 다른 목적지로의 이주를 요청함으로서 결함 허용(fault-tolerance) 기능을 가지도록 설계하였다.

  • PDF

Method of network connection management in module based personal robot for fault-tolerant (모듈기반 퍼스널 로봇의 결함 허용 지원을 위한 네트워크 연결 유지 관리 기법)

  • Choi, Dong-Hee;Park, Hong-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.300-302
    • /
    • 2006
  • Middleware offers function that user application program can transmit data independently of network device. Connection management about network connection of module is important for normal service of module base personal robot. Unpredictable network disconnection is influenced to whole robot performance in module base personal robot. For this, Middleware must be offer two important function. The first is function of error detection and reporting about abnormal network disconnection. Therefore, middleware need method for network error detection and module management to consider special quality that each network device has. The second is the function recovering that makes the regular service possible. When the module closed from connection reconnects, as this service reports connection state of the corresponding module, the personal robot resumes the existing service. In this paper proposed method of network connection management for to support fault tolerant about network error of network module based personal robot.

  • PDF

Single S-a-E fault tolerance of the triangular cellular permutation networks (삼각형 셀룰러 순열 네트워크에서의 단일 s-a-E 결함 허용)

  • 김우한;전대성;윤영우
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.9
    • /
    • pp.37-48
    • /
    • 1996
  • In this paper, for the single s-a-E fault detected in a triangular cellular permutation network (TCPN), we propose a method which can tolerate a fault by reconfiguring the netowrk and analyze the possibilities of the reconfiguration. The network is set up through iterative decomposition of a permutation into the right or left coset. For the s-a-E fault of a cell which is to be transpositioned for an increasing order mapping, we cna reconfigure it merely by switching te decomposition scheme from right coset to left coset or vice versa. Also for a decreasing order mapping, we make a detour around the faulty cell. Reconfiguring with the redundant connectivity of a TCPN, we could realize form 17% to 90% of the permutation for the number of inputs from 4 to 40. REconfiguration of the network by exchanging the first input with the last input and the first output with the last output resulted in more than 99% realization of the permutation. Also with the exchange of all inputs and outputs with neighboring cells, we could have 100% realization of the permutation.

  • PDF