• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• 정보과학회 논문지
• /
• 제42권10호
• /
• pp.1268-1279
• /
• 2015

사물인터넷(IoT)에 연결된 다수의 장치를 관리하기 위해서 IETF는 IPv6를 지원하는 RPL 라우팅 프로토콜을 제안하였다. RPL은 사물인터넷이 구축되는 네트워크에서 요구되는 서비스에 맞는 OF(Objective Function)를 통해 경로가 생성된다. RPL에서는 단순하게 노드 간 링크 품질만을 고려하여 경로를 구축하므로, 다양한 목적의 QoS를 제공할 수 있는 OF에 대한 연구가 필요하다. 기존의 연구에서는 주로 에너지 소비 감소를 다루고 있고, 싱크 노드까지 형성된 경로의 링크 품질을 고려하지 않고 있어 종단 간 지연시간이 늘어 날 수 있다. 본 논문에서는 트래픽이 몰려 병목현상이 일어나는 노드의 예상 수명과 목적지까지 형성될 전체 경로의 품질을 고려하여 지연시간을 줄이는 기법을 제안한다. 실험을 통해 제안 기법의 가중치를 설정하였고, 종단 간 지연시간을 약 20.8%, 에너지 소비를 약 10.5% 개선하였음을 보였다.

• 전력전자학회논문지
• /
• 제22권4호
• /
• pp.277-284
• /
• 2017

For passive power factor correction, the valley fill circuit approach is attractive for low power applications because of low cost, high efficiency, and simple circuit design. However, to vouch for the product quality, two dc-link capacitors in the valley fill circuit should be selected to withstand the peak rectified ac input voltage. The common mode (CM) and differential mode (DM) choke should be used to suppress the electromagnetic interference (EMI) noise, thereby resulting in large size volume product. This paper presents the practical design and implementation of a valley fill flyback converter with reduced dc link capacitors and EMI magnetic volumes. By using the proposed over voltage protection circuit, dc-link capacitors in the valley fill circuit can be selected to withstand half the peak rectified ac input voltage, and the proposed CM/DM choke can be successfully adopted. The proposed circuit effectiveness is shown by simulation and experimentally verified by a 78W prototype.

• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

• Journal of Power Electronics
• /
• 제3권4호
• /
• pp.239-248
• /
• 2003

This paper presents a novel prototype of three-phase voltage source type zero voltage soft-switching inverter with the auxiliary resonant snubbers suitable for high-power applications with IGBT power module packages in order to reduce their switching power losses as well as electromagnetic conductive and radiative noises. A proposed single inductor-assisted resonant AC link snubber circuit topology as one of some auxiliary resonant commutation snubbers developed previously to achieve the zero voltage soft-switching (ZVS) for the three-phase voltage source type sinewave PWM inverter operating under the instantaneous space voltage vector modulation is originally demonstrated as compared with the other types of resonant AC link snubber circuit topologies. In addition to this, its operation principle and unique features are described in this paper. Furthermore, the practical basic operating performances of the new conceptual instantaneous space voltage vector modulation resonant AC link snubber-assisted three-phase voltage source type soft-switching PWM inverter using IGBT power module packages are evaluated and discussed on the basis of switching voltage and current waveforms, output line to line voltage quality, power loss analysis, actual power conversion efficiency and electromagnetic conductive and radiative noises from an experimental point of view, comparing with those of conventional three-phase voltage source hard-switching PWM inverter using IGBT power modules.

• 한국항행학회논문지
• /
• 제23권6호
• /
• pp.584-588
• /
• 2019

WBAN (wireless body area network)은 비정상적인 건강 상태, 실시간 의료 모니터링, 원격 의료 지원 시스템을 조기에 탐지할 수 있는 네트워킹 기술이다. 최근에 이슈가 되고 있는 건강 관리를 위한 사물 인터넷 (IoT; internet of things)은 인간의 삶의 질을 향상시키는 데 가장 유망한 분야 중에 하나이다. 이것은 다른 통신 시스템과 마찬가지로 의료 통신 시스템의 높은 QoS (quality of service)요구사항을 만족해야 한다. 따라서 WBAN 통신 시스템의 QoS 요구 사항을 수용하기 위해 오류율 (BER; bit error rate) 임계 값을 선택하였다. 본 논문에서는 IR-UWB PPM 변조 방식을 이용한 WBAN 채널의 BER 성능을 계산하고 WBAN의 링크 버짓과 시스템 마진을 다양한 시스템 파라미터에 따라 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5264-5281
• /
• 2017

Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

• Journal of Power Electronics
• /
• 제16권1호
• /
• pp.190-204
• /
• 2016

An active front end (AFE) is required for a three-phase induction motor (IM) fed by a voltage source inverter (VSI), because of the increasing need to derive quality current from the utility end without sacrificing the power factor (PF). This study investigates a proportional-plus-integral (PI) controller based AFE topology that uses a super-lift converter (SLC). The significance of the proposed SLC, which converts rectified AC supply to geometrically proceed ripple-free DC supply, is explained. Variations in several power quality parameters in the intended IM drive for 0% and 100% loading conditions are demonstrated. A simulation is conducted by using MATLAB/Simulink software, and a prototype is built with a field programmable gate array (FPGA) Spartan-6 processor. Simulation results are correlated with the experimental results obtained from a 0.5 HP IM drive prototype with speed feedback and a voltage/frequency (V/f) control strategy. The proposed AFE topology using SLC is suitable for three-phase IM drives, considering the supply end PF, the DC-link voltage and current, the total harmonic distortion (THD) in supply current, and the speed response of IM.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.