In-line routing and scheduling method for mixed traffic of data center network
The invention provides a data center network mixed flow in-line routing and scheduling mechanism. According to the method, a mixed flow scheduling problem is formalized into an online optimization problem, and path selection and rate distribution of the mixed flow are realized by solving the optimiz...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | JIANG RENJIE TANG ZHEWEI ZHANG TONG |
description | The invention provides a data center network mixed flow in-line routing and scheduling mechanism. According to the method, a mixed flow scheduling problem is formalized into an online optimization problem, and path selection and rate distribution of the mixed flow are realized by solving the optimization problem. The specific transmission mechanism is as follows: 1) a sending end host performs transmission path selection and rate distribution on mixed flow according to flow information and network information; and 2) the switch on the transmission path carries out bandwidth allocation on the arriving flow, and stores link congestion information in a data packet header. And 3) the receiving end host stores the path link congestion condition in an acknowledgement data packet header and sends the acknowledgement data packet header back to the sending end host. And 4) the route of the flow with the determined path is not changed in the transmission process, and more bandwidths are allocated to the deadline flow c |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN115987891A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN115987891A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN115987891A3</originalsourceid><addsrcrecordid>eNqNyrEKwjAQgOEsDqK-w_kAHYKI7ShF0aWTezmSiw2mdyW5oo-vgg_g9PPDtzTdlasUmSDLrJHvgOyhuIH8nL47kg7iIUiGMb7Ig2YMITqQAB4VwRErZWDSp-TH2iwCpkKbX1dmez7d2ktFk_RUJvxw0r7trN039aFu7HH3j3kD6-02XA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>In-line routing and scheduling method for mixed traffic of data center network</title><source>esp@cenet</source><creator>JIANG RENJIE ; TANG ZHEWEI ; ZHANG TONG</creator><creatorcontrib>JIANG RENJIE ; TANG ZHEWEI ; ZHANG TONG</creatorcontrib><description>The invention provides a data center network mixed flow in-line routing and scheduling mechanism. According to the method, a mixed flow scheduling problem is formalized into an online optimization problem, and path selection and rate distribution of the mixed flow are realized by solving the optimization problem. The specific transmission mechanism is as follows: 1) a sending end host performs transmission path selection and rate distribution on mixed flow according to flow information and network information; and 2) the switch on the transmission path carries out bandwidth allocation on the arriving flow, and stores link congestion information in a data packet header. And 3) the receiving end host stores the path link congestion condition in an acknowledgement data packet header and sends the acknowledgement data packet header back to the sending end host. And 4) the route of the flow with the determined path is not changed in the transmission process, and more bandwidths are allocated to the deadline flow c</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20230418&DB=EPODOC&CC=CN&NR=115987891A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20230418&DB=EPODOC&CC=CN&NR=115987891A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>JIANG RENJIE</creatorcontrib><creatorcontrib>TANG ZHEWEI</creatorcontrib><creatorcontrib>ZHANG TONG</creatorcontrib><title>In-line routing and scheduling method for mixed traffic of data center network</title><description>The invention provides a data center network mixed flow in-line routing and scheduling mechanism. According to the method, a mixed flow scheduling problem is formalized into an online optimization problem, and path selection and rate distribution of the mixed flow are realized by solving the optimization problem. The specific transmission mechanism is as follows: 1) a sending end host performs transmission path selection and rate distribution on mixed flow according to flow information and network information; and 2) the switch on the transmission path carries out bandwidth allocation on the arriving flow, and stores link congestion information in a data packet header. And 3) the receiving end host stores the path link congestion condition in an acknowledgement data packet header and sends the acknowledgement data packet header back to the sending end host. And 4) the route of the flow with the determined path is not changed in the transmission process, and more bandwidths are allocated to the deadline flow c</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyrEKwjAQgOEsDqK-w_kAHYKI7ShF0aWTezmSiw2mdyW5oo-vgg_g9PPDtzTdlasUmSDLrJHvgOyhuIH8nL47kg7iIUiGMb7Ig2YMITqQAB4VwRErZWDSp-TH2iwCpkKbX1dmez7d2ktFk_RUJvxw0r7trN039aFu7HH3j3kD6-02XA</recordid><startdate>20230418</startdate><enddate>20230418</enddate><creator>JIANG RENJIE</creator><creator>TANG ZHEWEI</creator><creator>ZHANG TONG</creator><scope>EVB</scope></search><sort><creationdate>20230418</creationdate><title>In-line routing and scheduling method for mixed traffic of data center network</title><author>JIANG RENJIE ; TANG ZHEWEI ; ZHANG TONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN115987891A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>JIANG RENJIE</creatorcontrib><creatorcontrib>TANG ZHEWEI</creatorcontrib><creatorcontrib>ZHANG TONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>JIANG RENJIE</au><au>TANG ZHEWEI</au><au>ZHANG TONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>In-line routing and scheduling method for mixed traffic of data center network</title><date>2023-04-18</date><risdate>2023</risdate><abstract>The invention provides a data center network mixed flow in-line routing and scheduling mechanism. According to the method, a mixed flow scheduling problem is formalized into an online optimization problem, and path selection and rate distribution of the mixed flow are realized by solving the optimization problem. The specific transmission mechanism is as follows: 1) a sending end host performs transmission path selection and rate distribution on mixed flow according to flow information and network information; and 2) the switch on the transmission path carries out bandwidth allocation on the arriving flow, and stores link congestion information in a data packet header. And 3) the receiving end host stores the path link congestion condition in an acknowledgement data packet header and sends the acknowledgement data packet header back to the sending end host. And 4) the route of the flow with the determined path is not changed in the transmission process, and more bandwidths are allocated to the deadline flow c</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | chi ; eng |
recordid | cdi_epo_espacenet_CN115987891A |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC COMMUNICATION TECHNIQUE ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
title | In-line routing and scheduling method for mixed traffic of data center network |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T17%3A59%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=JIANG%20RENJIE&rft.date=2023-04-18&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN115987891A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |