• Title/Summary/Keyword: Link Load

Search Result 563, Processing Time 0.024 seconds

DC Voltage Balancing Control for Multilevel H-Bridge STATCOM (다단 인버터 STATCOM의 직류전압 평형 제어)

  • Kim, Kyoung-Jin;Song, Seong Ho;Jeong, Seung-Gi
    • Proceedings of the KIPE Conference
    • /
    • 2010.11a
    • /
    • pp.234-237
    • /
    • 2010
  • This paper proposes a balancing control of DC-link voltages of a H-bridge multilevel inverter for STATCOM application. Individual DC link voltage is controlled by simply adjusting the d-q voltage reference through a PI controller in each cell while the main controller carries out the reactive power control. The correctness and effectiveness of the method are validated by PSIM simulation with unbalanced load condition data taken from a typical arc furnace load, showing the adverse effects of load unbalance to DC link voltage significantly suppressed.

  • PDF

DC-Link Voltage Control of Distribution Static Compensator using Ripple Voltage Extraction (맥동 전압 추출을 통한 배전용 정지형 보상기의 직류링크 전압제어)

  • Kim, Ho-Yeol;Choi, Jong-Woo
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.17 no.1
    • /
    • pp.8-13
    • /
    • 2012
  • DSTATCOM is active filter that reduces nonlinear and unbalanced currents. Researches about DSTATCOM are mainly divided two parts, one is the reference value calculation of compensation current depending on the calculation of the load-side average active power and dc-link capacitor average voltage, the other part is actual current control depending on the reference value of compensation current. This paper proposes a calculation of dc-link capacitor average voltage ripple voltage extraction instead of conventional method using LPF. The utility of the proposed algorithm is verified through the theoretical analysis and the experiment under unbalance loads and non-linear load.

PWM Converter Control considering time varying source voltage (Time Varying 전원 전압을 고려한 PWM 컨버터 제어)

  • 주인원;임선경;남광희
    • Proceedings of the KIPE Conference
    • /
    • 1999.07a
    • /
    • pp.692-695
    • /
    • 1999
  • A new control scheme is proposed suitable for the three phase PWM converter having abrupt load variation such as a crane. In the converter used in a crane, the peak value of source voltage varies instantaneously due to the abrupt load variations. Such a voltage variation degrades the performance of DC-link control of PWM converter. To overcome this problem, load variations should be detected and compensated properly. We propose a new method for detecting and compensating the load variations without the additional hardware. With the proposed scheme, load variations are detected by estimating the current of DC-link capacitor. The estimated current information is feedbacked to a current controller to improve the performance. Additionally, the variation of source voltage is compensated using feedforward controller. The performance of the proposed scheme has been verified through simulations.

  • PDF

New approach to dynamic load balancing in software-defined network-based data centers

  • Tugrul Cavdar;Seyma Aymaz
    • ETRI Journal
    • /
    • v.45 no.3
    • /
    • pp.433-447
    • /
    • 2023
  • Critical issues such as connection congestion, long transmission delay, and packet loss become even worse during epidemic, disaster, and so on. In this study, a link load balancing method is proposed to address these issues on the data plane, a plane of the software-defined network (SDN) architecture. These problems are NP-complete, so a meta-heuristic approach, discrete particle swarm optimization, is used with a novel hybrid cost function. The superiority of the proposed method over existing methods in the literature is that it provides link and switch load balancing simultaneously. The goal is to choose a path that minimizes the connection load between the source and destination in multipath SDNs. Furthermore, the proposed work is dynamic, so selected paths are regularly updated. Simulation results prove that with the proposed method, streams reach the target with minimum time, no loss, low power consumption, and low memory usage.

A DC-Link Voltage Control Scheme for 4-Level Inverter at Low Modulation Index (4-레벨 인버터를 위한 저변조지수 영역의 DC-링크 전압 제어기법)

  • 송종환
    • Proceedings of the KIPE Conference
    • /
    • 2000.07a
    • /
    • pp.325-329
    • /
    • 2000
  • An effective Carrier-Based PWM scheme that enables the instantaneous quality of each branch point voltage of a diode clamped 4-level inverter to be reduced at a low modulation index is described. This scheme presents a computed zero sequence voltage of PWM by the feedback of both DC-link voltages and load currents. The proposed PWM scheme enables to increase the controllable region of DC-link voltage and makes it possible to operate with small DC-link capacitors. The validity of the proposed PWM scheme is verified by simulation results.

  • PDF

Analysis on Harmonic Loss of IPMSM for the Variable DC-link Voltage through the FEM-Control Coupled Analysis

  • Park, Hyun Soo;Jeung, Tae Chul;Lee, Jae Kwang;Lee, Byoung Kuk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.225-229
    • /
    • 2017
  • This paper describes the loss analysis based on load conditions of the air conditioning compressor motors using variable dc-link voltage. The losses of PMSM (Permanent Magnet Synchronous Motor) should be analyzed by the PWM (Pulse Width Modulation) output of inverter. The harmonic loss by the PWM cannot consider that using the current source analysis of the inverter. In addition, when the voltage of dc-link is variable with the condition of variable speed and load conditions in motor, the losses of motor are also changeable, however it is hard to analyze those losses by only electromagnetic finite element method (FEM). Therefore, this paper proposes the analysis method considering the carrier frequency of the inverter and the varying state of the dc-link voltage through the FEM-control coupled analysis. Using proposed analysis method, additional core loss and eddy current loss of permanent magnet caused by PWM could be analyzed. Finally, the validity of the proposed analysis method is verified through the comparison the result of coupled analysis with experiment.

Performance-based plastic design for seismic rehabilitation of high rise frames with eccentric bracing and vertical link

  • Karimi, Rouhina;Rahimi, Sepideh
    • Earthquakes and Structures
    • /
    • v.17 no.6
    • /
    • pp.623-633
    • /
    • 2019
  • A large number of available concrete buildings designed only considering gravity load that require seismic rehabilitation because of failure to meet plasticity criteria. Using steel bracings are a common type of seismic rehabilitation. The eccentric bracings with vertical link reduce non-elastic deformation imposed on concrete members as well as elimination of probable buckling problems of bracings. In this study, three concrete frames of 10, 15, and 20 stories designed only for gravity load have been considered for seismic improvement using performance-based plastic design. Afterwards, nonlinear time series analysis was employed to evaluate seismic behavior of the models in two modes including before and after rehabilitation. The results revealed that shear link can yield desirable performance with the least time, cost and number of bracings of concrete frames. Also, it was found that the seismic rehabilitation can reduce maximum relative displacement in the middle stories about 40 to 80 percent. Generally, findings of this study demonstrated that the eccentric bracing with vertical link can be employed as a suitable proxy to achieve better seismic performance for existing high rise concrete frames.

Performance Improvement on MPLS On-line Routing Algorithm for Dynamic Unbalanced Traffic Load

  • Sa-Ngiamsak, Wisitsak;Sombatsakulkit, Ekanun;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1846-1850
    • /
    • 2005
  • This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

  • PDF

A Study on Traffic Volume Prediction for e-Commerce Systems (전자상거래 시스템의 트래픽량 예측에 관한 연구)

  • Kim, Jeong-Su
    • The KIPS Transactions:PartC
    • /
    • v.18C no.1
    • /
    • pp.31-44
    • /
    • 2011
  • The applicability of network-based computing depends on the availability of the underlying network bandwidth. Such a growing gap between the capacity of the backbone network and the end users' needs results in a serious bottleneck of the access network in between. As a result, ISP incurs disadvantages in their business. If this situation is known to ISP in advance, or if ISP is able to predict traffic volume end-to-end link high-load zone, ISP and end users would be able to decrease the gap for ISP service quality. In this paper, simulation tools, such as ACE, ADM, and Flow Analysis, were used to be able to perceive traffic volume prediction and end-to-end link high-load zone. In using these simulation tools, we were able to estimate sequential transaction in real-network for e-Commerce. We also imported virtual network environment estimated network data, and create background traffic. In a virtual network environment like this, we were able to find out simulation results for traffic volume prediction and end-to-end link high-load zone according to the increase in the number of users based on virtual network environment.

Efficient Internet Traffic Engineering based on Shortest Path Routing (최단경로 라우팅을 이용한 효율적인 인터넷 트래픽 엔지니어링)

  • 이영석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.183-191
    • /
    • 2004
  • Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.