• Title/Summary/Keyword: Choking Algorithm

Search Result 4, Processing Time 0.019 seconds

Meanline analysis method for performance analysis of a multi-stage axial turbine in choking region (다단 축류 터빈에서의 초킹 영역 탈설계 성능 해석을 위한 평균반경 해석법)

  • Kim, Sangjo
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2017.05a
    • /
    • pp.881-888
    • /
    • 2017
  • In general, the choking phenomenon occurs by flow acceleration for a turbine at high pressure ratio condition. In choking condition, total pressure ratio increases without mass flow rate variation. It is hard to predict choking characteristics by using conventional meanline analysis which used mass flow inlet boundary condition. In the present study, the algorithm for predicting choking point is developed to solve the problem. Moreover, performance estimation algorithm after choking is presented by reflecting the flow behaviour of flow expansion at choked nozzle or rotor. The analysis results are compared with 3D CFD analysis and experimental data to validate present method.

  • PDF

Meanline Analysis Method for Performance Analysis of a Multi-stage Axial Turbine in Choking Region (다단 축류 터빈에서의 초킹 영역 탈설계 성능 해석을 위한 평균반경 해석법)

  • Kim, Sangjo
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.22 no.2
    • /
    • pp.20-28
    • /
    • 2018
  • In general, the choking phenomenon occurs due to the flow acceleration of a turbine under high pressure-ratio. During choking, the total pressure ratio increases without any variation in the mass flow rate. It is difficult to predict choking characteristics by using conventional meanline analysis, which utilizes mass flow inlet boundary condition. In this study, an algorithm for predicting the choking point is developed to solve this problem. In addition, a performance estimation algorithm is presented to estimate the performance after choking, based on the flow behavior of flow expansion at the choked nozzle or rotor. The analysis results are compared with 3D CFD analysis and experimental data to validate this method.

Numerical Investigation of Dual Mode Ramjet Combustor Using Quasi 1-Dimensional Solver (근사 1차원 솔버를 이용한 이중모드 램제트 연소실 해석)

  • Yang, Jaehoon;Nam, Jaehyun;Kang, Sanghun;Yoh, Jai-ick
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.49 no.11
    • /
    • pp.909-917
    • /
    • 2021
  • In this work, a one-dimensional combustor solver was constructed for the scramjet control m odel. The governing equations for fluid flow, Arrhenius based combustion kinetics, and the inje ction model were implemented into the solver. In order to validate the solver, the zero-dimensi onal ignition delay problem and one-dimensional scramjet combustion problem were considered and showed that the solver successfully reproduced the results from the literature. Subsequentl y, a ramjet analysis algorithm under subsonic speed conditions was constructed, and a study o n the inlet Mach number of the combustor was carried out through the thermal choking locatio ns at ram conditions. In such conditions, a model for precombustion shock train analysis was i mplemented, and the algorithm for transition section analysis was introduced. In addition, in or der to determine the appropriateness of the ram mode analysis in the code, the occurrence of a n unstart was studied through the length of the pseudo-shock in the isolator. A performance a nalysis study was carried out according to the geometry of the combustor.

An Analysis on BitTorrent Performance Based on the Number of Unchoked Peers (Unchoked Peer 개수에 따른 BitTorrent 성능 분석)

  • Chung, Tae-Joong;Han, Jin-Young;Kim, Hyun-Chul;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8B
    • /
    • pp.1197-1203
    • /
    • 2010
  • A strength of BitTorrent, which is widely used for file sharing today, is due to its peer selection mechanism which is designed to encourage peers to contribute data. In the peer selection phase in BitTorrent, peers to upload the file in a swarm are selected by determining which peers upload the most to themselves. However, the number of peers to upload (i.e., number of unchoked peers) is fixed to four in its peer selection mechanism of BitTorrent, which yields inefficiency because the situation of the swarm may vary frequently (e.g., number of peers in the swarm, download rates, and upload rates). In this paper, we analyze the swarming system performance when the number of unchoked in BitTorrents is not static, but dynamic. For empirical investigation, we established a testbed in Seoul National University by modifying an open-source BitTorrent client, which is popular. Through our experiments, we show that an adaptive mechanism to adjust the number of unchoked peers considering the situation of the swarm is needed to improve the performance of BitTorrent.