A fair and cost-effective service mechanism for cell scheduling in ATM networks

In order to schedule cells fairly and cost-effectively in ATM networks, this paper develops a new type of fair service referred to as fair-base-weighted round robin (FWRR). It combines well the fairness of an ideal fair service with the simplicity of a typical round robin (RR) service such that it c...

Full description

Saved in:
Bibliographic Details
Main Authors: Dongnian Cheng, Zengji Liu
Format: Conference Proceeding
Language:English
Subjects:
Analytical models
Bandwidth
Delay
Dynamic scheduling
Electronic mail
Intelligent networks
Intserv networks
Performance analysis
Processor scheduling
Round robin
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 231 vol.1
container_issue
container_start_page 227
container_title
container_volume 1
creator Dongnian Cheng
Zengji Liu
description In order to schedule cells fairly and cost-effectively in ATM networks, this paper develops a new type of fair service referred to as fair-base-weighted round robin (FWRR). It combines well the fairness of an ideal fair service with the simplicity of a typical round robin (RR) service such that it can offer fair service to all connections over each "fair cycle", with flexible operations and low expense close to that of a typical RR. We show that FWRR possesses fairness over each of fair cycles. Also, we analyze its worst-case fairness, upper bound of cell delay, and complexity. Numerical results obtained from simulation further support the analysis, with two main conclusions that FWRR can not only offer better fairness but present lower cell delay bound to higher-speed connections than carry-over round robin.
doi_str_mv 10.1109/ICCT.2000.889204
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_889204</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>889204</ieee_id><sourcerecordid>889204</sourcerecordid><originalsourceid>FETCH-LOGICAL-i174t-b2b18654053f03cba4eeaf9f044537bee9d7a8879a286303366e2d5f7cb8bd2c3</originalsourceid><addsrcrecordid>eNotj0tLAzEURgMiKLV7cZU_MGMmN5PHchh8FCrdjOuSZG5sdB6SjBX_vYUWPjiLAwc-Qu4rVlYVM4-btu1KzhgrtTaciSuyNkqz00CCEfKGrHP-PHkGBpRQt2TX0GBjonbqqZ_zUmAI6Jd4RJoxHaNHOqI_2CnmkYY5UY_DQLM_YP8zxOmDxok23RudcPmd01e-I9fBDhnXF67I-_NT174W293Lpm22RayUWArHXaVlLVgNgYF3ViDaYAITogblEE2vrNbKWK4lMAApkfd1UN5p13MPK_Jw7kZE3H-nONr0tz-_hn_I6E0R</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A fair and cost-effective service mechanism for cell scheduling in ATM networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Dongnian Cheng ; Zengji Liu</creator><creatorcontrib>Dongnian Cheng ; Zengji Liu</creatorcontrib><description>In order to schedule cells fairly and cost-effectively in ATM networks, this paper develops a new type of fair service referred to as fair-base-weighted round robin (FWRR). It combines well the fairness of an ideal fair service with the simplicity of a typical round robin (RR) service such that it can offer fair service to all connections over each "fair cycle", with flexible operations and low expense close to that of a typical RR. We show that FWRR possesses fairness over each of fair cycles. Also, we analyze its worst-case fairness, upper bound of cell delay, and complexity. Numerical results obtained from simulation further support the analysis, with two main conclusions that FWRR can not only offer better fairness but present lower cell delay bound to higher-speed connections than carry-over round robin.</description><identifier>ISBN: 9780780363946</identifier><identifier>ISBN: 0780363949</identifier><identifier>DOI: 10.1109/ICCT.2000.889204</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Bandwidth ; Delay ; Dynamic scheduling ; Electronic mail ; Intelligent networks ; Intserv networks ; Performance analysis ; Processor scheduling ; Round robin</subject><ispartof>WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420), 2000, Vol.1, p.227-231 vol.1</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/889204$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/889204$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Dongnian Cheng</creatorcontrib><creatorcontrib>Zengji Liu</creatorcontrib><title>A fair and cost-effective service mechanism for cell scheduling in ATM networks</title><title>WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420)</title><addtitle>ICCT</addtitle><description>In order to schedule cells fairly and cost-effectively in ATM networks, this paper develops a new type of fair service referred to as fair-base-weighted round robin (FWRR). It combines well the fairness of an ideal fair service with the simplicity of a typical round robin (RR) service such that it can offer fair service to all connections over each "fair cycle", with flexible operations and low expense close to that of a typical RR. We show that FWRR possesses fairness over each of fair cycles. Also, we analyze its worst-case fairness, upper bound of cell delay, and complexity. Numerical results obtained from simulation further support the analysis, with two main conclusions that FWRR can not only offer better fairness but present lower cell delay bound to higher-speed connections than carry-over round robin.</description><subject>Analytical models</subject><subject>Bandwidth</subject><subject>Delay</subject><subject>Dynamic scheduling</subject><subject>Electronic mail</subject><subject>Intelligent networks</subject><subject>Intserv networks</subject><subject>Performance analysis</subject><subject>Processor scheduling</subject><subject>Round robin</subject><isbn>9780780363946</isbn><isbn>0780363949</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2000</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj0tLAzEURgMiKLV7cZU_MGMmN5PHchh8FCrdjOuSZG5sdB6SjBX_vYUWPjiLAwc-Qu4rVlYVM4-btu1KzhgrtTaciSuyNkqz00CCEfKGrHP-PHkGBpRQt2TX0GBjonbqqZ_zUmAI6Jd4RJoxHaNHOqI_2CnmkYY5UY_DQLM_YP8zxOmDxok23RudcPmd01e-I9fBDhnXF67I-_NT174W293Lpm22RayUWArHXaVlLVgNgYF3ViDaYAITogblEE2vrNbKWK4lMAApkfd1UN5p13MPK_Jw7kZE3H-nONr0tz-_hn_I6E0R</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Dongnian Cheng</creator><creator>Zengji Liu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2000</creationdate><title>A fair and cost-effective service mechanism for cell scheduling in ATM networks</title><author>Dongnian Cheng ; Zengji Liu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i174t-b2b18654053f03cba4eeaf9f044537bee9d7a8879a286303366e2d5f7cb8bd2c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Analytical models</topic><topic>Bandwidth</topic><topic>Delay</topic><topic>Dynamic scheduling</topic><topic>Electronic mail</topic><topic>Intelligent networks</topic><topic>Intserv networks</topic><topic>Performance analysis</topic><topic>Processor scheduling</topic><topic>Round robin</topic><toplevel>online_resources</toplevel><creatorcontrib>Dongnian Cheng</creatorcontrib><creatorcontrib>Zengji Liu</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 Xplore</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>Dongnian Cheng</au><au>Zengji Liu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A fair and cost-effective service mechanism for cell scheduling in ATM networks</atitle><btitle>WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420)</btitle><stitle>ICCT</stitle><date>2000</date><risdate>2000</risdate><volume>1</volume><spage>227</spage><epage>231 vol.1</epage><pages>227-231 vol.1</pages><isbn>9780780363946</isbn><isbn>0780363949</isbn><abstract>In order to schedule cells fairly and cost-effectively in ATM networks, this paper develops a new type of fair service referred to as fair-base-weighted round robin (FWRR). It combines well the fairness of an ideal fair service with the simplicity of a typical round robin (RR) service such that it can offer fair service to all connections over each "fair cycle", with flexible operations and low expense close to that of a typical RR. We show that FWRR possesses fairness over each of fair cycles. Also, we analyze its worst-case fairness, upper bound of cell delay, and complexity. Numerical results obtained from simulation further support the analysis, with two main conclusions that FWRR can not only offer better fairness but present lower cell delay bound to higher-speed connections than carry-over round robin.</abstract><pub>IEEE</pub><doi>10.1109/ICCT.2000.889204</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9780780363946
ispartof WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420), 2000, Vol.1, p.227-231 vol.1
issn
language eng
recordid cdi_ieee_primary_889204
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Analytical models
Bandwidth
Delay
Dynamic scheduling
Electronic mail
Intelligent networks
Intserv networks
Performance analysis
Processor scheduling
Round robin
title A fair and cost-effective service mechanism for cell scheduling in ATM networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T10%3A05%3A07IST&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=A%20fair%20and%20cost-effective%20service%20mechanism%20for%20cell%20scheduling%20in%20ATM%20networks&rft.btitle=WCC%202000%20-%20ICCT%202000.%202000%20International%20Conference%20on%20Communication%20Technology%20Proceedings%20(Cat.%20No.00EX420)&rft.au=Dongnian%20Cheng&rft.date=2000&rft.volume=1&rft.spage=227&rft.epage=231%20vol.1&rft.pages=227-231%20vol.1&rft.isbn=9780780363946&rft.isbn_list=0780363949&rft_id=info:doi/10.1109/ICCT.2000.889204&rft_dat=%3Cieee_6IE%3E889204%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i174t-b2b18654053f03cba4eeaf9f044537bee9d7a8879a286303366e2d5f7cb8bd2c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=889204&rfr_iscdi=true