Time-based criteria for performance comparison of resource-intensive user tasks in virtual desktops

Makarov, Mikhail; Calyam, Prasad; Sukhov, Andrei M.; Samykin, Vitaly

doi:10.1109/iccnc.2014.6785315

Cited by 3 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various objectives of virtual desktops placement have been explored recently. Most works take into consideration the resource efficiency inside DC [2,[14][15][16]. Man and Kayashima [14] use bin packing (BP) method to find the group of VDs which is suitable for a server so that minimal hosts are used.…”

Section: Related Workmentioning

confidence: 99%

“…Man and Kayashima [14] use bin packing (BP) method to find the group of VDs which is suitable for a server so that minimal hosts are used. Makarov et al [15] propose a tool for evaluating VDs. It focuses on assessing the effect of VD access protocol so as to guide the resource configuration according to the reaction time of the task execution.…”

Section: Related Workmentioning

confidence: 99%

“…. , do (8) Select the biggest non-assigned VM from and put it into until is full (9) ← ( \VMs assigned to ) (10) if | | = 0 then (11) break (12) end if (13) end for (14) end while (15) if | | = 0 then (16) break (17) end if (18) end for (19) if (| | ̸ = 0) and (all is searched) then (20) There is overflow, return FAILURE ( ) crossover with ( ) according to MLGGA [13] with the exception that when "competition" occurs then the upper described scheme is used (3) end for Algorithm 3: Crossover operator. Algorithm 3.…”

Section: Crossover Operatormentioning

confidence: 99%

“…7The overflow VMs of , if any, are preferentially assigned to , then to other DCs in the order of non-increase order of electricity price in F . Inside each DC, the assignment is completed by MFFDOneDC (8) else (9) Place the VMs in by MFFDOneDC (10) end if (11) if All VMs are assigned successfully then (12) Clear the VMs of BC in DC (13) else (14) Remain the original assignment before mutation unchanged (15) resolution scheme and allow one BC to drive out VMs of other BCs as follows. The resident VMs of the other BCs and this driving BC in will be cleared first.…”

Section: Crossover Operatormentioning

confidence: 99%

See 3 more Smart Citations

A Unified Algorithm for Virtual Desktops Placement in Distributed Cloud Computing

Zhang

Huang

et al. 2016

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Distributed cloud has been widely adopted to support service requests from dispersed regions, especially for large enterprise which requests virtual desktops for multiple geodistributed branch companies. The cloud service provider (CSP) aims to deliver satisfactory services at the least cost. CSP selects proper data centers (DCs) closer to the branch companies so as to shorten the response time to user request. At the same time, it also strives to cut cost considering both DC level and server level. At DC level, the expensive long distance inter-DC bandwidth consumption should be reduced and lower electricity price is sought. Inside each tree-like DC, servers are trying to be used as little as possible so as to save equipment cost and power. In nature, there is a noncooperative relation between the DC level and server level in the selection. To attain these objectives and capture the noncooperative relation, multiobjective bilevel programming is used to formulate the problem. Then a unified genetic algorithm is proposed to solve the problem which realizes the selection of DC and server simultaneously. The extensive simulation shows that the proposed algorithm outperforms baseline algorithm in both quality of service guaranteeing and cost saving.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Crossover Operatormentioning

confidence: 99%

Section: Crossover Operatormentioning

confidence: 99%

See 2 more Smart Citations

A Unified Algorithm for Virtual Desktops Placement in Distributed Cloud Computing

Zhang

Huang

et al. 2016

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

Remote access protocols for Desktop-as-a-Service solutions

Magaña

Sesma

Morató³

et al. 2019

PLoS ONE

View full text Add to dashboard Cite

The use of remote desktop services on virtualized machines is a general trend to reduce the cost of desktop seats. Instead of assigning a physical machine with its operating system and software to each user, it is considerably easier to manage a light client machine that connects to a server where the instance of the user’s desktop machine actually executes. Citrix and VMware have been major suppliers of these systems in private clouds. Desktop-as-a-Service solutions such as Amazon WorkSpaces offer a similar functionality, yet in a public cloud environment. In this paper, we review the main offerings of remote desktop protocols for a cloud deployment. We evaluate the necessary network resources using a traffic model based on self-similar processes. We also evaluate the quality of experience perceived by the user, in terms of image quality and interactivity, providing values of Mean Opinion Score (MOS). The results confirm that the type of application running on the remote servers and the mix of users must be considered to determine the bandwidth requirements. Applications such as web browsing result in unexpectedly high traffic rates and long bursts, more than the case of desktop video playing, because the on-page animations are rendered on the server.

show abstract

Masaüstü Sanallaştırma Teknolojilerindeki Bağlantı Protokollerinin Karşılaştırılması

Şeşen¹

2018

Düzce Üniversitesi Bilim Ve Teknoloji Dergisi

View full text Add to dashboard Cite

Her geçen gün gelişen teknolojinin, insan hayatındaki yeri artarak devam etmektedir. İnsanlar her an, her yerde sanal masaüstü kaynaklarına erişerek ihtiyaç duyduğu işleri gerçekleştirilebilir. İnterneti olan dizüstü bilgisayar, tablet gibi herhangi bir istemciden kaynağa erişerek masaüstü sanallaştırma sistemini kullanabilir. Yüzlerce, binlerce sanal masaüstü istemcisinin olduğu bir veri merkezindeki ağ cihazlarının trafiğinin yükü oldukça fazla olacaktır. Ayrıca istemcilerin hücresel ağ kullanarak bağlantı sağladıklarında da veri trafiği kendilerine maliyet oluşturacaktır. Bu çalışmada, masaüstü sanallaştırma teknolojilerinde kullanılan PCOIP, Blast Extreme ve RDP protokolleri ile veri merkezine bağlantı sağlanarak, iki farklı çözünürlükte bir video dosyası oynatılarak, bir saatlik süre içerisinde kullandığı bant genişlikleri karşılaştırılmıştır. Oluşturulan sonuçlarda düşük çözünürlükte bant genişliği kullanımının RDP ve Blast Extreme protokollerinin yakın olduğu görülmüştür. PCOIP'nin ise yüksek bant genişliği kullandığı gözlenmiştir.

show abstract

Time-based criteria for performance comparison of resource-intensive user tasks in virtual desktops

Cited by 3 publications

References 4 publications

A Unified Algorithm for Virtual Desktops Placement in Distributed Cloud Computing

A Unified Algorithm for Virtual Desktops Placement in Distributed Cloud Computing

Remote access protocols for Desktop-as-a-Service solutions

Masaüstü Sanallaştırma Teknolojilerindeki Bağlantı Protokollerinin Karşılaştırılması

Contact Info

Product

Resources

About