Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks
This paper deals with the admission of flows with bounded delay and bounded arrivals in a rate-controlled network (more precisely, a network with nodes using rate-controlled service disciplines with the earliest deadline first as the scheduling algorithm). It focuses on an important function of flow...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| 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 | 311 |
|---|---|
| container_issue | |
| container_start_page | 304 |
| container_title | |
| container_volume | |
| creator | Abdellatif, S. Juanole, G. |
| description | This paper deals with the admission of flows with bounded delay and bounded arrivals in a rate-controlled network (more precisely, a network with nodes using rate-controlled service disciplines with the earliest deadline first as the scheduling algorithm). It focuses on an important function of flow admission that has a straight impact on flow admissibility, more precisely, choosing the traffic envelope functions of the rate-controllers traversed by a flow. We present in this paper a method for choosing these envelopes which compared to previous work improves flow admissibility. Then, we show its efficiency through an example. |
| doi_str_mv | 10.1109/EUROMICRO.2005.31 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1517755</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1517755</ieee_id><sourcerecordid>1517755</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-ba0ce9f77fc91ffdfe0e3b39672d86aa0019e026ac936c9438a65c9b7172d03d3</originalsourceid><addsrcrecordid>eNo9jNFKwzAYRgMiKHMPIN7kBTqTZmmaSxlTB5PCcNcjTf64uDaZSbZR8OEtKH43Bz4OB6F7SmaUEvm43G6at9Vi08xKQviM0Ss0laImopK8nDPKbtA0pU8ybs4pLctb9L3qjzGcnf_AeQ9Ymd6l5FrXuTzgYLHtwiXhi8t73IaTN2CwitGdVZew8ub_NNCpAUf4OrkIPficsPM4qgyFDj7H0HWjdVT6ABl7yJcQD-kOXdsxBNM_TtD2efm-eC3Wzctq8bQuHBU8F60iGqQVwmpJrTUWCLCWyUqUpq6UIoRKIGWltGSVlnNWq4pr2Qo6CoQZNkEPv10HALtjdL2Kw45yKgTn7AcKL2DG</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Abdellatif, S. ; Juanole, G.</creator><creatorcontrib>Abdellatif, S. ; Juanole, G.</creatorcontrib><description>This paper deals with the admission of flows with bounded delay and bounded arrivals in a rate-controlled network (more precisely, a network with nodes using rate-controlled service disciplines with the earliest deadline first as the scheduling algorithm). It focuses on an important function of flow admission that has a straight impact on flow admissibility, more precisely, choosing the traffic envelope functions of the rate-controllers traversed by a flow. We present in this paper a method for choosing these envelopes which compared to previous work improves flow admissibility. Then, we show its efficiency through an example.</description><identifier>ISBN: 9780769524313</identifier><identifier>ISBN: 0769524311</identifier><identifier>DOI: 10.1109/EUROMICRO.2005.31</identifier><language>eng</language><publisher>IEEE</publisher><subject>Admission control ; Communication system traffic control ; Delay effects ; Equations ; Intelligent networks ; Processor scheduling ; Resource management ; Scheduling algorithm ; Telecommunication traffic ; Upper bound</subject><ispartof>31st EUROMICRO Conference on Software Engineering and Advanced Applications, 2005, p.304-311</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/1517755$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1517755$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Abdellatif, S.</creatorcontrib><creatorcontrib>Juanole, G.</creatorcontrib><title>Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks</title><title>31st EUROMICRO Conference on Software Engineering and Advanced Applications</title><addtitle>EURMIC</addtitle><description>This paper deals with the admission of flows with bounded delay and bounded arrivals in a rate-controlled network (more precisely, a network with nodes using rate-controlled service disciplines with the earliest deadline first as the scheduling algorithm). It focuses on an important function of flow admission that has a straight impact on flow admissibility, more precisely, choosing the traffic envelope functions of the rate-controllers traversed by a flow. We present in this paper a method for choosing these envelopes which compared to previous work improves flow admissibility. Then, we show its efficiency through an example.</description><subject>Admission control</subject><subject>Communication system traffic control</subject><subject>Delay effects</subject><subject>Equations</subject><subject>Intelligent networks</subject><subject>Processor scheduling</subject><subject>Resource management</subject><subject>Scheduling algorithm</subject><subject>Telecommunication traffic</subject><subject>Upper bound</subject><isbn>9780769524313</isbn><isbn>0769524311</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9jNFKwzAYRgMiKHMPIN7kBTqTZmmaSxlTB5PCcNcjTf64uDaZSbZR8OEtKH43Bz4OB6F7SmaUEvm43G6at9Vi08xKQviM0Ss0laImopK8nDPKbtA0pU8ybs4pLctb9L3qjzGcnf_AeQ9Ymd6l5FrXuTzgYLHtwiXhi8t73IaTN2CwitGdVZew8ub_NNCpAUf4OrkIPficsPM4qgyFDj7H0HWjdVT6ABl7yJcQD-kOXdsxBNM_TtD2efm-eC3Wzctq8bQuHBU8F60iGqQVwmpJrTUWCLCWyUqUpq6UIoRKIGWltGSVlnNWq4pr2Qo6CoQZNkEPv10HALtjdL2Kw45yKgTn7AcKL2DG</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Abdellatif, S.</creator><creator>Juanole, G.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks</title><author>Abdellatif, S. ; Juanole, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-ba0ce9f77fc91ffdfe0e3b39672d86aa0019e026ac936c9438a65c9b7172d03d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Admission control</topic><topic>Communication system traffic control</topic><topic>Delay effects</topic><topic>Equations</topic><topic>Intelligent networks</topic><topic>Processor scheduling</topic><topic>Resource management</topic><topic>Scheduling algorithm</topic><topic>Telecommunication traffic</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Abdellatif, S.</creatorcontrib><creatorcontrib>Juanole, G.</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>Abdellatif, S.</au><au>Juanole, G.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks</atitle><btitle>31st EUROMICRO Conference on Software Engineering and Advanced Applications</btitle><stitle>EURMIC</stitle><date>2005</date><risdate>2005</risdate><spage>304</spage><epage>311</epage><pages>304-311</pages><isbn>9780769524313</isbn><isbn>0769524311</isbn><abstract>This paper deals with the admission of flows with bounded delay and bounded arrivals in a rate-controlled network (more precisely, a network with nodes using rate-controlled service disciplines with the earliest deadline first as the scheduling algorithm). It focuses on an important function of flow admission that has a straight impact on flow admissibility, more precisely, choosing the traffic envelope functions of the rate-controllers traversed by a flow. We present in this paper a method for choosing these envelopes which compared to previous work improves flow admissibility. Then, we show its efficiency through an example.</abstract><pub>IEEE</pub><doi>10.1109/EUROMICRO.2005.31</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780769524313 |
| ispartof | 31st EUROMICRO Conference on Software Engineering and Advanced Applications, 2005, p.304-311 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_1517755 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Admission control Communication system traffic control Delay effects Equations Intelligent networks Processor scheduling Resource management Scheduling algorithm Telecommunication traffic Upper bound |
| title | Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T15%3A56%3A46IST&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=Improving%20the%20admissibility%20of%20flows%20with%20bounded%20arrivals%20and%20bounded%20delay%20requirements%20in%20rate-controlled%20packet%20networks&rft.btitle=31st%20EUROMICRO%20Conference%20on%20Software%20Engineering%20and%20Advanced%20Applications&rft.au=Abdellatif,%20S.&rft.date=2005&rft.spage=304&rft.epage=311&rft.pages=304-311&rft.isbn=9780769524313&rft.isbn_list=0769524311&rft_id=info:doi/10.1109/EUROMICRO.2005.31&rft_dat=%3Cieee_6IE%3E1517755%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=1517755&rfr_iscdi=true |