Optimized cloud placement of virtual clusters using biased importance sampling

Optimized cloud placement of virtual clusters using biased importance sampling

We introduce an algorithm for the placement of constrained, networked virtual clusters in the cloud, that is based on importance sampling (also known as cross-entropy). Rather than using a straightforward implementation of such a technique, which proved inefficient, we considerably enhance the metho...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Performance evaluation review 2012-06, Vol.40 (1), p.401-402
1. Verfasser: Tantawi, Asser N.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 402
container_issue 1
container_start_page 401
container_title Performance evaluation review
container_volume 40
creator Tantawi, Asser N.
description We introduce an algorithm for the placement of constrained, networked virtual clusters in the cloud, that is based on importance sampling (also known as cross-entropy). Rather than using a straightforward implementation of such a technique, which proved inefficient, we considerably enhance the method by biasing the sampling process to incorporate communication needs and other constraints of placement requests to yield an efficient algorithm that is linear in the size of the cloud. We investigate the quality of the results of using our algorithm on a simulated cloud.
doi_str_mv 10.1145/2318857.2254813
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_2318857_2254813</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_2318857_2254813</sourcerecordid><originalsourceid>FETCH-crossref_primary_10_1145_2318857_22548133</originalsourceid><addsrcrecordid>eNqVjr0OgjAYADtoIv7Mrn0BsF8BgdlonHRxbyoUU9NC06-Y6NOLCS_gdMPlkiNkCywByPIdT6Es8yLhPM9KSGckYrBP47yqqgVZIj4Zg4JDGZHL1QVt9Uc1tDb90FBnZK2s6gLtW_rSPgzSjGrAoDzSAXX3oHctcQy0db0PsqsVRWmdGdWazFtpUG0mrsjudLwdznHte0SvWuG8ttK_BTDxWxXTqphW0_-LLyYOSJY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimized cloud placement of virtual clusters using biased importance sampling</title><source>ACM Digital Library Complete</source><creator>Tantawi, Asser N.</creator><creatorcontrib>Tantawi, Asser N.</creatorcontrib><description>We introduce an algorithm for the placement of constrained, networked virtual clusters in the cloud, that is based on importance sampling (also known as cross-entropy). Rather than using a straightforward implementation of such a technique, which proved inefficient, we considerably enhance the method by biasing the sampling process to incorporate communication needs and other constraints of placement requests to yield an efficient algorithm that is linear in the size of the cloud. We investigate the quality of the results of using our algorithm on a simulated cloud.</description><identifier>ISSN: 0163-5999</identifier><identifier>DOI: 10.1145/2318857.2254813</identifier><language>eng</language><ispartof>Performance evaluation review, 2012-06, Vol.40 (1), p.401-402</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-crossref_primary_10_1145_2318857_22548133</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Tantawi, Asser N.</creatorcontrib><title>Optimized cloud placement of virtual clusters using biased importance sampling</title><title>Performance evaluation review</title><description>We introduce an algorithm for the placement of constrained, networked virtual clusters in the cloud, that is based on importance sampling (also known as cross-entropy). Rather than using a straightforward implementation of such a technique, which proved inefficient, we considerably enhance the method by biasing the sampling process to incorporate communication needs and other constraints of placement requests to yield an efficient algorithm that is linear in the size of the cloud. We investigate the quality of the results of using our algorithm on a simulated cloud.</description><issn>0163-5999</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNqVjr0OgjAYADtoIv7Mrn0BsF8BgdlonHRxbyoUU9NC06-Y6NOLCS_gdMPlkiNkCywByPIdT6Es8yLhPM9KSGckYrBP47yqqgVZIj4Zg4JDGZHL1QVt9Uc1tDb90FBnZK2s6gLtW_rSPgzSjGrAoDzSAXX3oHctcQy0db0PsqsVRWmdGdWazFtpUG0mrsjudLwdznHte0SvWuG8ttK_BTDxWxXTqphW0_-LLyYOSJY</recordid><startdate>20120607</startdate><enddate>20120607</enddate><creator>Tantawi, Asser N.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20120607</creationdate><title>Optimized cloud placement of virtual clusters using biased importance sampling</title><author>Tantawi, Asser N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-crossref_primary_10_1145_2318857_22548133</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Tantawi, Asser N.</creatorcontrib><collection>CrossRef</collection><jtitle>Performance evaluation review</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tantawi, Asser N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimized cloud placement of virtual clusters using biased importance sampling</atitle><jtitle>Performance evaluation review</jtitle><date>2012-06-07</date><risdate>2012</risdate><volume>40</volume><issue>1</issue><spage>401</spage><epage>402</epage><pages>401-402</pages><issn>0163-5999</issn><abstract>We introduce an algorithm for the placement of constrained, networked virtual clusters in the cloud, that is based on importance sampling (also known as cross-entropy). Rather than using a straightforward implementation of such a technique, which proved inefficient, we considerably enhance the method by biasing the sampling process to incorporate communication needs and other constraints of placement requests to yield an efficient algorithm that is linear in the size of the cloud. We investigate the quality of the results of using our algorithm on a simulated cloud.</abstract><doi>10.1145/2318857.2254813</doi></addata></record>
fulltext fulltext
identifier ISSN: 0163-5999
ispartof Performance evaluation review, 2012-06, Vol.40 (1), p.401-402
issn 0163-5999
language eng
recordid cdi_crossref_primary_10_1145_2318857_2254813
source ACM Digital Library Complete
title Optimized cloud placement of virtual clusters using biased importance sampling
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T19%3A00%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimized%20cloud%20placement%20of%20virtual%20clusters%20using%20biased%20importance%20sampling&rft.jtitle=Performance%20evaluation%20review&rft.au=Tantawi,%20Asser%20N.&rft.date=2012-06-07&rft.volume=40&rft.issue=1&rft.spage=401&rft.epage=402&rft.pages=401-402&rft.issn=0163-5999&rft_id=info:doi/10.1145/2318857.2254813&rft_dat=%3Ccrossref%3E10_1145_2318857_2254813%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true