Maximizing real-time streaming services based on a multi-servers networking framework

Wang, Tian, Cai, Yiqiao, Jia, Weijia, Wen, Sheng, Wang, Guojun, Tian, Hui, Chen, Yonghong and Zhong, Bineng 2015, Maximizing real-time streaming services based on a multi-servers networking framework, Computer networks, vol. 93, no. 1, pp. 199-212, doi: 10.1016/j.comnet.2015.10.019.

Attached Files
Name Description MIMEType Size Downloads

Title Maximizing real-time streaming services based on a multi-servers networking framework
Author(s) Wang, Tian
Cai, Yiqiao
Jia, Weijia
Wen, Sheng
Wang, Guojun
Tian, Hui
Chen, Yonghong
Zhong, Bineng
Journal name Computer networks
Volume number 93
Issue number 1
Start page 199
End page 212
Total pages 14
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2015-12-24
ISSN 1389-1286
Keyword(s) Science & Technology
Computer Science, Hardware & Architecture
Computer Science, Information Systems
Engineering, Electrical & Electronic
Computer Science
Summary In recent years, we have witnessed substantial exploitation of real-time streaming applications, such as video surveillance system on road crosses of a city. So far, real world applications mainly rely on the traditional well-known client-server and peer-to-peer schemes as the fundamental mechanism for communication. However, due to the limited resources on each terminal device in the applications, these two schemes cannot well leverage the processing capability between the source and destination of the video traffic, which leads to limited streaming services. For this reason, many QoS sensitive application cannot be supported in the real world. In this paper, we are motivated to address this problem by proposing a novel multi-server based framework. In this framework, multiple servers collaborate with each other to form a virtual server (also called cloud-server), and provide high-quality services such as real-time streams delivery and storage. Based on this framework, we further introduce a (1-?) approximation algorithm to solve the NP-complete "maximum services"(MS) problem with the intention of handling large number of streaming flows originated by networks and maximizing the total number of services. Moreover, in order to backup the streaming data for later retrieval, based on the framework, an algorithm is proposed to implement backups and maximize streaming flows simultaneously. We conduct a series of experiments based on simulations to evaluate the performance of the newly proposed framework. We also compare our scheme to several traditional solutions. The results suggest that our proposed scheme significantly outperforms the traditional solutions.
Language eng
DOI 10.1016/j.comnet.2015.10.019
Field of Research 080303 Computer System Security
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, Elsevier
Persistent URL

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 5 times in TR Web of Science
Scopus Citation Count Cited 8 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 142 Abstract Views, 3 File Downloads  -  Detailed Statistics
Created: Tue, 15 Mar 2016, 14:12:32 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact