Optimized external scheduling for fair service discrimination

In Web services environments, classes of service are offered at different performance levels. Requests belonging to various service classes are to be handled differently in order to yield their expected corresponding performance level. We investigate a mechanism that provides this service discrimina...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Tantawi, A.N.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 91 Vol.1
container_issue
container_start_page 86
container_title
container_volume 1
creator Tantawi, A.N.
description In Web services environments, classes of service are offered at different performance levels. Requests belonging to various service classes are to be handled differently in order to yield their expected corresponding performance level. We investigate a mechanism that provides this service discrimination by deploying an optimized external scheduler, as opposed to common mechanisms for prioritization and internal server scheduling. A measure of Service Performance Level (SPL) that combines target and achieved performance values is introduced. Our approach is based on simple Weighted Round-Robin (WRR) scheduling with dynamically adjustable weights that are computed by solving an integer resource allocation problem. We present experimental results, contrasting a few scheduling policies. Further, we provide an analytic queueing network model to approximate the behavior of the system, and show its effectiveness.
doi_str_mv 10.1109/ISCC.2004.1358386
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_6IE</sourceid><recordid>TN_cdi_pascalfrancis_primary_17414095</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1358386</ieee_id><sourcerecordid>17414095</sourcerecordid><originalsourceid>FETCH-LOGICAL-i205t-7b7e91fa10a764becc1daf67ce0fcbcd611e6ea34ecc698031964f603bf299863</originalsourceid><addsrcrecordid>eNpFkE9LxDAQxQMiKGs_gHjJxWPXmSZNmoMHKf5ZWNiDel7SdKKR2i1JFfXTG6ggDDyG95vh8Rg7R1gjgrnaPLbtugKQaxR1Ixp1xAqjG8iTl0rUJ6xI6Q0AUCthFJ6y6900h_fwQz2nr5niaAee3Cv1H0MYX7g_RO5tiDxR_AyOeB-Si_lgtHM4jGfs2NshUfGnK_Z8d_vUPpTb3f2mvdmWoYJ6LnWnyaC3CFYr2ZFz2FuvtCPwrnO9QiRFVsjsKJPDolHSKxCdr4xplFixy-XvZJOzg492dCHtp5zExu89aokSTJ25i4ULRPRvL2WIX8ooVWQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimized external scheduling for fair service discrimination</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Tantawi, A.N.</creator><creatorcontrib>Tantawi, A.N.</creatorcontrib><description>In Web services environments, classes of service are offered at different performance levels. Requests belonging to various service classes are to be handled differently in order to yield their expected corresponding performance level. We investigate a mechanism that provides this service discrimination by deploying an optimized external scheduler, as opposed to common mechanisms for prioritization and internal server scheduling. A measure of Service Performance Level (SPL) that combines target and achieved performance values is introduced. Our approach is based on simple Weighted Round-Robin (WRR) scheduling with dynamically adjustable weights that are computed by solving an integer resource allocation problem. We present experimental results, contrasting a few scheduling policies. Further, we provide an analytic queueing network model to approximate the behavior of the system, and show its effectiveness.</description><identifier>ISBN: 9780780386235</identifier><identifier>ISBN: 078038623X</identifier><identifier>DOI: 10.1109/ISCC.2004.1358386</identifier><language>eng</language><publisher>Los Alamitos CA: IEEE</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Fluctuations ; Hardware ; Instruments ; Kernel ; Network servers ; Processor scheduling ; Queueing analysis ; Resource management ; Software ; Traffic control ; Web services</subject><ispartof>Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769), 2004, Vol.1, p.86-91 Vol.1</ispartof><rights>2006 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1358386$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1358386$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17414095$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Tantawi, A.N.</creatorcontrib><title>Optimized external scheduling for fair service discrimination</title><title>Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)</title><addtitle>ISCC</addtitle><description>In Web services environments, classes of service are offered at different performance levels. Requests belonging to various service classes are to be handled differently in order to yield their expected corresponding performance level. We investigate a mechanism that provides this service discrimination by deploying an optimized external scheduler, as opposed to common mechanisms for prioritization and internal server scheduling. A measure of Service Performance Level (SPL) that combines target and achieved performance values is introduced. Our approach is based on simple Weighted Round-Robin (WRR) scheduling with dynamically adjustable weights that are computed by solving an integer resource allocation problem. We present experimental results, contrasting a few scheduling policies. Further, we provide an analytic queueing network model to approximate the behavior of the system, and show its effectiveness.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Fluctuations</subject><subject>Hardware</subject><subject>Instruments</subject><subject>Kernel</subject><subject>Network servers</subject><subject>Processor scheduling</subject><subject>Queueing analysis</subject><subject>Resource management</subject><subject>Software</subject><subject>Traffic control</subject><subject>Web services</subject><isbn>9780780386235</isbn><isbn>078038623X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkE9LxDAQxQMiKGs_gHjJxWPXmSZNmoMHKf5ZWNiDel7SdKKR2i1JFfXTG6ggDDyG95vh8Rg7R1gjgrnaPLbtugKQaxR1Ixp1xAqjG8iTl0rUJ6xI6Q0AUCthFJ6y6900h_fwQz2nr5niaAee3Cv1H0MYX7g_RO5tiDxR_AyOeB-Si_lgtHM4jGfs2NshUfGnK_Z8d_vUPpTb3f2mvdmWoYJ6LnWnyaC3CFYr2ZFz2FuvtCPwrnO9QiRFVsjsKJPDolHSKxCdr4xplFixy-XvZJOzg492dCHtp5zExu89aokSTJ25i4ULRPRvL2WIX8ooVWQ</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Tantawi, A.N.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Optimized external scheduling for fair service discrimination</title><author>Tantawi, A.N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i205t-7b7e91fa10a764becc1daf67ce0fcbcd611e6ea34ecc698031964f603bf299863</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Fluctuations</topic><topic>Hardware</topic><topic>Instruments</topic><topic>Kernel</topic><topic>Network servers</topic><topic>Processor scheduling</topic><topic>Queueing analysis</topic><topic>Resource management</topic><topic>Software</topic><topic>Traffic control</topic><topic>Web services</topic><toplevel>online_resources</toplevel><creatorcontrib>Tantawi, A.N.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore (Online service)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tantawi, A.N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimized external scheduling for fair service discrimination</atitle><btitle>Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)</btitle><stitle>ISCC</stitle><date>2004</date><risdate>2004</risdate><volume>1</volume><spage>86</spage><epage>91 Vol.1</epage><pages>86-91 Vol.1</pages><isbn>9780780386235</isbn><isbn>078038623X</isbn><abstract>In Web services environments, classes of service are offered at different performance levels. Requests belonging to various service classes are to be handled differently in order to yield their expected corresponding performance level. We investigate a mechanism that provides this service discrimination by deploying an optimized external scheduler, as opposed to common mechanisms for prioritization and internal server scheduling. A measure of Service Performance Level (SPL) that combines target and achieved performance values is introduced. Our approach is based on simple Weighted Round-Robin (WRR) scheduling with dynamically adjustable weights that are computed by solving an integer resource allocation problem. We present experimental results, contrasting a few scheduling policies. Further, we provide an analytic queueing network model to approximate the behavior of the system, and show its effectiveness.</abstract><cop>Los Alamitos CA</cop><pub>IEEE</pub><doi>10.1109/ISCC.2004.1358386</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9780780386235
ispartof Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769), 2004, Vol.1, p.86-91 Vol.1
issn
language eng
recordid cdi_pascalfrancis_primary_17414095
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Fluctuations
Hardware
Instruments
Kernel
Network servers
Processor scheduling
Queueing analysis
Resource management
Software
Traffic control
Web services
title Optimized external scheduling for fair service discrimination
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T15%3A18%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimized%20external%20scheduling%20for%20fair%20service%20discrimination&rft.btitle=Proceedings.%20ISCC%202004.%20Ninth%20International%20Symposium%20on%20Computers%20And%20Communications%20(IEEE%20Cat.%20No.04TH8769)&rft.au=Tantawi,%20A.N.&rft.date=2004&rft.volume=1&rft.spage=86&rft.epage=91%20Vol.1&rft.pages=86-91%20Vol.1&rft.isbn=9780780386235&rft.isbn_list=078038623X&rft_id=info:doi/10.1109/ISCC.2004.1358386&rft_dat=%3Cpascalfrancis_6IE%3E17414095%3C/pascalfrancis_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1358386&rfr_iscdi=true