A Link Status-Based Multipath Scheduling Scheme on Network Nodes

Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. Th...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Hongyu Liu [verfasserIn] Hong Ni [verfasserIn] Rui Han [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2024

Schlagwörter:	multipath transmission multipath scheduling network transmission routing forwarding

Übergeordnetes Werk:	In: Electronics - MDPI AG, 2013, 13(2024), 3, p 608
Übergeordnetes Werk:	volume:13 ; year:2024 ; number:3, p 608

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.3390/electronics13030608

Katalog-ID:	DOAJ094501440

Internformat


LEADER	01000naa a22002652 4500
001	DOAJ094501440
003	DE-627
005	20240413045325.0
007	cr uuu---uuuuu
008	240413s2024 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.3390/electronics13030608 \|2 doi
035			\|a (DE-627)DOAJ094501440
035			\|a (DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK7800-8360
100	0		\|a Hongyu Liu \|e verfasserin \|4 aut
245	1	2	\|a A Link Status-Based Multipath Scheduling Scheme on Network Nodes
264		1	\|c 2024
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time.
650		4	\|a multipath transmission
650		4	\|a multipath scheduling
650		4	\|a network transmission
650		4	\|a routing forwarding
653		0	\|a Electronics
700	0		\|a Hong Ni \|e verfasserin \|4 aut
700	0		\|a Rui Han \|e verfasserin \|4 aut
773	0	8	\|i In \|t Electronics \|d MDPI AG, 2013 \|g 13(2024), 3, p 608 \|w (DE-627)718626478 \|w (DE-600)2662127-7 \|x 20799292 \|7 nnns
773	1	8	\|g volume:13 \|g year:2024 \|g number:3, p 608
856	4	0	\|u https://doi.org/10.3390/electronics13030608 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f \|z kostenfrei
856	4	0	\|u https://www.mdpi.com/2079-9292/13/3/608 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2079-9292 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 13 \|j 2024 \|e 3, p 608

Indexfelder

author_variant	h l hl h n hn r h rh
matchkey_str	article:20799292:2024----::lnsaubsdutptshdlnsh
hierarchy_sort_str	2024
callnumber-subject-code	TK
publishDate	2024
allfields	10.3390/electronics13030608 doi (DE-627)DOAJ094501440 (DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f DE-627 ger DE-627 rakwb eng TK7800-8360 Hongyu Liu verfasserin aut A Link Status-Based Multipath Scheduling Scheme on Network Nodes 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time. multipath transmission multipath scheduling network transmission routing forwarding Electronics Hong Ni verfasserin aut Rui Han verfasserin aut In Electronics MDPI AG, 2013 13(2024), 3, p 608 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:13 year:2024 number:3, p 608 https://doi.org/10.3390/electronics13030608 kostenfrei https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f kostenfrei https://www.mdpi.com/2079-9292/13/3/608 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2024 3, p 608
spelling	10.3390/electronics13030608 doi (DE-627)DOAJ094501440 (DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f DE-627 ger DE-627 rakwb eng TK7800-8360 Hongyu Liu verfasserin aut A Link Status-Based Multipath Scheduling Scheme on Network Nodes 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time. multipath transmission multipath scheduling network transmission routing forwarding Electronics Hong Ni verfasserin aut Rui Han verfasserin aut In Electronics MDPI AG, 2013 13(2024), 3, p 608 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:13 year:2024 number:3, p 608 https://doi.org/10.3390/electronics13030608 kostenfrei https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f kostenfrei https://www.mdpi.com/2079-9292/13/3/608 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2024 3, p 608
allfields_unstemmed	10.3390/electronics13030608 doi (DE-627)DOAJ094501440 (DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f DE-627 ger DE-627 rakwb eng TK7800-8360 Hongyu Liu verfasserin aut A Link Status-Based Multipath Scheduling Scheme on Network Nodes 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time. multipath transmission multipath scheduling network transmission routing forwarding Electronics Hong Ni verfasserin aut Rui Han verfasserin aut In Electronics MDPI AG, 2013 13(2024), 3, p 608 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:13 year:2024 number:3, p 608 https://doi.org/10.3390/electronics13030608 kostenfrei https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f kostenfrei https://www.mdpi.com/2079-9292/13/3/608 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2024 3, p 608
allfieldsGer	10.3390/electronics13030608 doi (DE-627)DOAJ094501440 (DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f DE-627 ger DE-627 rakwb eng TK7800-8360 Hongyu Liu verfasserin aut A Link Status-Based Multipath Scheduling Scheme on Network Nodes 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time. multipath transmission multipath scheduling network transmission routing forwarding Electronics Hong Ni verfasserin aut Rui Han verfasserin aut In Electronics MDPI AG, 2013 13(2024), 3, p 608 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:13 year:2024 number:3, p 608 https://doi.org/10.3390/electronics13030608 kostenfrei https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f kostenfrei https://www.mdpi.com/2079-9292/13/3/608 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2024 3, p 608
allfieldsSound	10.3390/electronics13030608 doi (DE-627)DOAJ094501440 (DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f DE-627 ger DE-627 rakwb eng TK7800-8360 Hongyu Liu verfasserin aut A Link Status-Based Multipath Scheduling Scheme on Network Nodes 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time. multipath transmission multipath scheduling network transmission routing forwarding Electronics Hong Ni verfasserin aut Rui Han verfasserin aut In Electronics MDPI AG, 2013 13(2024), 3, p 608 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:13 year:2024 number:3, p 608 https://doi.org/10.3390/electronics13030608 kostenfrei https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f kostenfrei https://www.mdpi.com/2079-9292/13/3/608 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 13 2024 3, p 608
language	English
source	In Electronics 13(2024), 3, p 608 volume:13 year:2024 number:3, p 608
sourceStr	In Electronics 13(2024), 3, p 608 volume:13 year:2024 number:3, p 608
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	multipath transmission multipath scheduling network transmission routing forwarding Electronics
isfreeaccess_bool	true
container_title	Electronics
authorswithroles_txt_mv	Hongyu Liu @@aut@@ Hong Ni @@aut@@ Rui Han @@aut@@
publishDateDaySort_date	2024-01-01T00:00:00Z
hierarchy_top_id	718626478
id	DOAJ094501440
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ094501440</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240413045325.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240413s2024 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/electronics13030608</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ094501440</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Hongyu Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Link Status-Based Multipath Scheduling Scheme on Network Nodes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multipath transmission</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multipath scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">network transmission</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing forwarding</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hong Ni</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Rui Han</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Electronics</subfield><subfield code="d">MDPI AG, 2013</subfield><subfield code="g">13(2024), 3, p 608</subfield><subfield code="w">(DE-627)718626478</subfield><subfield code="w">(DE-600)2662127-7</subfield><subfield code="x">20799292</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:13</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:3, p 608</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/electronics13030608</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2079-9292/13/3/608</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2079-9292</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">13</subfield><subfield code="j">2024</subfield><subfield code="e">3, p 608</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Hongyu Liu
spellingShingle	Hongyu Liu misc TK7800-8360 misc multipath transmission misc multipath scheduling misc network transmission misc routing forwarding misc Electronics A Link Status-Based Multipath Scheduling Scheme on Network Nodes
authorStr	Hongyu Liu
ppnlink_with_tag_str_mv	@@773@@(DE-627)718626478
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK7800-8360
illustrated	Not Illustrated
issn	20799292
topic_title	TK7800-8360 A Link Status-Based Multipath Scheduling Scheme on Network Nodes multipath transmission multipath scheduling network transmission routing forwarding
topic	misc TK7800-8360 misc multipath transmission misc multipath scheduling misc network transmission misc routing forwarding misc Electronics
topic_unstemmed	misc TK7800-8360 misc multipath transmission misc multipath scheduling misc network transmission misc routing forwarding misc Electronics
topic_browse	misc TK7800-8360 misc multipath transmission misc multipath scheduling misc network transmission misc routing forwarding misc Electronics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Electronics
hierarchy_parent_id	718626478
hierarchy_top_title	Electronics
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)718626478 (DE-600)2662127-7
title	A Link Status-Based Multipath Scheduling Scheme on Network Nodes
ctrlnum	(DE-627)DOAJ094501440 (DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f
title_full	A Link Status-Based Multipath Scheduling Scheme on Network Nodes
author_sort	Hongyu Liu
journal	Electronics
journalStr	Electronics
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2024
contenttype_str_mv	txt
author_browse	Hongyu Liu Hong Ni Rui Han
container_volume	13
class	TK7800-8360
format_se	Elektronische Aufsätze
author-letter	Hongyu Liu
doi_str_mv	10.3390/electronics13030608
author2-role	verfasserin
title_sort	link status-based multipath scheduling scheme on network nodes
callnumber	TK7800-8360
title_auth	A Link Status-Based Multipath Scheduling Scheme on Network Nodes
abstract	Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time.
abstractGer	Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time.
abstract_unstemmed	Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	3, p 608
title_short	A Link Status-Based Multipath Scheduling Scheme on Network Nodes
url	https://doi.org/10.3390/electronics13030608 https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f https://www.mdpi.com/2079-9292/13/3/608 https://doaj.org/toc/2079-9292
remote_bool	true
author2	Hong Ni Rui Han
author2Str	Hong Ni Rui Han
ppnlink	718626478
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.3390/electronics13030608
callnumber-a	TK7800-8360
up_date	2024-07-03T23:26:24.730Z
_version_	1803602293930590208
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ094501440</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240413045325.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240413s2024 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/electronics13030608</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ094501440</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJbe0d9e6294bc45a291c277ffc964c06f</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Hongyu Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Link Status-Based Multipath Scheduling Scheme on Network Nodes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Traditional internet protocol (IP) networks, adhering to a “best-effort” service model, typically utilize shortest-path routing for data transmission. Nevertheless, this methodology encounters limitations, especially considering the increasing demands for both high reliability and high bandwidth. These demands reveal shortcomings in this routing strategy, notably its inefficient bandwidth utilization and fault recovery capabilities. The method of multipath transmission has been extensively researched as a solution to these challenges. With the emergence of innovative Internet architectures, notably information-centric networking (ICN), network nodes have gained enhanced capabilities, opening new avenues for multipath transmission design. This paper introduces a multipath scheduling approach for network nodes, capitalizing on the advanced features of these modern nodes. It reimagines the conventional next-hop node as a group of potential next-hop nodes based on both global and local routing strategies and assigns traffic shares to each node within this group for balanced traffic distribution. Network nodes are configured to periodically review and adjust traffic shares according to the link statuses. If scheduling cannot be completed within the set, feedback is sent to upstream nodes. Simulations demonstrate that this approach effectively leverages network path variety, improves bandwidth usage and throughput, and minimizes average data transmission time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multipath transmission</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multipath scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">network transmission</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing forwarding</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hong Ni</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Rui Han</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Electronics</subfield><subfield code="d">MDPI AG, 2013</subfield><subfield code="g">13(2024), 3, p 608</subfield><subfield code="w">(DE-627)718626478</subfield><subfield code="w">(DE-600)2662127-7</subfield><subfield code="x">20799292</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:13</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:3, p 608</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/electronics13030608</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/be0d9e6294bc45a291c277ffc964c06f</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2079-9292/13/3/608</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2079-9292</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">13</subfield><subfield code="j">2024</subfield><subfield code="e">3, p 608</subfield></datafield></record></collection>
score	7.4009905

Nicht das Richtige dabei?

Schreiben Sie uns!

A Link Status-Based Multipath Scheduling Scheme on Network Nodes

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?