A Container Service Chain Placement Greedy Algorithm Based on Heuristic Information
Container technology is a light weight back-end virtualization solution which copes with the growing demand for Internet service concurrency. Network services can be provided by a series of containers between which network requests are sent and responded. We call these cooperating containers a conta...
Gespeichert in:
| Veröffentlicht in: | Journal of physics. Conference series 2020-08, Vol.1621 (1), p.12068 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | 12068 |
| container_title | Journal of physics. Conference series |
| container_volume | 1621 |
| creator | Yue, Qiang Liu, Xiangtao Fang, Lijia Wang, Xiaoxiao Hu, Wenbin |
| description | Container technology is a light weight back-end virtualization solution which copes with the growing demand for Internet service concurrency. Network services can be provided by a series of containers between which network requests are sent and responded. We call these cooperating containers a container service chain. On a certain physical cluster, there are various available container placement of a service chain. Different container placement causes different service response time. In order to reduce the response time of container service chain, a greedy algorithm for container service chain placement is proposed based on heuristic information. Through quantitative analyzing resources provided by hosts and consumed by containers, we build a mathematic model of container service chain. We use this model to decide where to place container when service is expanded, and where to remove container when service is reduced. Our model reduced the response time of container service chains by 40% compared to average placement. |
| doi_str_mv | 10.1088/1742-6596/1621/1/012068 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_iop_j</sourceid><recordid>TN_cdi_proquest_journals_2570885033</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2570885033</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3768-2b7ff9a38602a26ef53d4839ba57b97aa9af3c62a2269993163d98a9676c5fed3</originalsourceid><addsrcrecordid>eNqFkG1LwzAQx4MoOKefwYDvhNo8rHl4OYtuE8HB9HXI2sRlrE1NOmHf3pbKRBC8N3fH_e9_3A-Aa4zuMBIixXxCEpZJlmJGcIpThAli4gSMjpPTYy3EObiIcYsQ7YKPwGoKc1-32tUmwJUJn64wMN90PVzudGEqU7dwFowpD3C6e_fBtZsK3utoSuhrODf74GLrCriorQ-Vbp2vL8GZ1btorr7zGLw9Przm8-T5ZbbIp89JQTkTCVlza6WmgiGiCTM2o-VEULnWGV9LrrXUlhasmxEmpaSY0VIKLRlnRWZNScfgZvBtgv_Ym9iqrd-HujupSMY7Nln_5RjwQVUEH2MwVjXBVTocFEaqJ6h6NqrnpHqCCquBYLd5O2w63_xYPy3z1W-hakrbiekf4v9OfAF6lX9d</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2570885033</pqid></control><display><type>article</type><title>A Container Service Chain Placement Greedy Algorithm Based on Heuristic Information</title><source>IOP Publishing Free Content</source><source>EZB-FREE-00999 freely available EZB journals</source><source>IOPscience extra</source><source>Alma/SFX Local Collection</source><source>Free Full-Text Journals in Chemistry</source><creator>Yue, Qiang ; Liu, Xiangtao ; Fang, Lijia ; Wang, Xiaoxiao ; Hu, Wenbin</creator><creatorcontrib>Yue, Qiang ; Liu, Xiangtao ; Fang, Lijia ; Wang, Xiaoxiao ; Hu, Wenbin</creatorcontrib><description>Container technology is a light weight back-end virtualization solution which copes with the growing demand for Internet service concurrency. Network services can be provided by a series of containers between which network requests are sent and responded. We call these cooperating containers a container service chain. On a certain physical cluster, there are various available container placement of a service chain. Different container placement causes different service response time. In order to reduce the response time of container service chain, a greedy algorithm for container service chain placement is proposed based on heuristic information. Through quantitative analyzing resources provided by hosts and consumed by containers, we build a mathematic model of container service chain. We use this model to decide where to place container when service is expanded, and where to remove container when service is reduced. Our model reduced the response time of container service chains by 40% compared to average placement.</description><identifier>ISSN: 1742-6588</identifier><identifier>EISSN: 1742-6596</identifier><identifier>DOI: 10.1088/1742-6596/1621/1/012068</identifier><language>eng</language><publisher>Bristol: IOP Publishing</publisher><subject>Chains ; container networks ; Container placement ; Containers ; Greedy algorithms ; Heuristic ; I/O response time ; performance modelling ; Physics ; Placement ; Response time ; Response time (computers) ; Service introduction ; Weight reduction</subject><ispartof>Journal of physics. Conference series, 2020-08, Vol.1621 (1), p.12068</ispartof><rights>Published under licence by IOP Publishing Ltd</rights><rights>2020. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3768-2b7ff9a38602a26ef53d4839ba57b97aa9af3c62a2269993163d98a9676c5fed3</citedby><cites>FETCH-LOGICAL-c3768-2b7ff9a38602a26ef53d4839ba57b97aa9af3c62a2269993163d98a9676c5fed3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://iopscience.iop.org/article/10.1088/1742-6596/1621/1/012068/pdf$$EPDF$$P50$$Giop$$Hfree_for_read</linktopdf><link.rule.ids>314,780,784,27924,27925,38868,38890,53840,53867</link.rule.ids></links><search><creatorcontrib>Yue, Qiang</creatorcontrib><creatorcontrib>Liu, Xiangtao</creatorcontrib><creatorcontrib>Fang, Lijia</creatorcontrib><creatorcontrib>Wang, Xiaoxiao</creatorcontrib><creatorcontrib>Hu, Wenbin</creatorcontrib><title>A Container Service Chain Placement Greedy Algorithm Based on Heuristic Information</title><title>Journal of physics. Conference series</title><addtitle>J. Phys.: Conf. Ser</addtitle><description>Container technology is a light weight back-end virtualization solution which copes with the growing demand for Internet service concurrency. Network services can be provided by a series of containers between which network requests are sent and responded. We call these cooperating containers a container service chain. On a certain physical cluster, there are various available container placement of a service chain. Different container placement causes different service response time. In order to reduce the response time of container service chain, a greedy algorithm for container service chain placement is proposed based on heuristic information. Through quantitative analyzing resources provided by hosts and consumed by containers, we build a mathematic model of container service chain. We use this model to decide where to place container when service is expanded, and where to remove container when service is reduced. Our model reduced the response time of container service chains by 40% compared to average placement.</description><subject>Chains</subject><subject>container networks</subject><subject>Container placement</subject><subject>Containers</subject><subject>Greedy algorithms</subject><subject>Heuristic</subject><subject>I/O response time</subject><subject>performance modelling</subject><subject>Physics</subject><subject>Placement</subject><subject>Response time</subject><subject>Response time (computers)</subject><subject>Service introduction</subject><subject>Weight reduction</subject><issn>1742-6588</issn><issn>1742-6596</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>O3W</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqFkG1LwzAQx4MoOKefwYDvhNo8rHl4OYtuE8HB9HXI2sRlrE1NOmHf3pbKRBC8N3fH_e9_3A-Aa4zuMBIixXxCEpZJlmJGcIpThAli4gSMjpPTYy3EObiIcYsQ7YKPwGoKc1-32tUmwJUJn64wMN90PVzudGEqU7dwFowpD3C6e_fBtZsK3utoSuhrODf74GLrCriorQ-Vbp2vL8GZ1btorr7zGLw9Przm8-T5ZbbIp89JQTkTCVlza6WmgiGiCTM2o-VEULnWGV9LrrXUlhasmxEmpaSY0VIKLRlnRWZNScfgZvBtgv_Ym9iqrd-HujupSMY7Nln_5RjwQVUEH2MwVjXBVTocFEaqJ6h6NqrnpHqCCquBYLd5O2w63_xYPy3z1W-hakrbiekf4v9OfAF6lX9d</recordid><startdate>20200801</startdate><enddate>20200801</enddate><creator>Yue, Qiang</creator><creator>Liu, Xiangtao</creator><creator>Fang, Lijia</creator><creator>Wang, Xiaoxiao</creator><creator>Hu, Wenbin</creator><general>IOP Publishing</general><scope>O3W</scope><scope>TSCCA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>L7M</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20200801</creationdate><title>A Container Service Chain Placement Greedy Algorithm Based on Heuristic Information</title><author>Yue, Qiang ; Liu, Xiangtao ; Fang, Lijia ; Wang, Xiaoxiao ; Hu, Wenbin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3768-2b7ff9a38602a26ef53d4839ba57b97aa9af3c62a2269993163d98a9676c5fed3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Chains</topic><topic>container networks</topic><topic>Container placement</topic><topic>Containers</topic><topic>Greedy algorithms</topic><topic>Heuristic</topic><topic>I/O response time</topic><topic>performance modelling</topic><topic>Physics</topic><topic>Placement</topic><topic>Response time</topic><topic>Response time (computers)</topic><topic>Service introduction</topic><topic>Weight reduction</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yue, Qiang</creatorcontrib><creatorcontrib>Liu, Xiangtao</creatorcontrib><creatorcontrib>Fang, Lijia</creatorcontrib><creatorcontrib>Wang, Xiaoxiao</creatorcontrib><creatorcontrib>Hu, Wenbin</creatorcontrib><collection>IOP Publishing Free Content</collection><collection>IOPscience (Open Access)</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Journal of physics. Conference series</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yue, Qiang</au><au>Liu, Xiangtao</au><au>Fang, Lijia</au><au>Wang, Xiaoxiao</au><au>Hu, Wenbin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Container Service Chain Placement Greedy Algorithm Based on Heuristic Information</atitle><jtitle>Journal of physics. Conference series</jtitle><addtitle>J. Phys.: Conf. Ser</addtitle><date>2020-08-01</date><risdate>2020</risdate><volume>1621</volume><issue>1</issue><spage>12068</spage><pages>12068-</pages><issn>1742-6588</issn><eissn>1742-6596</eissn><abstract>Container technology is a light weight back-end virtualization solution which copes with the growing demand for Internet service concurrency. Network services can be provided by a series of containers between which network requests are sent and responded. We call these cooperating containers a container service chain. On a certain physical cluster, there are various available container placement of a service chain. Different container placement causes different service response time. In order to reduce the response time of container service chain, a greedy algorithm for container service chain placement is proposed based on heuristic information. Through quantitative analyzing resources provided by hosts and consumed by containers, we build a mathematic model of container service chain. We use this model to decide where to place container when service is expanded, and where to remove container when service is reduced. Our model reduced the response time of container service chains by 40% compared to average placement.</abstract><cop>Bristol</cop><pub>IOP Publishing</pub><doi>10.1088/1742-6596/1621/1/012068</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1742-6588 |
| ispartof | Journal of physics. Conference series, 2020-08, Vol.1621 (1), p.12068 |
| issn | 1742-6588 1742-6596 |
| language | eng |
| recordid | cdi_proquest_journals_2570885033 |
| source | IOP Publishing Free Content; EZB-FREE-00999 freely available EZB journals; IOPscience extra; Alma/SFX Local Collection; Free Full-Text Journals in Chemistry |
| subjects | Chains container networks Container placement Containers Greedy algorithms Heuristic I/O response time performance modelling Physics Placement Response time Response time (computers) Service introduction Weight reduction |
| title | A Container Service Chain Placement Greedy Algorithm Based on Heuristic Information |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T07%3A44%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_iop_j&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Container%20Service%20Chain%20Placement%20Greedy%20Algorithm%20Based%20on%20Heuristic%20Information&rft.jtitle=Journal%20of%20physics.%20Conference%20series&rft.au=Yue,%20Qiang&rft.date=2020-08-01&rft.volume=1621&rft.issue=1&rft.spage=12068&rft.pages=12068-&rft.issn=1742-6588&rft.eissn=1742-6596&rft_id=info:doi/10.1088/1742-6596/1621/1/012068&rft_dat=%3Cproquest_iop_j%3E2570885033%3C/proquest_iop_j%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2570885033&rft_id=info:pmid/&rfr_iscdi=true |