HXHao Xu

Hao Xu

*This is an algorithmically generated author record based on publicly available information.

Hao Xu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Bouncer: Admission Control with Response Time Objectives for Low-latency Online Data Systems

    by Hao Xu, Juan A. Colmenares

    Internet companies rely on low-latency online data systems to provide quick responses to users. These systems employ complementary overload management techniques to offer a continued, acceptable service throughout traffic surges, where "acceptable" partly means that serviced queries meet or track closely their response time objectives. Thus, in this paper we present Bouncer, an admission control policy aimed to keep admitted queries under or near their service level objectives (SLOs) on percentile response times. Bouncer decides to accept or reject incoming queries based on inexpensive estimates of such percentiles. It can assign separate SLOs to different classes of queries in the workload, and implements early rejections to let clients react promptly and help data systems avoid doing useless work. We propose two starvation avoidance strategies that supplement Bouncer's basic formulation and prevent query types from receiving no service. Our evaluation, in simulation and on a production-grade distributed graph database, shows that Bouncer and its starvation-avoiding variants 1) let admitted queries meet or stay close to their SLOs when other in-house policies do not, and 2) report fewer overall rejections and a small overhead, while letting the system reach high utilization. We observe that the proposed strategies can prevent query starvation, but with a modest increase in rejections and with SLO violation counts for serviced queries that may be acceptable in practice.


  • Open Access

    A Note on Fourier-Motzkin Elimination with Three Eliminating Variables

    by Hao Xu, Kai-Kit Wong, Giuseppe Caire

    In this note, we show how difficult the brute-force Fourier-Motzkin elimination is, even in a simple case with three eliminating variables. Specifically, we first give a theorem, which plays quite an important role in the study of information-theoretic security for a multiple access wiretap (MAC-WT) channel, and then prove it for the case with three users by directly using the Fourier-Motzkin procedure. It is shown that large amounts of inequalities are generated in the elimination procedure while most of them are redundant. Actually, the number of generated inequalities grows doubly exponentially with the number of users or eliminating variables. It thus becomes unmanageable to directly prove the theorem in this brute-force way. Besides the great complexity, another disadvantage of the direct strategy is that it works only if the number of users is given. Obviously, this makes the strategy inappropriate for the proof of the theorem since it is a general result for any number of users. It is thus urgent and challenging to generally prove the theorem.

  • RF network analysis of the WEST TWA mock-up in TITAN

    by R. Ragona, J. Hillairet, F. Durodié, C. Yu, P. Mollard, Q. Yang, H. Xu, T. Batal, J. Li, A. Messiaen, et al.


  • General Architecture of Distributed Hardware-in-the-loop Simulation Supporting Dynamic Interactive Relationships

    by Hao Xu, Xinyan Zhang, Ning Xu, Qing Zhao, Congmin Li, Wei Ge

    Aiming at the problems that the construction process of distributed hardware-in-the-loop simulation (HILS) system is tedious and inflexible due to the lack of general architecture, and the previous distributed simulation architectures cannot meet the dynamic interactive relationships, a general architecture of distributed HILS supporting dynamic interactive relationships is developed. Based on this architecture, a rapid construction of distributed HILS systems can be carried out. The architecture supports the dynamic change of the data sending and receiving relationships in the distributed simulation. After testing, the architecture can support the real-time advance of distributed HILS in 1 millisecond step and meet the requirement of millisecond delay in data sending and receiving.


  • Study on Calibration System for Merging Unit Test Equipments

    by Fan Ouyang, Weijun Zhu, Hui Li, Wenwu Liang, Hao Xu, Liqiang Xu

    Today the problem of lacking effective calibration means for two key test function Indicators(delay characteristics and precision) of substation merging unit (MU) performance test equipment still exists. Under the background, this paper presents a calibration method for MU performance test equipment, develops a relevant calibration system and introduces the structure and technical indicators of the calibration system. The calibration system is based on the hardware system of high performance ARM processor, field programmable gate array (FPGA) and high precision AD chip. Then, a pre-circuit for quick sampling of voltage and current is designed to reduce sampling delay error, a high precision amplitude and phase algorithm of fixed frequency sampling is applied to realize high precision measurement of sampling signals, and a precise and flexible test strategy for delay characteristics is adopted. Finally, the comparative test of MU test equipment is carried out by using this calibration system, which basically solves the practical problem that the core performance of substation MU test equipment cannot be detected.