Video Scheduling for P2P-based Interactive Signage Systems
Date Issued
2010
Date
2010
Author(s)
Shen, Wei-Liang
Abstract
With the advancement of technology, the types of advertising become much more diversified, and viewers also can receive this information from much more different devices. Even in commuting, riding, or shopping, there are many opportunities for people to receive different types of advertising. Signage Systems is one of important ways to distribute ads, but they cannot change ads frequently. Therefore, these viewers are usually not interesting the advertising played by signage. Because of these reasons, lots of signage systems transmit ads by network. They can use this method to change ads dynamically. So that viewers can get the information they really care about. More recently there are signage systems which can detect the viewer behavior, interesting, and so on. With this information, signage can dynamically download ads, which can be customized for different groups to achieve more effective recommendation results.
In order to achieve interactive signage systems playing ads in real time, each signage will download the videos frequently. According to the existing framework, the server will have very heavy burden, and its required upload bandwidth will also be considerable. This thesis improves peer-to-peer transmission technology to reduce the server load, but it cannot reduce the server upload bandwidth usefully without improving peer-to-peer transmission technology.
This thesis has the following contribution. First, prove this problem, reforming peer-to-peer to reduce server upload bandwidth, is Set-covering problem(NP-hard). Second, this thesis proposes a greedy approximation algorithm to solve this problem. Without impacting the interactivity, this algorithm can reduce server upload bandwidth effectively.
In the experiment, the proposed method relative to the peer-to-peer transmission technology, which does not take the characteristics of interactive into account, has very significant upgrade. When the number of the signage and the video type increases, greedy approximation algorithm can approach to the ideal bound. So this algorithm proposed by this thesis can significantly reduce the interactive signage systems'' server upload bandwidth.
Subjects
Interactive Signage Systems
server upload bandwidth
Peer-to-Peer
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-99-R97944010-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):e1f895c33b53d933bb536787f6424341