arrow
返回

Dynamic Resource Allocation by Batch Optimization for Value-Added Video Services Over SDN

delete2018-11-01
delete12
PRE
AI
K
K. Tolga Bagci *
A
A. Murat Tekalp
DOI:10.1109/TMM.2018.2823907delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We propose a video service architecture and a novel resource allocation optimization framework to enable network service providers (NSP) to offer value-added video services (VAVS) over software-defined networking including different service levels, service-level awareness of users, and associated business models. To this effect, we introduce a new batch-optimization framework, where resource (path, bitrate, and admission control) allocations for a small group of flows (consisting of new service requests and some existing ones) are performed simultaneously as the number of new service requests and network conditions vary. The optimization problem becomes NP-complete when path computations are jointly (re-)optimized as a group in order to accommodate all service requests to the extent possible, to best utilize entire network resources in a fair manner, and maximize network service provider's revenue. In order to compute dynamic resource allocations online, we propose a heuristic group-constrained-shortest path procedure that aims for a fair allocation of resources among a group of requests with the same service level, while maximizing the total NSP revenue. Experimental results demonstrate the feasibility of the proposed method for possible deployment by NSP to offer future VAVS, and that the proposed solution is close to the optimal solution, which is approximately computed using a divide-and conquer strategy, for varying network size and traffic load conditions. In particular, we show that processing service requests in batches significantly improves total revenue and fairness in congested mode of operation.
Keyword:
Multiple service-levels
value-added services
path computation
batch optimization
software defined networking (SDN)
quality of service (QoS)
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Multimedia 封面图
IEEE Transactions on Multimedia
IF:
9.7
论文数:
4.5K
被引数:
2.4W

机构

K
koc university
学者数:
5.7K
论文数: 4.5K
被引数: 48
引用论文

引用论文

Polynomial time approximation algorithms for multi-constrained QoS routing
err2008-06-01
err104
PREAI
errXue, Guoliang; Zhang, Weiyi; Tang, Jian; Thulasiraman, Krishnaiyan
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
Cloud Mobile Media: Reflections and Outlook
err2014-06-01
err137
errOAAI
errWen, Yonggang; Zhu, Xiaoqing; Rodrigues, Joel J. P. C.; Chen, Chang Wen
err分享
err收藏
Preservation of Intestinal Structural Integrity by Zinc Is Independent of Metallothionein in Alcohol-Intoxicated Mice
err2004-06-01
err0
errOAAI
errJason C. Lambert; Zhanxiang Zhou; Lipeng Wang; Zhenyuan Song; Craig J. McClain; Y. James Kang
err分享
err收藏
学者 查看更多内容