On Stability and Sojourn Time of Peer-to-Peer Queuing Systems
Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current study on these models focuses on the stability condition, u...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2016-05 |
|---|---|
| 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 | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Li, Taoyu Chen, Minghua Lee, Tony Li, Xing |
| description | Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current study on these models focuses on the stability condition, under exponential workload assumption. This paper extends existing result in two aspects. In the first part of the paper we relax the exponential workload assumption, and study the stability of systems with general workload distribution. The second part of the paper focuses on the job sojourn time. An upper bound and a lower bound for job sojourn time are investigated. We evaluate tightness of the bounds by numerical analysis. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2079805323</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2079805323</sourcerecordid><originalsourceid>FETCH-proquest_journals_20798053233</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSw9c9TCC5JTMrMySypVEjMS1EIzs_KLy3KUwjJzE1VyE9TCEhNLdItydcF0QqBpamlmXnpCsGVxSWpucU8DKxpiTnFqbxQmptB2c01xNlDt6Aov7A0tbgkHmwWUCreyMDc0sLA1BjoFuJUAQAa_Dc0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2079805323</pqid></control><display><type>article</type><title>On Stability and Sojourn Time of Peer-to-Peer Queuing Systems</title><source>Free E- Journals</source><creator>Li, Taoyu ; Chen, Minghua ; Lee, Tony ; Li, Xing</creator><creatorcontrib>Li, Taoyu ; Chen, Minghua ; Lee, Tony ; Li, Xing</creatorcontrib><description>Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current study on these models focuses on the stability condition, under exponential workload assumption. This paper extends existing result in two aspects. In the first part of the paper we relax the exponential workload assumption, and study the stability of systems with general workload distribution. The second part of the paper focuses on the job sojourn time. An upper bound and a lower bound for job sojourn time are investigated. We evaluate tightness of the bounds by numerical analysis.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Lower bounds ; Markov analysis ; Mathematical models ; Numerical analysis ; Queues ; Queuing theory ; Stability ; Tightness ; Upper bounds ; Workload ; Workloads</subject><ispartof>arXiv.org, 2016-05</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Li, Taoyu</creatorcontrib><creatorcontrib>Chen, Minghua</creatorcontrib><creatorcontrib>Lee, Tony</creatorcontrib><creatorcontrib>Li, Xing</creatorcontrib><title>On Stability and Sojourn Time of Peer-to-Peer Queuing Systems</title><title>arXiv.org</title><description>Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current study on these models focuses on the stability condition, under exponential workload assumption. This paper extends existing result in two aspects. In the first part of the paper we relax the exponential workload assumption, and study the stability of systems with general workload distribution. The second part of the paper focuses on the job sojourn time. An upper bound and a lower bound for job sojourn time are investigated. We evaluate tightness of the bounds by numerical analysis.</description><subject>Lower bounds</subject><subject>Markov analysis</subject><subject>Mathematical models</subject><subject>Numerical analysis</subject><subject>Queues</subject><subject>Queuing theory</subject><subject>Stability</subject><subject>Tightness</subject><subject>Upper bounds</subject><subject>Workload</subject><subject>Workloads</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSw9c9TCC5JTMrMySypVEjMS1EIzs_KLy3KUwjJzE1VyE9TCEhNLdItydcF0QqBpamlmXnpCsGVxSWpucU8DKxpiTnFqbxQmptB2c01xNlDt6Aov7A0tbgkHmwWUCreyMDc0sLA1BjoFuJUAQAa_Dc0</recordid><startdate>20160510</startdate><enddate>20160510</enddate><creator>Li, Taoyu</creator><creator>Chen, Minghua</creator><creator>Lee, Tony</creator><creator>Li, Xing</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160510</creationdate><title>On Stability and Sojourn Time of Peer-to-Peer Queuing Systems</title><author>Li, Taoyu ; Chen, Minghua ; Lee, Tony ; Li, Xing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20798053233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Lower bounds</topic><topic>Markov analysis</topic><topic>Mathematical models</topic><topic>Numerical analysis</topic><topic>Queues</topic><topic>Queuing theory</topic><topic>Stability</topic><topic>Tightness</topic><topic>Upper bounds</topic><topic>Workload</topic><topic>Workloads</topic><toplevel>online_resources</toplevel><creatorcontrib>Li, Taoyu</creatorcontrib><creatorcontrib>Chen, Minghua</creatorcontrib><creatorcontrib>Lee, Tony</creatorcontrib><creatorcontrib>Li, Xing</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</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>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</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><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Taoyu</au><au>Chen, Minghua</au><au>Lee, Tony</au><au>Li, Xing</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>On Stability and Sojourn Time of Peer-to-Peer Queuing Systems</atitle><jtitle>arXiv.org</jtitle><date>2016-05-10</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current study on these models focuses on the stability condition, under exponential workload assumption. This paper extends existing result in two aspects. In the first part of the paper we relax the exponential workload assumption, and study the stability of systems with general workload distribution. The second part of the paper focuses on the job sojourn time. An upper bound and a lower bound for job sojourn time are investigated. We evaluate tightness of the bounds by numerical analysis.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2016-05 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2079805323 |
| source | Free E- Journals |
| subjects | Lower bounds Markov analysis Mathematical models Numerical analysis Queues Queuing theory Stability Tightness Upper bounds Workload Workloads |
| title | On Stability and Sojourn Time of Peer-to-Peer Queuing Systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T05%3A08%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=On%20Stability%20and%20Sojourn%20Time%20of%20Peer-to-Peer%20Queuing%20Systems&rft.jtitle=arXiv.org&rft.au=Li,%20Taoyu&rft.date=2016-05-10&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2079805323%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2079805323&rft_id=info:pmid/&rfr_iscdi=true |