Repozitorij Univerze v Novi Gorici

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach
Soumen Atta, Goutam Sen, 2020, izvirni znanstveni članek

Opis: In video-on-demand (VoD) services, large volumes of digital data are kept at hubs which are spatially distributed over large geographic areas and users are connected to these hubs based on their demands. In this article, we consider a large database of video files, that are pre-partitioned to multiple segments based on the demand patterns of users. These segments are restricted to be located only in hubs. Here, users are allowed to be allocated to multiple hubs and all hubs are assumed to be connected with each other. We jointly decide the location of hubs, the placement of segments to these hubs and then the assignment of users to these hubs as per their demand patterns and finally, we find the optimal paths to route the demands of users for different segments having the objective of minimizing the total routing cost. In this article, a differential evolution (DE) based method is proposed to solve the problem. The proposed DE-based method utilizes an efficient function to evaluate the objective value of a candidate solution to the proposed problem. It also incorporates two problem-specific solution refinement techniques for faster convergence. Instances of the problem are generated from the real world movie database and the proposed method is applied to these instances and the performance is evaluated against the benchmark results obtained from CPLEX.
Ključne besede: Video-on-demand (VoD) services, Content distribution networks, Database segment location, Hub location, Multiple hub allocation, Differential evolution (DE), IBM ILOG CPLEX
Objavljeno v RUNG: 17.04.2023; Ogledov: 1140; Prenosov: 0
Gradivo ima več datotek! Več...

2.
A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services
Soumen Atta, Goutam Sen, 2021, izvirni znanstveni članek

Opis: In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone network for content placement in VoD services is proposed. In VoD services, a large volume of digital data is kept as data segments in spatially distributed hubs. In SApHLP, each user is restricted to be allocated only to a single hub, and here hubs form a ring backbone network. SApHLP jointly addresses (i) the locations of hubs, (ii) the placement of segments to hubs, (iii) the allocation of users to hubs as per their demands, and (iv) the optimal paths to route the demands from users to hubs. We have introduced network flow-based 3-subscripted and path-based 4-subscripted MILP formulations of SApHLP. This article presents a novel discrete particle swarm optimization (PSO)-based approach where factoradic numbers are used to encode solution. It also incorporates three problem-specific solution refinement methods for faster convergence. In this article, SApHLP instances are generated from a real-world database of video files obtained from a movie recommender system. The benchmark solutions are generated using IBM’s CPLEX optimizer with default settings and Benders decomposition strategy. The performance of the proposed PSO is compared with the benchmark results produced by CPLEX.
Ključne besede: Single allocation p-hub location problem, Ring backbone network, VoD services, Particle Swarm Optimization (PSO), Factoradics, CPLEX
Objavljeno v RUNG: 17.04.2023; Ogledov: 940; Prenosov: 0
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.02 sek.
Na vrh