Weiping Zhu
Weiping Zhu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ke Deng
Department of Statistics, Harvard University
2 shared publications Xianping Guo
Department of Mathematics, Zhongshan University, P. R. China
2 shared publicationsJun S. Liu
Department of Statistics, Harvard University
1 shared publicationYang Li
Department of Statistics, Harvard University
1 shared publication- Zhi Geng
School of Mathematical Sciences, Center of Statistical Science, Peking University, Beijing 100871, China
1 shared publication - Zhi Geng
Peking University
1 shared publication
Latest Publications
- 30 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 60 (11) , 5685-5697
On Delay Tomography: Fast Algorithms and Spatially Dependent Models
As an active branch of network tomography, delay tomography has received considerable attentions in recent years. However, most methods in the literature assume that the delays of different links are independent of each other, and pursuit sub-optimal estimate instead of the maximum likelihood estimate (MLE) due to computational challenges. In this paper, we propose a novel method to implement the EM algorithm widely used in delay tomography analysis for multicast networks. The proposed method makes use of a “delay pattern database” to avoid all redundant computations in the E-step, and is much faster than the traditional implementation. With the help of this new implementation, finding MLE for large networks, which was considered impractical previously, becomes an easy task. Taking advantage of this computational breakthrough, we further consider models for potential spatial dependence of links, and propose a novel adaptive spatially dependent model (ASDM) for delay tomography. In ASDM, Markov dependence among nearby links is allowed, and spatially dependent links (SDLs) can be automatically recognized via model selection. The superiority of the new methods is confirmed by simulation studies.
- 30 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 60 (11) , 5685-5697
On Delay Tomography: Fast Algorithms and Spatially Dependent Models
As an active branch of network tomography, delay tomography has received considerable attentions in recent years. However, most methods in the literature assume that the delays of different links are independent of each other, and pursuit sub-optimal estimate instead of the maximum likelihood estimate (MLE) due to computational challenges. In this paper, we propose a novel method to implement the EM algorithm widely used in delay tomography analysis for multicast networks. The proposed method makes use of a “delay pattern database” to avoid all redundant computations in the E-step, and is much faster than the traditional implementation. With the help of this new implementation, finding MLE for large networks, which was considered impractical previously, becomes an easy task. Taking advantage of this computational breakthrough, we further consider models for potential spatial dependence of links, and propose a novel adaptive spatially dependent model (ASDM) for delay tomography. In ASDM, Markov dependence among nearby links is allowed, and spatially dependent links (SDLs) can be automatically recognized via model selection. The superiority of the new methods is confirmed by simulation studies.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Divide and Conquer in Loss Tomography - Top Down vs. Botton Up
Loss tomography has received considerable attention in recent years. A number of methods, either based on maximum likelihood (ML) or Bayesian reasoning, have been proposed to estimate the loss rates of a network, and almost all of them use an iterative approximating method to search for the maximum in a multi-dimensional space. Those approaches lead to the concerns of their scalability and accuracy. To overcome the problems, a bottom up method has been proposed recently, that is a near optimal solution. In this paper, we present a closed form maximum likelihood estimate (MLE) that can be implemented in a top down method. Then, the bottom up method is compared with the top down one that shows they are little difference. More, simulations conducted under various conditions show that these two methods have almost identical results. Apart from that, the bottom up approach is independent to the number of sources used to send probes to receivers, this makes it a good candidate to estimate the loss rates of a general topology.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Divide and Conquer in Loss Tomography - Top Down vs. Botton Up
Loss tomography has received considerable attention in recent years. A number of methods, either based on maximum likelihood (ML) or Bayesian reasoning, have been proposed to estimate the loss rates of a network, and almost all of them use an iterative approximating method to search for the maximum in a multi-dimensional space. Those approaches lead to the concerns of their scalability and accuracy. To overcome the problems, a bottom up method has been proposed recently, that is a near optimal solution. In this paper, we present a closed form maximum likelihood estimate (MLE) that can be implemented in a top down method. Then, the bottom up method is compared with the top down one that shows they are little difference. More, simulations conducted under various conditions show that these two methods have almost identical results. Apart from that, the bottom up approach is independent to the number of sources used to send probes to receivers, this makes it a good candidate to estimate the loss rates of a general topology.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A Top Down Approach to Estimate Network Loss Rate
Loss tomography has received considerable attention in recent years. A number of methods, either based on maximum likelihood (ML) or Bayesian reasoning, have been proposed to estimate the loss rates of a network. Almost all implementations use an iterative approximating method, (e.g. EM algorithm) to search for the maximum in a multi-dimensional space, which crates two concerns: scalability and accuracy since the time used in searching increases exponentially as the number of links and the search may stop at a local maximum. To overcome the problems, we propose a top down approach to replace the iterative approach, which significantly reduces the time spent on estimation, and ensures the solution identified is the maximum likelihood estimate (MLE). We present simulation results to show the efficiency and accuracy of the method.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A Top Down Approach to Estimate Network Loss Rate
Loss tomography has received considerable attention in recent years. A number of methods, either based on maximum likelihood (ML) or Bayesian reasoning, have been proposed to estimate the loss rates of a network. Almost all implementations use an iterative approximating method, (e.g. EM algorithm) to search for the maximum in a multi-dimensional space, which crates two concerns: scalability and accuracy since the time used in searching increases exponentially as the number of links and the search may stop at a local maximum. To overcome the problems, we propose a top down approach to replace the iterative approach, which significantly reduces the time spent on estimation, and ensures the solution identified is the maximum likelihood estimate (MLE). We present simulation results to show the efficiency and accuracy of the method.
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1835-1839
An Efficient Method to Estimate Link-Level Transition Probability and Link-Level Loss Rate
Network tomography aims to obtain network characteristics by end-to-end measurements. Most works carried out in recent years focused on the methods and methodologies to identify some of the characteristics, such as loss rate, delay distribution, etc. which show long-term network behaviours. We in this paper turn our attention to link-level temporal correlation, in particular the transition probability of each link, and introduce a new method that is simple and fast to identify link-level transition probability. In addition, we will show that the information embedded in the transition probability is richer in some aspects than some of those long-term characteristics since those long-term characteristics can be derived from the temporal ones. The proposed method is tested in simulations, the results show the loss rates obtained by the proposed method are comparable to those obtained by the traditional maximum likelihood estimate (MLE).
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1835-1839
An Efficient Method to Estimate Link-Level Transition Probability and Link-Level Loss Rate
Network tomography aims to obtain network characteristics by end-to-end measurements. Most works carried out in recent years focused on the methods and methodologies to identify some of the characteristics, such as loss rate, delay distribution, etc. which show long-term network behaviours. We in this paper turn our attention to link-level temporal correlation, in particular the transition probability of each link, and introduce a new method that is simple and fast to identify link-level transition probability. In addition, we will show that the information embedded in the transition probability is richer in some aspects than some of those long-term characteristics since those long-term characteristics can be derived from the temporal ones. The proposed method is tested in simulations, the results show the loss rates obtained by the proposed method are comparable to those obtained by the traditional maximum likelihood estimate (MLE).
- 16 March 2005
- Published by Elsevier in Computer Communications
- Vol. 28 (4) , 351-365
A bottom-up inference of loss rate
- 16 March 2005
- Published by Elsevier in Computer Communications
- Vol. 28 (4) , 351-365
A bottom-up inference of loss rate
- 1 April 2002
- Published by Cambridge University Press (CUP) in The ANZIAM Journal
- Vol. 43 (4) , 541-557
Denumerable state continuous time Markov decision processes with unbounded cost and transition rates under average criterion
In this paper, we consider denumerable state continuous time Markov decision processes with (possibly unbounded) transition and cost rates under average criterion. We present a set of conditions and prove the existence of both average cost optimal stationary policies and a solution of the average optimality equation under the conditions. The results in this paper are applied to an admission control queue model and controlled birth and death processes.
- 1 April 2002
- Published by Cambridge University Press (CUP) in The ANZIAM Journal
- Vol. 43 (4) , 541-557
Denumerable state continuous time Markov decision processes with unbounded cost and transition rates under average criterion
In this paper, we consider denumerable state continuous time Markov decision processes with (possibly unbounded) transition and cost rates under average criterion. We present a set of conditions and prove the existence of both average cost optimal stationary policies and a solution of the average optimality equation under the conditions. The results in this paper are applied to an admission control queue model and controlled birth and death processes.
- 1 March 2002
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 39 (02) , 233-250
Denumerable-state continuous-time Markov decision processes with unbounded transition and reward rates under the discounted criterion
In this paper, we consider denumerable-state continuous-time Markov decision processes with (possibly unbounded) transition and reward rates and general action space under the discounted criterion. We provide a set of conditions weaker than those previously known and then prove the existence of optimal stationary policies within the class of all possibly randomized Markov policies. Moreover, the results in this paper are illustrated by considering the birth-and-death processes with controlled immigration in which the conditions in this paper are satisfied, whereas the earlier conditions fail to hold.
- 1 March 2002
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 39 (02) , 233-250
Denumerable-state continuous-time Markov decision processes with unbounded transition and reward rates under the discounted criterion
In this paper, we consider denumerable-state continuous-time Markov decision processes with (possibly unbounded) transition and reward rates and general action space under the discounted criterion. We provide a set of conditions weaker than those previously known and then prove the existence of optimal stationary policies within the class of all possibly randomized Markov policies. Moreover, the results in this paper are illustrated by considering the birth-and-death processes with controlled immigration in which the conditions in this paper are satisfied, whereas the earlier conditions fail to hold.