UPV-EHU ADDI
  • Volver
    • English
    • español
    • Basque
  • Login
  • español 
    • English
    • español
    • Basque
  • FAQ
Ver ítem 
  •   Inicio
  • INVESTIGACIÓN
  • Publicaciones - UPV/EHU
  • Servicio Editorial UPV/EHU
  • Revistas
  • Ekaia
  • (2016) Número Extra
  • Ver ítem
  •   Inicio
  • INVESTIGACIÓN
  • Publicaciones - UPV/EHU
  • Servicio Editorial UPV/EHU
  • Revistas
  • Ekaia
  • (2016) Número Extra
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

QoE-aren optimizaziorako indize-erregelen proposamenak sare-baliabideen esleipenerako planifikazioan

Thumbnail
Ver/
14384-54779-2-PB.pdf (457.9Kb)
Fecha
2016
Autor
Taboada Puente, Ianire ORCID
Liberal Malaina, Fidel
Metadatos
Mostrar el registro completo del ítem
  Estadisticas en RECOLECTA
(LA Referencia)

Ekaia N. Extra : 109-120 (2016)
URI
http://hdl.handle.net/10810/38915
Resumen
Lan honetan sakon aztertu dira erabiltzaileek hautemandako kalitatearen maximizazioa helburu duen sare-baliabideen planifikaziorako scheduling algoritmoak, beti ere sare-baliabideen esleipenean kalitate subjektiboaren maximizaziorako planifikazioaren garrantzia eta beharra buruan izanda. Ikerketak bereziki erreparatu dio matematika arloan ekarpen handia egin duten Gittins zein Whittle metodoen bidez lortutako kalitate subjektiboaren maximizaziorako scheduling indize-erregela motako soluzioen azterketei. Modu honetan, lehenik eta behin, bi diziplina horiek aurkeztu dira, Gittinsena bakunagoa izanik. Ondoren, bi planifikazio-politika horien errendimenduak elkarrekin erkatu dira, eta ikusi da Whittlen-en konponbideak emaitza nabarmenki hobeak erakusten dituela. Ondorioz, Gittins edo Whittle metodoetan oinarritutako proposamena aukeratuko da.; Considering the importance and necessity of network resource al location for maximizing subjective quality, this work deals with scheduling algorithms aimed at maximizing users’ perception of quality. This research is focused on the analysis of subjective quality aware scheduling index rule solutions obtained by means of Gittins and Whittle methods, which have a great contribution in the mathematics area. In this way, first of all, we present the previous disciplines, being the Gittins-based simpler. Then, we compare the performance of these scheduling policies, showing that the Whittle-based solution gives considerably better results. As a conclusion, a tradeoff between the index complexity and the achievable subjective qualit y exists, when choosing the Gittins-based or the Whittle-based proposal.
Colecciones
  • (2016) Número Extra

DSpace 6.4 software copyright © -2023  DuraSpace
OpenAIRE
EHU Bilbioteka
 

 

Listar

Todo ADDIComunidades & ColeccionesPor fecha de publicaciónAutoresTítulosDepartamentos (cas.)Departamentos (eus.)MateriasEsta colecciónPor fecha de publicaciónAutoresTítulosDepartamentos (cas.)Departamentos (eus.)Materias

Mi cuenta

Acceder

Estadísticas

Ver Estadísticas de uso

DSpace 6.4 software copyright © -2023  DuraSpace
OpenAIRE
EHU Bilbioteka