Ballot theorems applied to the transient analysis of nD/D/1 queues
The problem of transporting constant-bit-rate (CBR) traffic through a packet network is analyzed. In the system considered, CBR traffic is packetized and packets from several similar sources are multiplexed on a transmission link. The bit streams are recreated at the receiving end by demultiplexing...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM transactions on networking 1993-02, Vol.1 (1), p.81-95 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 95 |
|---|---|
| container_issue | 1 |
| container_start_page | 81 |
| container_title | IEEE/ACM transactions on networking |
| container_volume | 1 |
| creator | Humblet, P. Bhargava, A. Hluchyj, M.G. |
| description | The problem of transporting constant-bit-rate (CBR) traffic through a packet network is analyzed. In the system considered, CBR traffic is packetized and packets from several similar sources are multiplexed on a transmission link. The bit streams are recreated at the receiving end by demultiplexing the packets and then playing out the packets of each CBR stream. Traffic fluctuations may cause gaps to appear in the playout process. Their frequency can be reduced by adding a smoothing delay to each stream. The queueing system analyzed has periodic arrivals and deterministic service times. A method of analysis, based on the ballot theorems of Takacs (1967), is presented to provide steady-state delay distributions as well as a transient analysis of the system to predict the statistics of the time for a gap to develop in the CBR stream as a function of the smoothing delay.< > |
| doi_str_mv | 10.1109/90.222909 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_222909</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>222909</ieee_id><sourcerecordid>25957951</sourcerecordid><originalsourceid>FETCH-LOGICAL-c405t-14fd42878f71e6abf5d239f11b4d7497f7b06f531a1b5c7c8621cd15c888f73e3</originalsourceid><addsrcrecordid>eNqN0DtPwzAQAGALgUQpDKxMnpAY0voc27FH2vKSKrHAbDnJWQSlcbDTof-eoFSsMN3p7rs76Qi5BrYAYGZp2IJzbpg5ITOQUmdcKnU65kzlmVKGn5OLlD4Zg5xxNSOrlWvbMNDhA0PEXaKu79sGazqEnxodoutSg91AXefaQ2oSDZ52m-VmCfRrj3tMl-TMuzbh1THOyfvjw9v6Odu-Pr2s77dZJZgcMhC-FlwX2heAypVe1jw3HqAUdSFM4YuSKS9zcFDKqqi04lDVICutx5Ec8zm5nfb2MYyX02B3TaqwbV2HYZ8sH6HQxvwDggYw4m8ojSyMhBHeTbCKIaWI3vax2bl4sMDsz9-tYXb6-2hvJtsg4q87Nr8BGFF7ew</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25957951</pqid></control><display><type>article</type><title>Ballot theorems applied to the transient analysis of nD/D/1 queues</title><source>IEEE Electronic Library (IEL)</source><creator>Humblet, P. ; Bhargava, A. ; Hluchyj, M.G.</creator><creatorcontrib>Humblet, P. ; Bhargava, A. ; Hluchyj, M.G.</creatorcontrib><description>The problem of transporting constant-bit-rate (CBR) traffic through a packet network is analyzed. In the system considered, CBR traffic is packetized and packets from several similar sources are multiplexed on a transmission link. The bit streams are recreated at the receiving end by demultiplexing the packets and then playing out the packets of each CBR stream. Traffic fluctuations may cause gaps to appear in the playout process. Their frequency can be reduced by adding a smoothing delay to each stream. The queueing system analyzed has periodic arrivals and deterministic service times. A method of analysis, based on the ballot theorems of Takacs (1967), is presented to provide steady-state delay distributions as well as a transient analysis of the system to predict the statistics of the time for a gap to develop in the CBR stream as a function of the smoothing delay.< ></description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/90.222909</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>IEEE</publisher><subject>Added delay ; Delay effects ; Demultiplexing ; Fluctuations ; Frequency ; Queueing analysis ; Smoothing methods ; Telecommunication traffic ; Traffic control ; Transient analysis</subject><ispartof>IEEE/ACM transactions on networking, 1993-02, Vol.1 (1), p.81-95</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c405t-14fd42878f71e6abf5d239f11b4d7497f7b06f531a1b5c7c8621cd15c888f73e3</citedby><cites>FETCH-LOGICAL-c405t-14fd42878f71e6abf5d239f11b4d7497f7b06f531a1b5c7c8621cd15c888f73e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/222909$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/222909$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Humblet, P.</creatorcontrib><creatorcontrib>Bhargava, A.</creatorcontrib><creatorcontrib>Hluchyj, M.G.</creatorcontrib><title>Ballot theorems applied to the transient analysis of nD/D/1 queues</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>The problem of transporting constant-bit-rate (CBR) traffic through a packet network is analyzed. In the system considered, CBR traffic is packetized and packets from several similar sources are multiplexed on a transmission link. The bit streams are recreated at the receiving end by demultiplexing the packets and then playing out the packets of each CBR stream. Traffic fluctuations may cause gaps to appear in the playout process. Their frequency can be reduced by adding a smoothing delay to each stream. The queueing system analyzed has periodic arrivals and deterministic service times. A method of analysis, based on the ballot theorems of Takacs (1967), is presented to provide steady-state delay distributions as well as a transient analysis of the system to predict the statistics of the time for a gap to develop in the CBR stream as a function of the smoothing delay.< ></description><subject>Added delay</subject><subject>Delay effects</subject><subject>Demultiplexing</subject><subject>Fluctuations</subject><subject>Frequency</subject><subject>Queueing analysis</subject><subject>Smoothing methods</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><subject>Transient analysis</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><recordid>eNqN0DtPwzAQAGALgUQpDKxMnpAY0voc27FH2vKSKrHAbDnJWQSlcbDTof-eoFSsMN3p7rs76Qi5BrYAYGZp2IJzbpg5ITOQUmdcKnU65kzlmVKGn5OLlD4Zg5xxNSOrlWvbMNDhA0PEXaKu79sGazqEnxodoutSg91AXefaQ2oSDZ52m-VmCfRrj3tMl-TMuzbh1THOyfvjw9v6Odu-Pr2s77dZJZgcMhC-FlwX2heAypVe1jw3HqAUdSFM4YuSKS9zcFDKqqi04lDVICutx5Ec8zm5nfb2MYyX02B3TaqwbV2HYZ8sH6HQxvwDggYw4m8ojSyMhBHeTbCKIaWI3vax2bl4sMDsz9-tYXb6-2hvJtsg4q87Nr8BGFF7ew</recordid><startdate>19930201</startdate><enddate>19930201</enddate><creator>Humblet, P.</creator><creator>Bhargava, A.</creator><creator>Hluchyj, M.G.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19930201</creationdate><title>Ballot theorems applied to the transient analysis of nD/D/1 queues</title><author>Humblet, P. ; Bhargava, A. ; Hluchyj, M.G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c405t-14fd42878f71e6abf5d239f11b4d7497f7b06f531a1b5c7c8621cd15c888f73e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Added delay</topic><topic>Delay effects</topic><topic>Demultiplexing</topic><topic>Fluctuations</topic><topic>Frequency</topic><topic>Queueing analysis</topic><topic>Smoothing methods</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><topic>Transient analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Humblet, P.</creatorcontrib><creatorcontrib>Bhargava, A.</creatorcontrib><creatorcontrib>Hluchyj, M.G.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Humblet, P.</au><au>Bhargava, A.</au><au>Hluchyj, M.G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Ballot theorems applied to the transient analysis of nD/D/1 queues</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>1993-02-01</date><risdate>1993</risdate><volume>1</volume><issue>1</issue><spage>81</spage><epage>95</epage><pages>81-95</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>The problem of transporting constant-bit-rate (CBR) traffic through a packet network is analyzed. In the system considered, CBR traffic is packetized and packets from several similar sources are multiplexed on a transmission link. The bit streams are recreated at the receiving end by demultiplexing the packets and then playing out the packets of each CBR stream. Traffic fluctuations may cause gaps to appear in the playout process. Their frequency can be reduced by adding a smoothing delay to each stream. The queueing system analyzed has periodic arrivals and deterministic service times. A method of analysis, based on the ballot theorems of Takacs (1967), is presented to provide steady-state delay distributions as well as a transient analysis of the system to predict the statistics of the time for a gap to develop in the CBR stream as a function of the smoothing delay.< ></abstract><pub>IEEE</pub><doi>10.1109/90.222909</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6692 |
| ispartof | IEEE/ACM transactions on networking, 1993-02, Vol.1 (1), p.81-95 |
| issn | 1063-6692 1558-2566 |
| language | eng |
| recordid | cdi_ieee_primary_222909 |
| source | IEEE Electronic Library (IEL) |
| subjects | Added delay Delay effects Demultiplexing Fluctuations Frequency Queueing analysis Smoothing methods Telecommunication traffic Traffic control Transient analysis |
| title | Ballot theorems applied to the transient analysis of nD/D/1 queues |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T23%3A19%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Ballot%20theorems%20applied%20to%20the%20transient%20analysis%20of%20nD/D/1%20queues&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Humblet,%20P.&rft.date=1993-02-01&rft.volume=1&rft.issue=1&rft.spage=81&rft.epage=95&rft.pages=81-95&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/90.222909&rft_dat=%3Cproquest_RIE%3E25957951%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=25957951&rft_id=info:pmid/&rft_ieee_id=222909&rfr_iscdi=true |