Computer Algorithms: C++
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Load management in distributed video servers
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
On bandwidth and storage tradeoffs in multimedia distribution networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Multimedia information caching for personalized video-on-demand
Computer Communications
A cost comparison of distributed and centralized approaches to video-on-demand
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Minimizing transmission and storage cost for delivering video programs is an important aspect of video-on-demand (VoD) systems. Since the size of data is quite large, “caching” programs at cheap storage sites for future delivery can be very beneficial. In this paper, we propose a scheduling algorithm to aim directly on VoD systems under the metropolitan-area network. By mapping any delivery schedule into a connected path under a special weighted graph, the original scheduling problem can be reduced to the optimal Steiner tree problem. After analyzing the characteristics of the Steiner tree under the special graph, we introduce the concept of potential value and then formulate the cost of each Steiner tree as an equation of potential value. We can hence obtain the cost of each delivery schedule through calculating the corresponding equation of the potential value. Therefore, by comparing the cost of any possible Steiner tree, we can eventually find the optimal total cost for servicing all requests. Also, the time complexity of our algorithm is O(m3n2), where m is the number of servers and n is the number of requests.