Mapping TSN Traffic Scheduling and Shaping to FPGA-based Architecture

Time-Sensitive Networking (TSN), which evolves from the Ethernet standards, has been developed to ensure deterministic transmission in data networks. Asynchronous Traffic Shaping (ATS) extends the conventional synchronized TSN with an asynchronous scheduler to guarantee a bounded transmitting delay....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2020-01, Vol.8, p.1-1
Hauptverfasser: Zhou, Zifan, Berger, Michael Stubert, Yan, Ying
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1
container_issue
container_start_page 1
container_title IEEE access
container_volume 8
creator Zhou, Zifan
Berger, Michael Stubert
Yan, Ying
description Time-Sensitive Networking (TSN), which evolves from the Ethernet standards, has been developed to ensure deterministic transmission in data networks. Asynchronous Traffic Shaping (ATS) extends the conventional synchronized TSN with an asynchronous scheduler to guarantee a bounded transmitting delay. In this work, we present a Field Programmable Gate Arrays (FPGA) implementation of a TSN scheduling entity, which leverages ATS for the frame forwarding process. We explore the ATS design by function blocks and compare it with a benchmark design utilizing strict-priority scheduling. In terms of operating frequency, our results indicate that strict-priority scheduling performs 1.05% to 9.56% higher maximum frequency than ATS with the same configurations. Regarding resource utilization, ATS consumes 51% to 119% more logic blocks and 51% to 101% more registers than strict-priority scheduling. Based on the synthesis and fitting results from Register-Transfer Level (RTL) simulations, we provide a general vision of designing and implementing considerations of the ATS function. Specifically, we show the influences of the buffer and bus width configuration on the FPGA implementation scale and data rate.
doi_str_mv 10.1109/ACCESS.2020.3043887
format Article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_9290032</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9290032</ieee_id><doaj_id>oai_doaj_org_article_631678b6d17444489d8e67094db9c311</doaj_id><sourcerecordid>2470643465</sourcerecordid><originalsourceid>FETCH-LOGICAL-c478t-52494ecea79066ad54d6aebdf5537ff40c7b908cc688bfd7665952c02cf6dbbd3</originalsourceid><addsrcrecordid>eNpNUMtqwlAUDKWFivUL3AS6jr3vxzIEtYJ9QOz6cp8asSa9iYv-faMR6WzOYZiZc5gkmUIwgxDIl7wo5mU5QwCBGQYEC8HvkhGCTGaYYnb_b39MJm27Bz1ET1E-SuZvummq4zbdlO_pJuoQKpuWdufd6XCm9dGl5U5fJF2dLj6XeWZ0612aR7urOm-7U_RPyUPQh9ZPrnOcfC3mm-I1W38sV0W-zizhossoIpJ46zWXgDHtKHFMe-MCpZiHQIDlRgJhLRPCBMcZo5IiC5ANzBnj8DhZDbmu1nvVxOpbx19V60pdiDpulY5dZQ9eMQwZF4Y5yEkPIZ3wjANJnJEWQ9hnPQ9ZTax_Tr7t1L4-xWP_vkKEA0YwYbRX4UFlY9220YfbVQjUuX411K_O9atr_b1rOrgq7_3NIZEEACP8B17cfn8</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2470643465</pqid></control><display><type>article</type><title>Mapping TSN Traffic Scheduling and Shaping to FPGA-based Architecture</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Zhou, Zifan ; Berger, Michael Stubert ; Yan, Ying</creator><creatorcontrib>Zhou, Zifan ; Berger, Michael Stubert ; Yan, Ying</creatorcontrib><description>Time-Sensitive Networking (TSN), which evolves from the Ethernet standards, has been developed to ensure deterministic transmission in data networks. Asynchronous Traffic Shaping (ATS) extends the conventional synchronized TSN with an asynchronous scheduler to guarantee a bounded transmitting delay. In this work, we present a Field Programmable Gate Arrays (FPGA) implementation of a TSN scheduling entity, which leverages ATS for the frame forwarding process. We explore the ATS design by function blocks and compare it with a benchmark design utilizing strict-priority scheduling. In terms of operating frequency, our results indicate that strict-priority scheduling performs 1.05% to 9.56% higher maximum frequency than ATS with the same configurations. Regarding resource utilization, ATS consumes 51% to 119% more logic blocks and 51% to 101% more registers than strict-priority scheduling. Based on the synthesis and fitting results from Register-Transfer Level (RTL) simulations, we provide a general vision of designing and implementing considerations of the ATS function. Specifically, we show the influences of the buffer and bus width configuration on the FPGA implementation scale and data rate.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2020.3043887</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Configurations ; Ethernet ; Ethernet networks ; Field programmable gate arrays ; FPGA ; Hardware ; Logic gates ; Priority scheduling ; Real-time systems ; Resource utilization ; Scheduling ; Scheduling algorithm ; Switches ; Throughput</subject><ispartof>IEEE access, 2020-01, Vol.8, p.1-1</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c478t-52494ecea79066ad54d6aebdf5537ff40c7b908cc688bfd7665952c02cf6dbbd3</citedby><cites>FETCH-LOGICAL-c478t-52494ecea79066ad54d6aebdf5537ff40c7b908cc688bfd7665952c02cf6dbbd3</cites><orcidid>0000-0003-4251-4889 ; 0000-0003-0678-8831</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9290032$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,860,2096,27610,27901,27902,54908</link.rule.ids></links><search><creatorcontrib>Zhou, Zifan</creatorcontrib><creatorcontrib>Berger, Michael Stubert</creatorcontrib><creatorcontrib>Yan, Ying</creatorcontrib><title>Mapping TSN Traffic Scheduling and Shaping to FPGA-based Architecture</title><title>IEEE access</title><addtitle>Access</addtitle><description>Time-Sensitive Networking (TSN), which evolves from the Ethernet standards, has been developed to ensure deterministic transmission in data networks. Asynchronous Traffic Shaping (ATS) extends the conventional synchronized TSN with an asynchronous scheduler to guarantee a bounded transmitting delay. In this work, we present a Field Programmable Gate Arrays (FPGA) implementation of a TSN scheduling entity, which leverages ATS for the frame forwarding process. We explore the ATS design by function blocks and compare it with a benchmark design utilizing strict-priority scheduling. In terms of operating frequency, our results indicate that strict-priority scheduling performs 1.05% to 9.56% higher maximum frequency than ATS with the same configurations. Regarding resource utilization, ATS consumes 51% to 119% more logic blocks and 51% to 101% more registers than strict-priority scheduling. Based on the synthesis and fitting results from Register-Transfer Level (RTL) simulations, we provide a general vision of designing and implementing considerations of the ATS function. Specifically, we show the influences of the buffer and bus width configuration on the FPGA implementation scale and data rate.</description><subject>Configurations</subject><subject>Ethernet</subject><subject>Ethernet networks</subject><subject>Field programmable gate arrays</subject><subject>FPGA</subject><subject>Hardware</subject><subject>Logic gates</subject><subject>Priority scheduling</subject><subject>Real-time systems</subject><subject>Resource utilization</subject><subject>Scheduling</subject><subject>Scheduling algorithm</subject><subject>Switches</subject><subject>Throughput</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNUMtqwlAUDKWFivUL3AS6jr3vxzIEtYJ9QOz6cp8asSa9iYv-faMR6WzOYZiZc5gkmUIwgxDIl7wo5mU5QwCBGQYEC8HvkhGCTGaYYnb_b39MJm27Bz1ET1E-SuZvummq4zbdlO_pJuoQKpuWdufd6XCm9dGl5U5fJF2dLj6XeWZ0612aR7urOm-7U_RPyUPQh9ZPrnOcfC3mm-I1W38sV0W-zizhossoIpJ46zWXgDHtKHFMe-MCpZiHQIDlRgJhLRPCBMcZo5IiC5ANzBnj8DhZDbmu1nvVxOpbx19V60pdiDpulY5dZQ9eMQwZF4Y5yEkPIZ3wjANJnJEWQ9hnPQ9ZTax_Tr7t1L4-xWP_vkKEA0YwYbRX4UFlY9220YfbVQjUuX411K_O9atr_b1rOrgq7_3NIZEEACP8B17cfn8</recordid><startdate>20200101</startdate><enddate>20200101</enddate><creator>Zhou, Zifan</creator><creator>Berger, Michael Stubert</creator><creator>Yan, Ying</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-4251-4889</orcidid><orcidid>https://orcid.org/0000-0003-0678-8831</orcidid></search><sort><creationdate>20200101</creationdate><title>Mapping TSN Traffic Scheduling and Shaping to FPGA-based Architecture</title><author>Zhou, Zifan ; Berger, Michael Stubert ; Yan, Ying</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c478t-52494ecea79066ad54d6aebdf5537ff40c7b908cc688bfd7665952c02cf6dbbd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Configurations</topic><topic>Ethernet</topic><topic>Ethernet networks</topic><topic>Field programmable gate arrays</topic><topic>FPGA</topic><topic>Hardware</topic><topic>Logic gates</topic><topic>Priority scheduling</topic><topic>Real-time systems</topic><topic>Resource utilization</topic><topic>Scheduling</topic><topic>Scheduling algorithm</topic><topic>Switches</topic><topic>Throughput</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhou, Zifan</creatorcontrib><creatorcontrib>Berger, Michael Stubert</creatorcontrib><creatorcontrib>Yan, Ying</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhou, Zifan</au><au>Berger, Michael Stubert</au><au>Yan, Ying</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Mapping TSN Traffic Scheduling and Shaping to FPGA-based Architecture</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2020-01-01</date><risdate>2020</risdate><volume>8</volume><spage>1</spage><epage>1</epage><pages>1-1</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>Time-Sensitive Networking (TSN), which evolves from the Ethernet standards, has been developed to ensure deterministic transmission in data networks. Asynchronous Traffic Shaping (ATS) extends the conventional synchronized TSN with an asynchronous scheduler to guarantee a bounded transmitting delay. In this work, we present a Field Programmable Gate Arrays (FPGA) implementation of a TSN scheduling entity, which leverages ATS for the frame forwarding process. We explore the ATS design by function blocks and compare it with a benchmark design utilizing strict-priority scheduling. In terms of operating frequency, our results indicate that strict-priority scheduling performs 1.05% to 9.56% higher maximum frequency than ATS with the same configurations. Regarding resource utilization, ATS consumes 51% to 119% more logic blocks and 51% to 101% more registers than strict-priority scheduling. Based on the synthesis and fitting results from Register-Transfer Level (RTL) simulations, we provide a general vision of designing and implementing considerations of the ATS function. Specifically, we show the influences of the buffer and bus width configuration on the FPGA implementation scale and data rate.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2020.3043887</doi><tpages>1</tpages><orcidid>https://orcid.org/0000-0003-4251-4889</orcidid><orcidid>https://orcid.org/0000-0003-0678-8831</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2169-3536
ispartof IEEE access, 2020-01, Vol.8, p.1-1
issn 2169-3536
2169-3536
language eng
recordid cdi_ieee_primary_9290032
source IEEE Open Access Journals; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Configurations
Ethernet
Ethernet networks
Field programmable gate arrays
FPGA
Hardware
Logic gates
Priority scheduling
Real-time systems
Resource utilization
Scheduling
Scheduling algorithm
Switches
Throughput
title Mapping TSN Traffic Scheduling and Shaping to FPGA-based Architecture
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T08%3A51%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Mapping%20TSN%20Traffic%20Scheduling%20and%20Shaping%20to%20FPGA-based%20Architecture&rft.jtitle=IEEE%20access&rft.au=Zhou,%20Zifan&rft.date=2020-01-01&rft.volume=8&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2020.3043887&rft_dat=%3Cproquest_ieee_%3E2470643465%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2470643465&rft_id=info:pmid/&rft_ieee_id=9290032&rft_doaj_id=oai_doaj_org_article_631678b6d17444489d8e67094db9c311&rfr_iscdi=true