KDKe Deng

Ke Deng

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ke Deng has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • On Delay Tomography: Fast Algorithms and Spatially Dependent Models

    by Ke Deng, Yang Li, Weiping Zhu, Zhi Geng, Jun S. Liu

    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.


  • A Top Down Approach to Estimate Network Loss Rate

    by Weiping Zhu, Ke Deng

    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.