On the queueing behavior of multiplexed leaky bucket regulated sources

The leaky bucket algorithm, which has been proposed as a monitor/enforcer in the rate-based management of bandwidth in high-performance, integrated packet communication networks, is considered. The effectiveness of the unbuffered leaky bucket algorithm in protecting the quality of service (QOS) expe...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Hluchyj, M.G., Yin, N.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Asynchronous transfer mode Bandwidth Communication networks Monitoring Protection Quality of service Relays Telecommunication traffic Throughput Traffic control
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	679 vol.2
container_issue
container_start_page	672
container_title
container_volume
creator	Hluchyj, M.G. Yin, N.
description	The leaky bucket algorithm, which has been proposed as a monitor/enforcer in the rate-based management of bandwidth in high-performance, integrated packet communication networks, is considered. The effectiveness of the unbuffered leaky bucket algorithm in protecting the quality of service (QOS) experienced by connections passing through a common internodal link queue is studied. It is shown that excess traffic generated by a source can pass through the leaky bucket without marked or discarded and cause unacceptable packet delay/loss to other connections sharing the queue. It is also shown that average bursts that are larger, or average rate that is higher, than that assumed at connection establishment can deteriorate the queue performance even with the leaky bucket enforcing the agreed throughput QOS by discarding packets. On the basis of this analysis, a strategy for alleviating these problems is devised, namely, allocating network bandwidth above the leaky bucket permit rate and configuring the leaky bucket with a loss/mark probability greater than 10/sup -2/.< >
doi_str_mv	10.1109/INFCOM.1993.253304
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_253304</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>253304</ieee_id><sourcerecordid>253304</sourcerecordid><originalsourceid>FETCH-LOGICAL-i87t-2960028c24161a47a9bf66ddb294774cfebb55610690d7f6162eb1a8041d193c3</originalsourceid><addsrcrecordid>eNotj11LwzAYRgMiKLN_YFf5A615kzQfl1KsDqa92f1I2rdbXLfOtBH37x3M5-bAuTjwELIEVgAw-7z6rKvmowBrRcFLIZi8I5nVhhkwSpSG2QeSTdMXu06WwBV_JHVzovMe6XfChOG0ox737ieMkY49PaZhDucBf7GjA7rDhfrUHnCmEXdpcPNVT2OKLU5P5L53w4TZPxdkU79uqvd83bytqpd1Hoyec24VY9y0XIICJ7Wzvleq6zy3UmvZ9uh9WSpgyrJO9woURw_OMAkdWNGKBVnesgERt-cYji5etrev4g9qe0oV</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the queueing behavior of multiplexed leaky bucket regulated sources</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hluchyj, M.G. ; Yin, N.</creator><creatorcontrib>Hluchyj, M.G. ; Yin, N.</creatorcontrib><description>The leaky bucket algorithm, which has been proposed as a monitor/enforcer in the rate-based management of bandwidth in high-performance, integrated packet communication networks, is considered. The effectiveness of the unbuffered leaky bucket algorithm in protecting the quality of service (QOS) experienced by connections passing through a common internodal link queue is studied. It is shown that excess traffic generated by a source can pass through the leaky bucket without marked or discarded and cause unacceptable packet delay/loss to other connections sharing the queue. It is also shown that average bursts that are larger, or average rate that is higher, than that assumed at connection establishment can deteriorate the queue performance even with the leaky bucket enforcing the agreed throughput QOS by discarding packets. On the basis of this analysis, a strategy for alleviating these problems is devised, namely, allocating network bandwidth above the leaky bucket permit rate and configuring the leaky bucket with a loss/mark probability greater than 10/sup -2/.< ></description><identifier>ISBN: 9780818635809</identifier><identifier>ISBN: 0818635800</identifier><identifier>DOI: 10.1109/INFCOM.1993.253304</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Asynchronous transfer mode ; Bandwidth ; Communication networks ; Monitoring ; Protection ; Quality of service ; Relays ; Telecommunication traffic ; Throughput ; Traffic control</subject><ispartof>IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings, 1993, p.672-679 vol.2</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/253304$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/253304$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hluchyj, M.G.</creatorcontrib><creatorcontrib>Yin, N.</creatorcontrib><title>On the queueing behavior of multiplexed leaky bucket regulated sources</title><title>IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings</title><addtitle>INFCOM</addtitle><description>The leaky bucket algorithm, which has been proposed as a monitor/enforcer in the rate-based management of bandwidth in high-performance, integrated packet communication networks, is considered. The effectiveness of the unbuffered leaky bucket algorithm in protecting the quality of service (QOS) experienced by connections passing through a common internodal link queue is studied. It is shown that excess traffic generated by a source can pass through the leaky bucket without marked or discarded and cause unacceptable packet delay/loss to other connections sharing the queue. It is also shown that average bursts that are larger, or average rate that is higher, than that assumed at connection establishment can deteriorate the queue performance even with the leaky bucket enforcing the agreed throughput QOS by discarding packets. On the basis of this analysis, a strategy for alleviating these problems is devised, namely, allocating network bandwidth above the leaky bucket permit rate and configuring the leaky bucket with a loss/mark probability greater than 10/sup -2/.< ></description><subject>Asynchronous transfer mode</subject><subject>Bandwidth</subject><subject>Communication networks</subject><subject>Monitoring</subject><subject>Protection</subject><subject>Quality of service</subject><subject>Relays</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Traffic control</subject><isbn>9780818635809</isbn><isbn>0818635800</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1993</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj11LwzAYRgMiKLN_YFf5A615kzQfl1KsDqa92f1I2rdbXLfOtBH37x3M5-bAuTjwELIEVgAw-7z6rKvmowBrRcFLIZi8I5nVhhkwSpSG2QeSTdMXu06WwBV_JHVzovMe6XfChOG0ox737ieMkY49PaZhDucBf7GjA7rDhfrUHnCmEXdpcPNVT2OKLU5P5L53w4TZPxdkU79uqvd83bytqpd1Hoyec24VY9y0XIICJ7Wzvleq6zy3UmvZ9uh9WSpgyrJO9woURw_OMAkdWNGKBVnesgERt-cYji5etrev4g9qe0oV</recordid><startdate>1993</startdate><enddate>1993</enddate><creator>Hluchyj, M.G.</creator><creator>Yin, N.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1993</creationdate><title>On the queueing behavior of multiplexed leaky bucket regulated sources</title><author>Hluchyj, M.G. ; Yin, N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i87t-2960028c24161a47a9bf66ddb294774cfebb55610690d7f6162eb1a8041d193c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Asynchronous transfer mode</topic><topic>Bandwidth</topic><topic>Communication networks</topic><topic>Monitoring</topic><topic>Protection</topic><topic>Quality of service</topic><topic>Relays</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Hluchyj, M.G.</creatorcontrib><creatorcontrib>Yin, 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 Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hluchyj, M.G.</au><au>Yin, N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the queueing behavior of multiplexed leaky bucket regulated sources</atitle><btitle>IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings</btitle><stitle>INFCOM</stitle><date>1993</date><risdate>1993</risdate><spage>672</spage><epage>679 vol.2</epage><pages>672-679 vol.2</pages><isbn>9780818635809</isbn><isbn>0818635800</isbn><abstract>The leaky bucket algorithm, which has been proposed as a monitor/enforcer in the rate-based management of bandwidth in high-performance, integrated packet communication networks, is considered. The effectiveness of the unbuffered leaky bucket algorithm in protecting the quality of service (QOS) experienced by connections passing through a common internodal link queue is studied. It is shown that excess traffic generated by a source can pass through the leaky bucket without marked or discarded and cause unacceptable packet delay/loss to other connections sharing the queue. It is also shown that average bursts that are larger, or average rate that is higher, than that assumed at connection establishment can deteriorate the queue performance even with the leaky bucket enforcing the agreed throughput QOS by discarding packets. On the basis of this analysis, a strategy for alleviating these problems is devised, namely, allocating network bandwidth above the leaky bucket permit rate and configuring the leaky bucket with a loss/mark probability greater than 10/sup -2/.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/INFCOM.1993.253304</doi></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9780818635809
ispartof	IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings, 1993, p.672-679 vol.2
issn
language	eng
recordid	cdi_ieee_primary_253304
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Asynchronous transfer mode Bandwidth Communication networks Monitoring Protection Quality of service Relays Telecommunication traffic Throughput Traffic control
title	On the queueing behavior of multiplexed leaky bucket regulated sources
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T07%3A56%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20queueing%20behavior%20of%20multiplexed%20leaky%20bucket%20regulated%20sources&rft.btitle=IEEE%20INFOCOM%20'93%20The%20Conference%20on%20Computer%20Communications,%20Proceedings&rft.au=Hluchyj,%20M.G.&rft.date=1993&rft.spage=672&rft.epage=679%20vol.2&rft.pages=672-679%20vol.2&rft.isbn=9780818635809&rft.isbn_list=0818635800&rft_id=info:doi/10.1109/INFCOM.1993.253304&rft_dat=%3Cieee_6IE%3E253304%3C/ieee_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=253304&rfr_iscdi=true