Ultra-high-frequency (UHF) sensing technique has been introduced to detect and localize partial discharge (PD) sources in air-insulated substation (AIS). This paper presents a probability-based algorithm to localize m...
详细信息
Ultra-high-frequency (UHF) sensing technique has been introduced to detect and localize partial discharge (PD) sources in air-insulated substation (AIS). This paper presents a probability-based algorithm to localize multiple PD sources which may occur simultaneously in different power equipment. Assuming that the time difference of arrival (TDOA) between all pairs of antennas in a array are normally distributed, the probability density function (PDF) of PD source coordinates can be obtained by substituting the linearized form of time difference equations into PDFs of TDOAs. When large number of PD signals are recorded, the joint PDF (JPDF) can be calculated from the product of PDF of each TDOA. Then the PD coordinates to be solved are regarded as with highest probability, and can be solved by taking the derivative of JPDF. In the case of multiple PD sources, mixed UHF signals are separated by clustering the TDOA vectors with K Means clustering method. PD experiments are performed to test the presented algorithm, and the localization accuracy of proposed algorithm is compared with other typical methods such as Newton-Raphson, Particle Swarm Optimization and plane intersection method. The results indicate that the probability-based localization algorithm reasonably integrates the TDOAs of continuous signal sequence, which can effectively reduce the influence of TDOA estimation errors and improve the localization accuracy.
Network function virtualization (NFV) is a new network architecture concept that simplifies the deployment of network services and improves service management. However, it is challenging for a network service provider...
详细信息
Network function virtualization (NFV) is a new network architecture concept that simplifies the deployment of network services and improves service management. However, it is challenging for a network service provider (NSP) to decide where to place virtual network functions (VNFs). Most previous studies have considered only single-chain services, wherein the VNFs for a request are executed in sequence. In contrast to previous approaches, we consider more general and practical situations in which the VNFs of a request can be executed in parallel and are represented as a forwarding graph. Our objective is to maximize the profits earned by providing network services while satisfying the delay requirements of requests. We formulate the VNF placement problem as an integer linear programming (ILP) problem. Due to the complexity of this problem, we propose a probability-based approach called PBP, in which the placements of the VNFs are determined based on their probabilities of contributing to the profit. Furthermore, we propose a heuristic reliability-aware algorithm to guarantee service reliability, in which each VNF of a request is assigned a backup that can be shared with other requests. Simulation experiments show that PBP achieves a much shorter computation time than previous algorithms while earning higher profit, and furthermore, our reliability-aware algorithm provides the same reliability as a previous algorithm while yielding much higher profit.
暂无评论