Application of binary PSO for public cloud resources allocation system of video on demand (VoD) services

Aygun, Betul
Günel Kılıç, Banu
Coşar, Ahmet
Tuncsiper, Bedriye
Video streaming, whether on demand or live, has become one of the most popular internet applications. However, financial investments required for it is a severe problem since it needs more real time storage, higher data transfer and a significant amount of computation than other kinds of multimedia data. To tackle this problem, cloud computing, offering services without investing in hardware or software, emerges as a preferred technology. However, there are a large number of cloud service providers and they offer different pricing strategies for various applications in various regions. Therefore, it is of great importance for them that incoming service requests are assigned to the appropriate cloud services at minimum cost and provide maximum user satisfaction [quality of service (QoS) attributes]. Due to the issues, such as multiple cloud providers, different QoS requirements, different service level agreements and uncertainties in demand, price and availability, the optimization of resource allocation present further challenges. The objective of our study is to optimize the cost and performance of video on demand applications using cloud content delivery networks, storage and transcoders based on the QoS requirements of users. To solve the NP-hard problem, Particle Swarm Optimization (PSO) technique is used due to the easiness in its concept and coding, less sensitive to the nature of the objective function, limited number of parameters and generating high quality solution within a short time. We propose a new method in which the optimum solution is affected not only by the best solution of the particle and global best solution but also by the best solution of the neighborhood particles in that iteration. This ternary approach is implemented into the well-known discrete and constrained PSO, achieving the minimum cost with user satisfaction for allocation of video requests to cloud resources. Although the proposed method yields better results in terms of accuracy, execution time of the algorithm is not reasonable. To overcome this inefficiency; ternary approach is embedded into multi-swarm PSO and it is parallelized and combined with greedy heuristic algorithms. The results of the comparison with the benchmarking algorithms show that our proposed method yields better results from the standpoint of both accuracy and execution time.
Applied Soft Computing


Application of particle swarm optimization algorithm in allocating cloud resources for video on demand
Aygün, Betül; Günel Kılıç, Banu; Coşar, Ahmet; Department of Information Systems (2018)
Video streaming services whether on demand or live has become one of the most popular services used recently. However, investments made for these type of applications cause a very serious financial problem just because video type of multimedia data needs more real time storage and high data transfer than other type of multimedia data. Furthermore, for the video streaming applications, significant amount of system resource in computing is required. To tackle this problem, cloud computing emerges as a preferr...
Application of schema matching methods to semantic web service discovery
Karagöz, Funda; Çiçekli, Fehime Nihan; Department of Computer Engineering (2006)
The Web turns out to be a collection of services that interoperate through the Internet. As the number of services increase, it is getting more and more diffucult for users to find, filter and integrate these services depending on their requirements. Automatic techniques are being developed to fulfill these tasks. The first step toward automatic composition is the discovery of services needed. UDDI which is one of the accepted web standards, provides a registry of web services. However representation capabi...
A study of Kangaroo Transaction model for mobile transaction management
Örenç, Zülfü; Coşar, Ahmet; Department of Information Systems (2004)
Wireless network technology has advanced to the point that it is possible to use Internet connectivity to perform job tasks while moving in a city. We simulate and experimentally evaluate Dunham̕s Kangaroo Transaction (KT) model, and a modified version of it. Our results show that the modified-KT model does not have much communication overhead (although more than the original KT model) and it is more resilient to failures of base stations.
Hybrid Fault Tolerant Peer to Peer Video Streaming Architecture
Oeztoprak, Kasim; Akar, Gözde (Institute of Electronics, Information and Communications Engineers (IEICE), 2008-11-01)
In this paper, we propose a fault tolerant hybrid p2p-CDN video streaming arhitecture to overcome the problems caused by peer behavior in peer-to-peer (P2P) video streaming systems. Although there are several studies modeling and analytically investigating peer behaviors in P2P video streaming systems, they do not COMe LIP with a solution to guarantee the required Quality of the Services (QoS). Therefore, in this study a hybrid geographical location-time and interest based clustering algorithm is proposed t...
End-to-end stereoscopic video streaming with content-adaptive rate and format control
Aksay, Anil; Pehlivan, Selen; Akar, Gözde; Bilen, Cagdas; OZCELEBİ, Tanir; Civanlar, M. Reha; Tekalp, A. Murat (Elsevier BV, 2007-02-01)
We address efficient compression and real-time streaming of stereoscopic video over the current Internet. We first propose content-adaptive stereo video coding (CA-SC), where additional coding gain, over that can be achieved by exploiting only inter-view correlations, is targeted by clown-sampling one of the views spatially or temporally depending on the content, based on the well-known theory that the human visual system can perceive high frequencies in three-dimensional (3D) from the higher quality view. ...
Citation Formats
B. Aygun, B. Günel Kılıç, N. ARICI, A. Coşar, and B. Tuncsiper, “Application of binary PSO for public cloud resources allocation system of video on demand (VoD) services,” Applied Soft Computing, pp. 0–0, 2020, Accessed: 00, 2020. [Online]. Available: