Packet delay variation analysis of the CQ switch under uniform traffic

This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exhaustive-round-robin and frame-based-ro...

Full description

Saved in:
Bibliographic Details
Main Authors: Radonjic, M., Radusinovic, I., Banovic, D., Maljevic, I.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Delay
Postal services
Round robin
Switches
Telecommunications
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 193
container_issue
container_start_page 190
container_title
container_volume
creator Radonjic, M.
Radusinovic, I.
Banovic, D.
Maljevic, I.
description This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exhaustive-round-robin and frame-based-round-robin-matching. The results have shown that the round-robin algorithm has the least packet delay variation among the observed algorithms.
doi_str_mv 10.1109/TELFOR.2011.6143523
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6143523</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6143523</ieee_id><sourcerecordid>6143523</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-431ff363f2bb6abaef5cdd97d871812f0272ac2d1adfc0f5246754abc1e58eeb3</originalsourceid><addsrcrecordid>eNo1j81KxDAUhSMiqGOfYDZ5gdbcpE2apZSpDhRGpQt3w21-mGinlaYqfXsHHM_ifJzNB4eQNbAMgOn7dtPUu9eMM4BMQi4KLi5IolUJeaEU5LqUl-T2f-i3a5LE-M5OkVJLxW5I_Yzmw83Uuh4X-o1TwDmMA8UB-yWGSEdP54Oj1QuNP2E2B_o1WDedOvhxOtJ5Qu-DuSNXHvvokjNXpK03bfWUNrvHbfXQpEGzOc0FeC-k8LzrJHbofGGs1cqWCkrgnnHF0XALaL1hvuC5VEWOnQFXlM51YkXWf9rgnNt_TuGI07I_Pxe_j9BOEw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Packet delay variation analysis of the CQ switch under uniform traffic</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Radonjic, M. ; Radusinovic, I. ; Banovic, D. ; Maljevic, I.</creator><creatorcontrib>Radonjic, M. ; Radusinovic, I. ; Banovic, D. ; Maljevic, I.</creatorcontrib><description>This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exhaustive-round-robin and frame-based-round-robin-matching. The results have shown that the round-robin algorithm has the least packet delay variation among the observed algorithms.</description><identifier>ISBN: 145771499X</identifier><identifier>ISBN: 9781457714993</identifier><identifier>EISBN: 9781457714986</identifier><identifier>EISBN: 1457714981</identifier><identifier>DOI: 10.1109/TELFOR.2011.6143523</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Delay ; Postal services ; Round robin ; Switches ; Telecommunications</subject><ispartof>2011 19thTelecommunications Forum (TELFOR) Proceedings of Papers, 2011, p.190-193</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/6143523$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6143523$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Radonjic, M.</creatorcontrib><creatorcontrib>Radusinovic, I.</creatorcontrib><creatorcontrib>Banovic, D.</creatorcontrib><creatorcontrib>Maljevic, I.</creatorcontrib><title>Packet delay variation analysis of the CQ switch under uniform traffic</title><title>2011 19thTelecommunications Forum (TELFOR) Proceedings of Papers</title><addtitle>TELFOR</addtitle><description>This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exhaustive-round-robin and frame-based-round-robin-matching. The results have shown that the round-robin algorithm has the least packet delay variation among the observed algorithms.</description><subject>Algorithm design and analysis</subject><subject>Delay</subject><subject>Postal services</subject><subject>Round robin</subject><subject>Switches</subject><subject>Telecommunications</subject><isbn>145771499X</isbn><isbn>9781457714993</isbn><isbn>9781457714986</isbn><isbn>1457714981</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1j81KxDAUhSMiqGOfYDZ5gdbcpE2apZSpDhRGpQt3w21-mGinlaYqfXsHHM_ifJzNB4eQNbAMgOn7dtPUu9eMM4BMQi4KLi5IolUJeaEU5LqUl-T2f-i3a5LE-M5OkVJLxW5I_Yzmw83Uuh4X-o1TwDmMA8UB-yWGSEdP54Oj1QuNP2E2B_o1WDedOvhxOtJ5Qu-DuSNXHvvokjNXpK03bfWUNrvHbfXQpEGzOc0FeC-k8LzrJHbofGGs1cqWCkrgnnHF0XALaL1hvuC5VEWOnQFXlM51YkXWf9rgnNt_TuGI07I_Pxe_j9BOEw</recordid><startdate>201111</startdate><enddate>201111</enddate><creator>Radonjic, M.</creator><creator>Radusinovic, I.</creator><creator>Banovic, D.</creator><creator>Maljevic, I.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201111</creationdate><title>Packet delay variation analysis of the CQ switch under uniform traffic</title><author>Radonjic, M. ; Radusinovic, I. ; Banovic, D. ; Maljevic, I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-431ff363f2bb6abaef5cdd97d871812f0272ac2d1adfc0f5246754abc1e58eeb3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithm design and analysis</topic><topic>Delay</topic><topic>Postal services</topic><topic>Round robin</topic><topic>Switches</topic><topic>Telecommunications</topic><toplevel>online_resources</toplevel><creatorcontrib>Radonjic, M.</creatorcontrib><creatorcontrib>Radusinovic, I.</creatorcontrib><creatorcontrib>Banovic, D.</creatorcontrib><creatorcontrib>Maljevic, I.</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>Radonjic, M.</au><au>Radusinovic, I.</au><au>Banovic, D.</au><au>Maljevic, I.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Packet delay variation analysis of the CQ switch under uniform traffic</atitle><btitle>2011 19thTelecommunications Forum (TELFOR) Proceedings of Papers</btitle><stitle>TELFOR</stitle><date>2011-11</date><risdate>2011</risdate><spage>190</spage><epage>193</epage><pages>190-193</pages><isbn>145771499X</isbn><isbn>9781457714993</isbn><eisbn>9781457714986</eisbn><eisbn>1457714981</eisbn><abstract>This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exhaustive-round-robin and frame-based-round-robin-matching. The results have shown that the round-robin algorithm has the least packet delay variation among the observed algorithms.</abstract><pub>IEEE</pub><doi>10.1109/TELFOR.2011.6143523</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 145771499X
ispartof 2011 19thTelecommunications Forum (TELFOR) Proceedings of Papers, 2011, p.190-193
issn
language eng
recordid cdi_ieee_primary_6143523
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Delay
Postal services
Round robin
Switches
Telecommunications
title Packet delay variation analysis of the CQ switch under uniform traffic
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T01%3A38%3A39IST&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=Packet%20delay%20variation%20analysis%20of%20the%20CQ%20switch%20under%20uniform%20traffic&rft.btitle=2011%2019thTelecommunications%20Forum%20(TELFOR)%20Proceedings%20of%20Papers&rft.au=Radonjic,%20M.&rft.date=2011-11&rft.spage=190&rft.epage=193&rft.pages=190-193&rft.isbn=145771499X&rft.isbn_list=9781457714993&rft_id=info:doi/10.1109/TELFOR.2011.6143523&rft.eisbn=9781457714986&rft.eisbn_list=1457714981&rft_dat=%3Cieee_6IE%3E6143523%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-431ff363f2bb6abaef5cdd97d871812f0272ac2d1adfc0f5246754abc1e58eeb3%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=6143523&rfr_iscdi=true