Delivering large media files over the Internet is a challenging task because it has some unique features that are different from delivering conventional web documents. In this paper, we propose a fine-grained peer sharing technique for dealing with the problem in the context of content distribution networks. The key difference of the technique from conventional peer-to-peer systems is that the unit of peer sharing is not a complete media file, but at a finer granularity. By doing so, we improve the flexibility of replica servers for handling client requests. We analyze the storage requirement at replica servers and design a scheduling algorithm to coordinate the delivery process from multiple replica servers to a client. Our simulations show that the fine-grained peer sharing approach can reduce the initial latency of clients and the rejection rate of the system significantly over a simple peer sharing method.
|Number of pages||9|
|Journal||IEEE Transactions on Multimedia|
|State||Published - Aug 2006|
Bibliographical noteFunding Information:
Manuscript received February 7, 2004; revised October 22, 2005. This work was supported in part by the National Science Foundation under Grants CCR-0204304 and EIA-0101242, and a grant from the Kentucky Science and Engineering Foundation as per Grant Agreement KSEF-148-502-05-139 with the Kentucky Science and Technology Corporation. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Wen-Wu Zhu.
- Multimedia streaming
- Video segmentation
ASJC Scopus subject areas
- Signal Processing
- Media Technology
- Computer Science Applications
- Electrical and Electronic Engineering