Two priority schemes for fair distributed queue (FDQ) networks

The absolute priority scheme is message preemptive and allows only the highest priority class to be present on the network under heavy load. The allocation priority scheme permits the transmission of low priority class data in a controllable proportion to the high priority data. Under heavy load, bo...

Full description

Saved in:
Bibliographic Details
Main Authors: Kabatepe, M., Vastola, K.S.
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Metropolitan area networks
Propagation delay
Proportional control
Protocols
Telecommunication traffic
Throughput
Time factors
Traffic control
Wide area networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 380 vol.1
container_issue
container_start_page 376
container_title
container_volume 1
creator Kabatepe, M.
Vastola, K.S.
description The absolute priority scheme is message preemptive and allows only the highest priority class to be present on the network under heavy load. The allocation priority scheme permits the transmission of low priority class data in a controllable proportion to the high priority data. Under heavy load, both schemes allocate equal bandwidth to the active nodes within each priority class without wasting bandwidth. They also have completely predictable worst-case delays. The delay characteristics of both schemes under Poisson load are studied via simulation. With the assumption of equal arrival rates, the high priority class achieves a much lower delay than the low priority class, in both schemes. Thus, the absolute and allocation priority schemes are fair and very efficient.< >
doi_str_mv 10.1109/ICC.1993.397290
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_397290</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>397290</ieee_id><sourcerecordid>397290</sourcerecordid><originalsourceid>FETCH-ieee_primary_3972903</originalsourceid><addsrcrecordid>eNp9jj0LwjAURQMi-NVZcHqjDtaXpqVmcamKjkL3Uu0rRq3RJKX031vQ2buc4cDhMjbl6HOOcnVMEp9LKXwh40Bij40wXqNAGWEwYJ61N-wWRjwI4yHbpI2Gl1HaKNeCvVypIgulNlDmykChrDPqXDsq4F1TTTDfb08LeJJrtLnbCeuX-cOS9-OYzfa7NDksFRFlXbfKTZt9n4i_8gNRjjbX</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Two priority schemes for fair distributed queue (FDQ) networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kabatepe, M. ; Vastola, K.S.</creator><creatorcontrib>Kabatepe, M. ; Vastola, K.S.</creatorcontrib><description>The absolute priority scheme is message preemptive and allows only the highest priority class to be present on the network under heavy load. The allocation priority scheme permits the transmission of low priority class data in a controllable proportion to the high priority data. Under heavy load, both schemes allocate equal bandwidth to the active nodes within each priority class without wasting bandwidth. They also have completely predictable worst-case delays. The delay characteristics of both schemes under Poisson load are studied via simulation. With the assumption of equal arrival rates, the high priority class achieves a much lower delay than the low priority class, in both schemes. Thus, the absolute and allocation priority schemes are fair and very efficient.&lt; &gt;</description><identifier>ISBN: 0780309502</identifier><identifier>ISBN: 9780780309500</identifier><identifier>DOI: 10.1109/ICC.1993.397290</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Metropolitan area networks ; Propagation delay ; Proportional control ; Protocols ; Telecommunication traffic ; Throughput ; Time factors ; Traffic control ; Wide area networks</subject><ispartof>Proceedings of ICC '93 - IEEE International Conference on Communications, 1993, Vol.1, p.376-380 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/397290$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/397290$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kabatepe, M.</creatorcontrib><creatorcontrib>Vastola, K.S.</creatorcontrib><title>Two priority schemes for fair distributed queue (FDQ) networks</title><title>Proceedings of ICC '93 - IEEE International Conference on Communications</title><addtitle>ICC</addtitle><description>The absolute priority scheme is message preemptive and allows only the highest priority class to be present on the network under heavy load. The allocation priority scheme permits the transmission of low priority class data in a controllable proportion to the high priority data. Under heavy load, both schemes allocate equal bandwidth to the active nodes within each priority class without wasting bandwidth. They also have completely predictable worst-case delays. The delay characteristics of both schemes under Poisson load are studied via simulation. With the assumption of equal arrival rates, the high priority class achieves a much lower delay than the low priority class, in both schemes. Thus, the absolute and allocation priority schemes are fair and very efficient.&lt; &gt;</description><subject>Bandwidth</subject><subject>Metropolitan area networks</subject><subject>Propagation delay</subject><subject>Proportional control</subject><subject>Protocols</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Time factors</subject><subject>Traffic control</subject><subject>Wide area networks</subject><isbn>0780309502</isbn><isbn>9780780309500</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1993</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNp9jj0LwjAURQMi-NVZcHqjDtaXpqVmcamKjkL3Uu0rRq3RJKX031vQ2buc4cDhMjbl6HOOcnVMEp9LKXwh40Bij40wXqNAGWEwYJ61N-wWRjwI4yHbpI2Gl1HaKNeCvVypIgulNlDmykChrDPqXDsq4F1TTTDfb08LeJJrtLnbCeuX-cOS9-OYzfa7NDksFRFlXbfKTZt9n4i_8gNRjjbX</recordid><startdate>1993</startdate><enddate>1993</enddate><creator>Kabatepe, M.</creator><creator>Vastola, K.S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1993</creationdate><title>Two priority schemes for fair distributed queue (FDQ) networks</title><author>Kabatepe, M. ; Vastola, K.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_3972903</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Bandwidth</topic><topic>Metropolitan area networks</topic><topic>Propagation delay</topic><topic>Proportional control</topic><topic>Protocols</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Time factors</topic><topic>Traffic control</topic><topic>Wide area networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Kabatepe, M.</creatorcontrib><creatorcontrib>Vastola, K.S.</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>Kabatepe, M.</au><au>Vastola, K.S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Two priority schemes for fair distributed queue (FDQ) networks</atitle><btitle>Proceedings of ICC '93 - IEEE International Conference on Communications</btitle><stitle>ICC</stitle><date>1993</date><risdate>1993</risdate><volume>1</volume><spage>376</spage><epage>380 vol.1</epage><pages>376-380 vol.1</pages><isbn>0780309502</isbn><isbn>9780780309500</isbn><abstract>The absolute priority scheme is message preemptive and allows only the highest priority class to be present on the network under heavy load. The allocation priority scheme permits the transmission of low priority class data in a controllable proportion to the high priority data. Under heavy load, both schemes allocate equal bandwidth to the active nodes within each priority class without wasting bandwidth. They also have completely predictable worst-case delays. The delay characteristics of both schemes under Poisson load are studied via simulation. With the assumption of equal arrival rates, the high priority class achieves a much lower delay than the low priority class, in both schemes. Thus, the absolute and allocation priority schemes are fair and very efficient.&lt; &gt;</abstract><pub>IEEE</pub><doi>10.1109/ICC.1993.397290</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0780309502
ispartof Proceedings of ICC '93 - IEEE International Conference on Communications, 1993, Vol.1, p.376-380 vol.1
issn
language eng
recordid cdi_ieee_primary_397290
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Bandwidth
Metropolitan area networks
Propagation delay
Proportional control
Protocols
Telecommunication traffic
Throughput
Time factors
Traffic control
Wide area networks
title Two priority schemes for fair distributed queue (FDQ) networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T03%3A00%3A37IST&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=Two%20priority%20schemes%20for%20fair%20distributed%20queue%20(FDQ)%20networks&rft.btitle=Proceedings%20of%20ICC%20'93%20-%20IEEE%20International%20Conference%20on%20Communications&rft.au=Kabatepe,%20M.&rft.date=1993&rft.volume=1&rft.spage=376&rft.epage=380%20vol.1&rft.pages=376-380%20vol.1&rft.isbn=0780309502&rft.isbn_list=9780780309500&rft_id=info:doi/10.1109/ICC.1993.397290&rft_dat=%3Cieee_6IE%3E397290%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-ieee_primary_3972903%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=397290&rfr_iscdi=true