An Efficient Coded Streaming Using Clients' Cacheopen access
- Ban, Tae-Won; Lee, Woongsup; Ryu, Jongyeol
- Issue Date
- edge caching; streaming; multimedia; coded streaming; steady-state probability
- SENSORS, v.20, no.21
- Journal Title
- As multimedia traffic has been increasing and is expected to grow more sharply, various technologies using caches have been attracting lots of attention. As one breakthrough technology to deal with the explosively growing traffic, exclusive OR (XOR)-based index coding has been widely investigated because it can greatly enhance the efficiency of network resource by reducing the number of transmissions. In this paper, we investigate how to apply XOR-based index coding to large-scaled practical streaming systems for video traffic that accounts for more than 70% of total Internet traffic. Contrary to most previous studies that have focused on theoretical analysis of optimal performance or development of optimal index coding schemes, our study proposes a new XOR coding-based video streaming (XC). We also propose a new grouping algorithm for creating XC groups while guaranteeing the complete backward compatibility of XC with existing streaming schemes such as unicast (UC), multicast (MC), and broadcast (BC). The performance of the proposed scheme is analyzed in two steps. First, the behavior of video contents in caches at clients is modeled as a Markov chain, and the steady-state probabilities and caching probabilities for each piece of video content are derived. Based on the probabilities, the performance of the proposed system is then analyzed in terms of the average number of connections that each client requires in order to receive one video content. Our numerical results show that the proposed video streaming scheme using XC can reduce the average number of transmissions by up to 18%, compared to the conventional scheme.
- Files in This Item
- There are no files associated with this item.
- Appears in
- 해양과학대학 > 지능형통신공학과 > Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.