In this paper, we take the sample-path approach in analyzing the asymptotic behavior of single-hop bandwidth estimation under bursty cross-traffic and show that these results are provably different from those observed under fluid models of prior work. This difference, which we call the probing bias, is one of the previously unknown factors that can cause measurement inaccuracies in available ba...

Internet measurement studies often require prolonged probing of remote targets to collect information, yet almost all such studies of which we are aware were undertaken without considering the polluting effects of their unconstrained probing behavior. To help researchers conduct experiments in a more responsible fashion, we present a framework and technique that enables efficient execution of l...

This paper proposes a methodology for the design of a probing signal used for power system electromechanical mode estimation. Firstly, it is shown that probing mode estimation accuracy depends solely on the probing signal’s power spectrum and not on a specific time-domain realization. A relationship between the probing power spectrum and the accuracy of the mode estimation is used to determine ...

Linear probing of a scatte r (or hash) table interpre ts each key or item (these terms are inte rchangea ble here) as a probe index into the table [1]. 1 Typically, a key is divided by the table size and the remainder is used for indexing. If the selected slot is empty, the item is not present. Should the slot contain some other key, eacl1 next highe r location is checked until the item is foun...

The worst-case performance of a linear probing algorithm is studied under assumption that each of m locations can contain at most one record. It is shown that the length of the longest sequence of probes needed to insert (locate) a record grows, in probability, as c-‘log m if m and n. the total number of records, approach 03 in such a way that the load factor a = n/m is bounded away from 0 and ...

Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as , which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estima...

statement of problem: among periodontal defects, the furcation involvement represents one of the most chalenging scenarios due to the difficulty of achieving a predictable improvement regardless of the type of periodontal therapy. moreover, the presence of furcation involvement has been demonstrated to considerably affect tooth prognosis. thus, treatment of furcation defects is a challenge in c...

We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of log logn + O(1) after the insertion of n items into a table of sizeCn for a suitable constantC using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically, showing that it significantly improves on the memory wear performance for classic cuckoo hashing and linea...

Consider a sum P N 1 Y i of random variables conditioned on a given value of the sum P N 1 X i of some other variables, where X i and Y i are dependent but the pairs (X i ; Y i) form an i.i.d. sequence. We prove, for a triangular array (X ni ; Y ni) of such pairs satisfying certain conditions, both convergence of the distribution of the conditioned sum (after suitable normalization) to a normal...

We describe a Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0: up to random shifts, this process equals the two processes constructed from a Brownian bridge and a Brownian excursion by adding a drift and then taking the excursions over the current minimum. As a consequence, these three processes have the same occupation measure, which is eas...