• Title/Summary/Keyword: Fault-tolerant

Search Result 717, Processing Time 0.021 seconds

Near-Five-Vector SVPWM Algorithm for Five-Phase Six-Leg Inverters under Unbalanced Load Conditions

  • Zheng, Ping;Wang, Pengfei;Sui, Yi;Tong, Chengde;Wu, Fan;Li, Tiecai
    • Journal of Power Electronics
    • /
    • v.14 no.1
    • /
    • pp.61-73
    • /
    • 2014
  • Multiphase machines are characterized by high power density, enhanced fault-tolerant capacity, and low torque pulsation. For a voltage source inverter supplied multiphase machine, the probability of load imbalances becomes greater and unwanted low-order stator voltage harmonics occur. This paper deals with the PWM control of multiphase inverters under unbalanced load conditions and it proposes a novel near-five-vector SVPWM algorithm based on the five-phase six-leg inverter. The proposed algorithm can output symmetrical phase voltages under unbalanced load conditions, which is not possible for the conventional SVPWM algorithms based on the five-phase five-leg inverters. The cause of extra harmonics in the phase voltages is analyzed, and an xy coordinate system orthogonal to the ${\alpha}{\beta}z$ coordinate system is introduced to eliminate low-order harmonics in the output phase voltages. Moreover, the digital implementation of the near-five-vector SVPWM algorithm is discussed, and the optimal approach with reduced complexity and low execution time is elaborated. A comparison of the proposed algorithm and other existing PWM algorithms is provided, and the pros and cons of the proposed algorithm are concluded. Simulation and experimental results are also given. It is shown that the proposed algorithm works well under unbalanced load conditions. However, its maximum modulation index is reduced by 5.15% in the linear modulation region, and its algorithm complexity and memory requirement increase. The basic principle in this paper can be easily extended to other inverters with different phase numbers.

Comparison of Energy Demand in Multi-Story Buckling Restrained Braced Frame and Equivalent SDOF System (다층 비좌굴 가새골조와 등가 단자유도계의 에너지 요구량의 비교)

  • 김진구;원영섭
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.2
    • /
    • pp.173-182
    • /
    • 2003
  • In equivalent static nonlinear analysis and in energy-based design, the structures are generally transformed into an equivalent SDOF system. In this study the seismic energy demands in multi story structures, such as three-, eight-, and twenty-story steel moment-resisting frames(MRF), buckling restrained braced frames(BRBF) and a damage tolerant braced frame(DTBF), are compared with those of equivalent single degree of freedom(ESDOF) systems. Sixty earthquake ground motions recorded In different soil conditions, which are soft rock, soft soil, and neat fault, were used to compute the input and hysteretic energy demands in model structures. In case the modal mass coefficient is less than 0.8, the effects of higher modes are considered in the process of converting into ESDOF According to the analysis results, the hysteretic and input energies obtained from 3 story and 8 story MRF and DTBF agreed well with the results from analysis of equivalent SDOF systems. However in the 20 story BRBF the results from ESDOF underestimated those obtained from the original structures.

Redundancy operation method for a distributed public address system (분산형 전관방송 시스템의 이중화 운영 방법)

  • Ryu, Taeha;Kim, Seungcheon
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.8
    • /
    • pp.47-53
    • /
    • 2020
  • In the case of a failure due to equipment deterioration in the public address system or a worker's mistake during construction, broadcasting becomes impossible. In this situation, we have designed a more advanced management broadcast system that can broadcast. The broadcasting service is operated using main broadcasting device, and local broadcasting device operates separately only in the local area. If the main broadcasting device becomes inoperable, the procedure for transferring the control activates the device with the local broadcasting devices based on data backed up by the main controller. This paper proposes an improved method of the conventional emergency broadcasting device duplication method. The existing method could not use the standby equipment in the normal state, but in the proposed method, the standby equipment can be used as local broadcasting equipment in usually. This method enables stable system operation while minimizing resource waste due to redundant configuration of expensive devices.

Quorum Consensus Method based on Ghost using Simplified Metadata (단순화된 메타데이타를 이용한 고스트 기반 정족수 동의 기법의 개선)

  • Cho, Song-Yean;Kim, Tai-Yun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.34-43
    • /
    • 2000
  • Replicated data that is used for fault tolerant distributed system requires replica control protocol to maintain data consistency. The one of replica control protocols is quorum consensus method which accesses replicated data by getting majority approval. If site failure or communication link failure occurs and any one can't get quorum consensus, it degrades the availability of data managed by quorum consensus protocol. So it needs for ghost to replace the failed site. Because ghost is not full replica but process which has state information using meta data, it is important to simplify meta data. In order to maintain availability and simplify meta data, we propose a method to use cohort set as ghost's meta data. The proposed method makes it possible to organize meta data in 2N+logN bits and to have higher availability than quorum consensus only with cohort set and dynamic linear voting protocol. Using Markov model we calculate proposed method's availability to analyze availability and compare it with existing protocols.

  • PDF

Management of Knowledge Abstraction Hierarchy (지식 추상화 계층의 구축과 관리)

  • 허순영;문개현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.131-156
    • /
    • 1998
  • Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering Process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention on the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy (KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance. The KAH consists of two types of knowledge abstraction hierarchies. The value abstraction hierarchy is constructed by abstract values that are hierarchically derived from specific data values in the underlying database on the basis of generalization and specialization relationships. The domain abstraction hierarchy is built on the various domains of the data values and incorporates the classification relationship between super-domains and sub-domains. On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, database operations are discussed for both the generalization and specialization Processes, and the conceptual query handling. A prototype system has been implemented at KAIST that demonstrates the usefulness of KAH in ordinary database application systems.

  • PDF

Design and Implementation of Channel Server Model for Large-scale Channel Integration (대용량 채널 통합을 위한 채널 서버 모델 설계 및 구현)

  • Koo, Yong-Wan;Han, Yun-Ki
    • Journal of Internet Computing and Services
    • /
    • v.10 no.1
    • /
    • pp.123-134
    • /
    • 2009
  • The CRM(Customer Relationship Management) is a business strategy model which can reap higher profits and can provide a competitive edge to an enterprise in today's new business environments. Early next year (2009), the Capital Market Consolidation Act will be in effect in South Korea. This is required for a qualitative growth to provide QoS (Quality of Service) and ensure growth in finance, IT industry & service. Accordingly, the securities and insurance companies, banks and other financial institutions make efforts to improve their derivative financial product and also enhance their services. In this paper we design and implement a Channel Server model for a Scalable Service Channel Server to efficiently manage the high volumes of inbound customer interactions based on the requirements of a CRM center. The proposed Scalable Service Channel Server supports integration with other third party service and standardization of multiple inbound service channels. The proposed model can be efficiently used in an inbound CRM center of any banking, finance, securities and insurance establishments.

  • PDF

Specification and Proof of an Election Algorithm in Mobile Ad-hoc Network Systems (모바일 Ad-hoc 네트워크 시스템하에서 선출 알고리즘의 명세 및 증명)

  • Kim, Young-Lan;Kim, Yoon;Park, Sung-Hoon;Han, Hyun-Goo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.7
    • /
    • pp.950-959
    • /
    • 2010
  • The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

AKA-PLA: Enhanced AKA Based on Physical Layer Authentication

  • Yang, Jing;Ji, Xinsheng;Huang, Kaizhi;Yi, Ming;Chen, Yajun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3747-3765
    • /
    • 2017
  • Existing authentication mechanisms in cellular mobile communication networks are realized in the upper layer by employing cryptographic techniques. Authentication data are broadcasted over the air in plaintext, enabling attackers to completely eavesdrop on the authentication and get some information about the shared secret key between legitimate nodes. Therefore, reusing the same secret key to authenticate several times results in the secret key's information leakage and high attacking rate. In this paper, we consider the most representative authentication mechanism, Authentication and Key Agreement (AKA), in cellular communication networks and propose an enhanced AKA scheme based on Physical Layer Authentication (AKA-PLA). Authentication responses generated by AKA are no longer transmitted in plaintext but masked by wireless channel characteristics, which are not available to adversaries, to generate physical layer authentication responses by a fault-tolerant hash method. The authenticator sets the threshold according to the authentication requirement and channel condition, further verifies the identity of the requester based on the matching result of the physical layer authentication responses. The performance analyses show that the proposed scheme can achieve lower false alarm rate and missing rate, which are a pair of contradictions, than traditional AKA. Besides, it is well compatible with AKA.

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 AND IMPLEMENTATION OF THE SMALL SATELLITE ON-BOARD COMPUTER SYSTEM : KASCOM (소형위성의 제어를 위한 컴퓨터 시스템의 설계 및 구현)

  • 김기형;김형신;박재현;박규호;최순달
    • Journal of Astronomy and Space Sciences
    • /
    • v.13 no.2
    • /
    • pp.52-66
    • /
    • 1996
  • In this paper, we present the design methodology of KASCOM(KAIST satellite computer), the experimental on-board computer system of KITSAT-2. The design of the on-board computer system should consider the following constraints: operational throughput, fault tolerant input-output, low power, size, weight, and radiation hardness. KASCOM is designed to satisfy these constraints. This paper also presents the implementation and testing details of KASCOM. Finally, the in-orbit operational results are presented. The results show that about 2 SEU errors occur for the program memory(1Mbit SRAM) in a day, while 3.7 SEU errors occur for the data memory(4Mbit SRAM). This implies that high-integrated memories are more susceptible to the radiation environment than low-integrated memories.

  • PDF