Xu Du

Xu Du

Auto-generated profile, based on publicly available information

Xu Du

Huazhong University of Science & Technology

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 July 2006 in Multimedia Systems
Verified
Journal Article
Closed access
PDF file
JYJiang Yu
Jiang Yu
CCChun Tung Chou
Chun Tung Chou
ZYZongKai Yang
ZongKai Yang
XDXu Du
Xu Du
TWTai Wang
Tai Wang

1 November 2005
Verified
Conference Paper
Closed access
ZYZongkai Yang
Zongkai Yang
TWTai Wang
Tai Wang
XDXu Du
Xu Du
WLWei Liu
Wei Liu
JYJiang Yu
Jiang Yu
An accurate understanding on the content popularity distribution of media objects in streaming applications is required when designing efficient caching algorithms for the streaming media. However, there is no empirical model to describe this distribution. Our investigation shows that the content popularity of a hot streaming media file exhibits a Zipf-like distribution under K-transformation, after analyzing 250 hot clips in 2 long-term traces. A specific function is proposed to describe this phenomenon. This result builds a foundation for designing intelligent caching algorithms.

8 December 2003
Verified
Conference Paper
Closed access
XDXu Du
Xu Du
CCChun Tung Chou
Chun Tung Chou
ZYZongkai Yang
Zongkai Yang
WCWenqing Cheng
Wenqing Cheng
JHJiaqing Huang
Jiaqing Huang
Previous studies have shown that an increasing fraction of the data on the WWW is fast-changed, such as news, sports scores, stock prices, and so on. An important issue to cache such dynamic content is the maintenance of consistency. We propose a self-organizing caching scheme to ensure the users get the up-to-date documents all along even if the documents are fast-changed. This scheme combines the mechanism of client polling and that of server pushing based on a mechanism of self-organizing multicast trees. The trees are created, optimized and destroyed automatically according to the rate of change and location of the dynamic document and the network conditions, such as the capacity, the traffic load. Meanwhile we derive a formula for cache nodes to determine which documents should be cached.

1 January 2006
Verified
Conference Paper
Closed access
XDXu Du
Xu Du
TWTai Wang
Tai Wang
ZYZongkai Yang
Zongkai Yang
JYJiang Yu
Jiang Yu
WLWei Liu
Wei Liu
Caching video objects at the edge of the back-bone network has become a hot spot in the video delivery research. Some researchers proposed segmentation-based caching algorithms to improve the disk utility in the homogeneous environment. Other researchers proposed caching algorithms with video layering or transcoding to improve the perceptual quality in the heterogeneous environment. However, for a low cost proxy, these systems are suffering from either inflexible structures or high computation. In this paper, the overall quality hit ratio(QHR) is proposed to measure how well the clients' requests on the quality are satisfied. Aiming to achieve the highest QHR, an intelligent caching algorithm is designed to determine the appropriate perceptual quality of the segments cached in the proxy. This innovative approach takes not only the access bandwidth distribution into account, but also the segment popularity distribution. Simulation results demonstrate that our variable rate caching(VRC) algorithm not only achieves the highest QHR but also keeps its complexity at an acceptable level.