Hierarchical video patching with optimal server bandwidth
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
On guaranteed VoD services in next generation optical access networks
IEEE Journal on Selected Areas in Communications - Special issue on next-generation broadband optical access network technologies
Prediction algorithms in large scale VOD services on grid infrastructure
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
Prediction algorithms in large scale VOD network collaborations
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
| Hi-index | 0.00 |
This paper presents a new form of video on-demand called ýFragmented Patchingý, which enables clients to move around freely even while receiving video. Patching techniques, which greatly reduce the required network bandwidth through multicasting, have potential for on-demand video distribution. However, patch-flow techniques based on unicast data are unsuitable for providing services to mobile clients because of the intricate process required for relatively short unicast flows to individually follow a moving client. In fragmented patching, however, patch flows are sent via broadcasting. In addition, to avoid increasing traffic due to broadcasting, the patch flows are broken down into segments, each of which is aggregated to be shared with as many multiple clients as possible. We compared the two techniques by using mathematical models, which present the average usage of link bandwidth with the traffic intensity (Erlang), and numerical analysis revealed the aggregation effect by segmenting patch flows countervails the increase in traffic caused by broadcasting patch flows.