A buffer management algorithm based on message grouping

In the opportunity network, effective buffer management methods are important means to improve network performance when buffer overflow. Therefore, this article proposes a message grouping based opportunistic network buffer management method. This method first determines the relationship between the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discover applied sciences Ročník 7; číslo 10; s. 1081 - 16
Hlavní autoři:	Wang, Hezhe, Wang, Huiqiang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 29.09.2025 Springer Nature B.V Springer
Témata:	Algorithms Applied and Technical Physics Buffer management Buffers Chemistry/Food Science Congestion avoidance Earth Sciences Engineering Environment Management methods Materials Science Messages Methods Nodes Opportunistic networks Overflow Principles Congestion avoidance Opportunistic networks Buffer management
ISSN:	3004-9261, 2523-3963, 3004-9261, 2523-3971
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	In the opportunity network, effective buffer management methods are important means to improve network performance when buffer overflow. Therefore, this article proposes a message grouping based opportunistic network buffer management method. This method first determines the relationship between the buffer space required to receive all messages in the message set and the size of the idle buffer of the node. If the idle buffer of the node is not less than the buffer space occupied by the message set to be received, all messages to be received are received. Otherwise, the number of messages in the message set to be received is further determined, and which messages in the node buffer to discard are selected based on the number of messages in the message set to be received, thereby alleviating the problem of buffer overflow. The simulation results show that the algorithm proposed in this paper outperforms Drop Oldest algorithm and Drop Largest algorithm in terms of delivery ratio, delay and network overhead. Article highlights This article proposes a message grouping principle that groups the original messages in a node. When the node buffer overflows, the message is selected from the group of messages to be received for discarding. This article proposes three methods for discarding messages. In the process of discarding messages, this article will choose the corresponding message discarding method based on the number and size of the messages to be received. This article proposes a buffer management algorithm, which considers multiple network attributes and the maximum number of discarded messages.
AbstractList	Abstract In the opportunity network, effective buffer management methods are important means to improve network performance when buffer overflow. Therefore, this article proposes a message grouping based opportunistic network buffer management method. This method first determines the relationship between the buffer space required to receive all messages in the message set and the size of the idle buffer of the node. If the idle buffer of the node is not less than the buffer space occupied by the message set to be received, all messages to be received are received. Otherwise, the number of messages in the message set to be received is further determined, and which messages in the node buffer to discard are selected based on the number of messages in the message set to be received, thereby alleviating the problem of buffer overflow. The simulation results show that the algorithm proposed in this paper outperforms Drop Oldest algorithm and Drop Largest algorithm in terms of delivery ratio, delay and network overhead. In the opportunity network, effective buffer management methods are important means to improve network performance when buffer overflow. Therefore, this article proposes a message grouping based opportunistic network buffer management method. This method first determines the relationship between the buffer space required to receive all messages in the message set and the size of the idle buffer of the node. If the idle buffer of the node is not less than the buffer space occupied by the message set to be received, all messages to be received are received. Otherwise, the number of messages in the message set to be received is further determined, and which messages in the node buffer to discard are selected based on the number of messages in the message set to be received, thereby alleviating the problem of buffer overflow. The simulation results show that the algorithm proposed in this paper outperforms Drop Oldest algorithm and Drop Largest algorithm in terms of delivery ratio, delay and network overhead.Article highlightsThis article proposes a message grouping principle that groups the original messages in a node. When the node buffer overflows, the message is selected from the group of messages to be received for discarding.This article proposes three methods for discarding messages. In the process of discarding messages, this article will choose the corresponding message discarding method based on the number and size of the messages to be received.This article proposes a buffer management algorithm, which considers multiple network attributes and the maximum number of discarded messages. In the opportunity network, effective buffer management methods are important means to improve network performance when buffer overflow. Therefore, this article proposes a message grouping based opportunistic network buffer management method. This method first determines the relationship between the buffer space required to receive all messages in the message set and the size of the idle buffer of the node. If the idle buffer of the node is not less than the buffer space occupied by the message set to be received, all messages to be received are received. Otherwise, the number of messages in the message set to be received is further determined, and which messages in the node buffer to discard are selected based on the number of messages in the message set to be received, thereby alleviating the problem of buffer overflow. The simulation results show that the algorithm proposed in this paper outperforms Drop Oldest algorithm and Drop Largest algorithm in terms of delivery ratio, delay and network overhead. Article highlights This article proposes a message grouping principle that groups the original messages in a node. When the node buffer overflows, the message is selected from the group of messages to be received for discarding. This article proposes three methods for discarding messages. In the process of discarding messages, this article will choose the corresponding message discarding method based on the number and size of the messages to be received. This article proposes a buffer management algorithm, which considers multiple network attributes and the maximum number of discarded messages.
ArticleNumber	1081
Author	Wang, Huiqiang Wang, Hezhe
Author_xml	– sequence: 1 givenname: Hezhe surname: Wang fullname: Wang, Hezhe email: wanghezhe@hrbeu.edu.cn organization: School of Computer Science and Technology, Heilongjiang University, College of Computer Science and Technology, Harbin Engineering University – sequence: 2 givenname: Huiqiang surname: Wang fullname: Wang, Huiqiang organization: College of Computer Science and Technology, Harbin Engineering University
BookMark	eNp9kMtOwzAQRS1UJErpD7CKxDrg59hZVhWPSpXYwNpyHCekauxipwv-HtMgYIVmMSPPvXesc4lmPniH0DXBtwRjeZc45YKWmIoSS8l4yc7QnGHMy4oCmf2ZL9AypR3GmLGsFNUcyVVRH9vWxWIw3nRucH4szL4LsR_fhqI2yTVF8MXgUsrroovheOh9d4XOW7NPbvndF-j14f5l_VRunx8369W2tEzRseQK6lqCUJWzpCZEKCEr50C1hBhlOQAjtlUA0gjjwFinCEhcKwkEN03FFmgz5TbB7PQh9oOJHzqYXp8eQuy0iWNv904zACK4MGAZ4dDyCje5CMEVl8BA5qybKesQw_vRpVHvwjH6_H3NqBAVY1TyrKKTysaQUnTtz1WC9RdvPfHWmbc-8dYsm9hkSlnsOxd_o_9xfQLbSIDZ
Cites_doi	10.1007/s12083-023-01516-7 10.1016/j.comnet.2024.110622 10.1109/TVT.2018.2864292 10.1007/s11277-018-5861-8 10.1007/s11276-019-02241-x 10.1109/TCE.2024.3424239 10.1007/s11276-020-02288-1 10.32604/cmc.2023.039697 10.1109/TIT.2020.3009690 10.1109/TNET.2019.2936636 10.1109/JSAC.2023.3310071 10.1016/j.iot.2024.101425 10.1504/IJAHUC.2019.097640 10.1007/s11277-014-2066-7 10.1016/j.comnet.2024.110865 10.1109/TWC.2022.3143533 10.1109/TVT.2021.3133449 10.1109/TMC.2021.3075993 10.1007/s11277-019-06835-8 10.1007/s11276-015-1085-y 10.1016/j.adhoc.2014.07.032 10.1007/s12083-024-01737-4 10.1049/cmu2.12626 10.1016/j.adhoc.2022.102902 10.1007/s11227-023-05702-5 10.1007/s11276-023-03239-2 10.1007/s11277-019-06543-3 10.1109/TITS.2023.3292592 10.1016/j.adhoc.2023.103307 10.4108/ICST.SIMUTOOLS2009.5674 10.1007/s10922-024-09884-y
ContentType	Journal Article
Copyright	The Author(s) 2025 The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: The Author(s) 2025 – notice: The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	C6C AAYXX CITATION 3V. 7XB 88I 8FE 8FG 8FK ABJCF ABUWG AEUYN AFKRA ATCPS AZQEC BENPR BGLVJ BHPHI BKSAR CCPQU D1I DWQXO GNUQQ HCIFZ KB. L6V M2P M7S PATMY PCBAR PDBOC PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYCSY Q9U DOA
DOI	10.1007/s42452-025-07734-3
DatabaseName	Springer Nature OA Free Journals CrossRef ProQuest Central (Corporate) ProQuest Central (purchase pre-March 2016) Science Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) One Sustainability ProQuest Central UK/Ireland Agricultural & Environmental Science Collection ProQuest Central Essentials ProQuest Central Technology collection Natural Science Collection Earth, Atmospheric & Aquatic Science Collection ProQuest One Community College ProQuest Materials Science Collection ProQuest Central Korea ProQuest Central Student SciTech Premium Collection Materials Science Database ProQuest Engineering Collection Science Database Engineering Database Environmental Science Database Earth, Atmospheric & Aquatic Science Database Materials Science Collection ProQuest Databases ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection Environmental Science Collection ProQuest Central Basic DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef Publicly Available Content Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials Materials Science Collection ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central Earth, Atmospheric & Aquatic Science Collection ProQuest One Applied & Life Sciences ProQuest One Sustainability ProQuest Engineering Collection Natural Science Collection ProQuest Central Korea Agricultural & Environmental Science Collection Materials Science Database ProQuest Central (New) Engineering Collection ProQuest Materials Science Collection Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest One Academic Eastern Edition Earth, Atmospheric & Aquatic Science Database ProQuest Technology Collection ProQuest SciTech Collection Environmental Science Collection ProQuest One Academic UKI Edition Materials Science & Engineering Collection Environmental Science Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	Publicly Available Content Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: KB. name: Materials Science Database url: http://search.proquest.com/materialsscijournals sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	3004-9261 2523-3971
EndPage	16
ExternalDocumentID	oai_doaj_org_article_3661545a6c3146f490d0d01109476367 10_1007_s42452_025_07734_3
GrantInformation_xml	– fundername: the Basic Scientific Research Funds of Universities of Heilongjiang Province grantid: 2022-KYYWF-1045
GroupedDBID	AAJSJ AASML ADMLS ALMA_UNASSIGNED_HOLDINGS C6C EBLON GROUPED_DOAJ M~E NU0 SOJ AAYXX BGNMA CITATION M4Y 0R~ 3V. 7XB 88I 8FE 8FG 8FK AAHNG AAKKN ABDZT ABECU ABEEZ ABFTV ABHQN ABJCF ABKCH ABMQK ABTMW ABUWG ABXPI ACACY ACMLO ACOKC ACSTC ACULB ADKNI ADURQ ADYFF AEJRE AEUYN AFGXO AFKRA AFQWF AGDGC AGJBK AILAN AITGF AJZVZ AMKLP ATCPS AXYYD AZQEC BAPOH BENPR BGLVJ BHPHI BKSAR C24 CCPQU D1I DWQXO EBS FNLPD GNUQQ GNWQR HCIFZ J-C KB. KOV L6V M2P M7S NQJWS OK1 PATMY PCBAR PDBOC PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYCSY Q9U STPWE TSG UOJIU UTJUX VEKWB VFIZW ZMTXR
ID	FETCH-LOGICAL-c382t-486bb76589ec1b1158579ee68f11a8c46631cf8667a5ae6ace81670b87610dd93
IEDL.DBID	M2P
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001586145600012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	3004-9261 2523-3963
IngestDate	Mon Oct 13 19:21:29 EDT 2025 Wed Oct 08 14:30:50 EDT 2025 Sat Nov 29 07:26:03 EST 2025 Tue Sep 30 01:10:33 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	10
Keywords	Congestion avoidance Opportunistic networks Buffer management
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c382t-486bb76589ec1b1158579ee68f11a8c46631cf8667a5ae6ace81670b87610dd93
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
OpenAccessLink	https://www.proquest.com/docview/3255933274?pq-origsite=%requestingapplication%
PQID	3255933274
PQPubID	5758472
PageCount	16
ParticipantIDs	doaj_primary_oai_doaj_org_article_3661545a6c3146f490d0d01109476367 proquest_journals_3255933274 crossref_primary_10_1007_s42452_025_07734_3 springer_journals_10_1007_s42452_025_07734_3
PublicationCentury	2000
PublicationDate	2025-09-29
PublicationDateYYYYMMDD	2025-09-29
PublicationDate_xml	– month: 09 year: 2025 text: 2025-09-29 day: 29
PublicationDecade	2020
PublicationPlace	Cham
PublicationPlace_xml	– name: Cham – name: London
PublicationTitle	Discover applied sciences
PublicationTitleAbbrev	Discov Appl Sci
PublicationYear	2025
Publisher	Springer International Publishing Springer Nature B.V Springer
Publisher_xml	– name: Springer International Publishing – name: Springer Nature B.V – name: Springer
References	MUF Qaisar (7734_CR7) 2022; 22 7734_CR33 L Cao (7734_CR4) 2022; 21 S Khan (7734_CR32) 2023; 77 J Wu (7734_CR2) 2023; 29 A Abbas (7734_CR20) 2024; 80 G Goudar (7734_CR3) 2025; 33 S Nagadivya (7734_CR8) 2023; 16 Savita (7734_CR19) 2019; 108 R Sulma (7734_CR23) 2010; 2 R Cavallari (7734_CR17) 2020; 66 M Ababou (7734_CR29) 2019; 30 N Derakhshanfard (7734_CR30) 2020; 110 DI Elewaily (7734_CR24) 2024; 152 Y Azzoug (7734_CR5) 2022; 133 S Rashid (7734_CR28) 2018; 103 N Das (7734_CR16) 2024; 17 AP Silva (7734_CR25) 2015; 25 Z Du (7734_CR31) 2020; 26 M Moetesum (7734_CR27) 2016; 22 P Kumar (7734_CR9) 2024; 70 R Wang (7734_CR18) 2018; 67 C Han (7734_CR6) 2021; 71 MM Qirtas (7734_CR21) 2020; 26 Z Zheng (7734_CR13) 2023; 41 G Goudar (7734_CR10) 2021; 21 G Wei (7734_CR11) 2025 J Wu (7734_CR14) 2023; 17 R Zhu (7734_CR12) 2024; 251 L Yang (7734_CR15) 2024 S Rashid (7734_CR26) 2015; 80 H Lin (7734_CR1) 2023; 25 D Popescu (7734_CR22) 2019; 27
References_xml	– volume: 16 start-page: 2089 issue: 5 year: 2023 ident: 7734_CR8 publication-title: Peer-to-Peer Netw Appl doi: 10.1007/s12083-023-01516-7 – volume: 251 start-page: 110622 year: 2024 ident: 7734_CR12 publication-title: Comput Netw doi: 10.1016/j.comnet.2024.110622 – volume: 67 start-page: 9983 issue: 10 year: 2018 ident: 7734_CR18 publication-title: IEEE Trans Veh Technol doi: 10.1109/TVT.2018.2864292 – volume: 103 start-page: 1421 issue: 2 year: 2018 ident: 7734_CR28 publication-title: Wirel Pers Commun doi: 10.1007/s11277-018-5861-8 – volume: 26 start-page: 1537 issue: 3 year: 2020 ident: 7734_CR31 publication-title: Wirel Netw doi: 10.1007/s11276-019-02241-x – volume: 22 start-page: 4912 issue: 8 year: 2022 ident: 7734_CR7 publication-title: IEEE Trans Mob Comput – volume: 70 start-page: 6892 issue: 4 year: 2024 ident: 7734_CR9 publication-title: IEEE Trans Consum Electron doi: 10.1109/TCE.2024.3424239 – volume: 26 start-page: 3997 issue: 6 year: 2020 ident: 7734_CR21 publication-title: Wirel Netw doi: 10.1007/s11276-020-02288-1 – volume: 77 start-page: 1303 issue: 1 year: 2023 ident: 7734_CR32 publication-title: Comput Mater Continua doi: 10.32604/cmc.2023.039697 – volume: 66 start-page: 5683 issue: 9 year: 2020 ident: 7734_CR17 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2020.3009690 – volume: 27 start-page: 1901 issue: 5 year: 2019 ident: 7734_CR22 publication-title: IEEE ACM Trans Netw doi: 10.1109/TNET.2019.2936636 – volume: 41 start-page: 3133 issue: 10 year: 2023 ident: 7734_CR13 publication-title: IEEE J Sel Areas Commun doi: 10.1109/JSAC.2023.3310071 – volume: 2 start-page: 118 issue: 9 year: 2010 ident: 7734_CR23 publication-title: Int J Comput Netw Secur – year: 2025 ident: 7734_CR11 publication-title: Internet Things doi: 10.1016/j.iot.2024.101425 – volume: 30 start-page: 114 issue: 2 year: 2019 ident: 7734_CR29 publication-title: Int J Ad Hoc Ubiquitous Comput doi: 10.1504/IJAHUC.2019.097640 – volume: 80 start-page: 993 issue: 3 year: 2015 ident: 7734_CR26 publication-title: Wirel Pers Commun doi: 10.1007/s11277-014-2066-7 – year: 2024 ident: 7734_CR15 publication-title: Comput Netw doi: 10.1016/j.comnet.2024.110865 – volume: 21 start-page: 5801 issue: 8 year: 2022 ident: 7734_CR4 publication-title: IEEE Trans Wirel Commun doi: 10.1109/TWC.2022.3143533 – volume: 71 start-page: 1952 issue: 2 year: 2021 ident: 7734_CR6 publication-title: IEEE Trans Veh Technol doi: 10.1109/TVT.2021.3133449 – volume: 21 start-page: 4471 issue: 12 year: 2021 ident: 7734_CR10 publication-title: IEEE Trans Mob Comput doi: 10.1109/TMC.2021.3075993 – volume: 110 start-page: 2165 issue: 2 year: 2020 ident: 7734_CR30 publication-title: Wirel Pers Commun doi: 10.1007/s11277-019-06835-8 – volume: 22 start-page: 2189 issue: 7 year: 2016 ident: 7734_CR27 publication-title: Wirel Netw doi: 10.1007/s11276-015-1085-y – volume: 25 start-page: 480 year: 2015 ident: 7734_CR25 publication-title: Ad Hoc Netw doi: 10.1016/j.adhoc.2014.07.032 – volume: 17 start-page: 3239 issue: 5 year: 2024 ident: 7734_CR16 publication-title: Peer-To-Peer Netw Appl doi: 10.1007/s12083-024-01737-4 – volume: 17 start-page: 1321 issue: 11 year: 2023 ident: 7734_CR14 publication-title: IET Commun doi: 10.1049/cmu2.12626 – volume: 133 year: 2022 ident: 7734_CR5 publication-title: Ad Hoc Netw doi: 10.1016/j.adhoc.2022.102902 – volume: 80 start-page: 6356 issue: 5 year: 2024 ident: 7734_CR20 publication-title: J Supercomput doi: 10.1007/s11227-023-05702-5 – volume: 29 start-page: 1873 issue: 4 year: 2023 ident: 7734_CR2 publication-title: Wirel Netw doi: 10.1007/s11276-023-03239-2 – volume: 108 start-page: 2639 issue: 4 year: 2019 ident: 7734_CR19 publication-title: Wirel Pers Commun doi: 10.1007/s11277-019-06543-3 – volume: 25 start-page: 3054 issue: 3 year: 2023 ident: 7734_CR1 publication-title: IEEE Trans Intell Transp Syst doi: 10.1109/TITS.2023.3292592 – volume: 152 year: 2024 ident: 7734_CR24 publication-title: Ad Hoc Netw doi: 10.1016/j.adhoc.2023.103307 – ident: 7734_CR33 doi: 10.4108/ICST.SIMUTOOLS2009.5674 – volume: 33 start-page: 1 issue: 1 year: 2025 ident: 7734_CR3 publication-title: J Netw Syst Manag doi: 10.1007/s10922-024-09884-y
SSID	ssj0003307759 ssj0002793483 ssib051670015
Score	2.304885
Snippet	In the opportunity network, effective buffer management methods are important means to improve network performance when buffer overflow. Therefore, this... Abstract In the opportunity network, effective buffer management methods are important means to improve network performance when buffer overflow. Therefore,...
SourceID	doaj proquest crossref springer
SourceType	Open Website Aggregation Database Index Database Publisher
StartPage	1081
SubjectTerms	Algorithms Applied and Technical Physics Buffer management Buffers Chemistry/Food Science Congestion avoidance Earth Sciences Engineering Environment Management methods Materials Science Messages Methods Nodes Opportunistic networks Overflow Principles
SummonAdditionalLinks	– databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SPHgRRcVqlRy8aXCz2c3jWMXiqXhQ6C3ktVWwW-nD3-8ku62tIF5kb5sQhm8ymflIZgahq2DAzzleEtAtI8A3GLHUepJzp5gynJncp2YTYjiUo5F62mj1Fd-ENeWBG-BuGTgQ8PKGOwZGXRUq8_DFOpkFmAZPeeSZUBtkKp7BwNKFKFWbJZNy5eIVX05i91YYYgVhW54oFezfijJ_XIwmfzM4QPttoIj7jYCHaCfUR0j0sV3GjiZ4sn62gs37eAoU_3WCo0vyeFrjSWxsMg445WzA8sfoZfDwfP9I2tYHxDGZL0ghubUCogMVHLUQtclSqBC4rCg10hUQJ1BXSc6FKU3gxgVJucgsnG00816xE9Spp3U4RRgsjouidL6sbBEyLiODCg6WKr3Lqeui6xUM-qOpcKHXtYwTaBpA0wk0zbroLiK1nhmrU6cfoDPd6kz_pbMu6q1w1q3JzDWL5IYxYMlddLPC_nv4d5HO_kOkc7SXp72hSK56qLOYLcMF2nWfi7f57DJtri-OG8q5 priority: 102 providerName: Directory of Open Access Journals
Title	A buffer management algorithm based on message grouping
URI	https://link.springer.com/article/10.1007/s42452-025-07734-3 https://www.proquest.com/docview/3255933274 https://doaj.org/article/3661545a6c3146f490d0d01109476367
Volume	7
WOSCitedRecordID	wos001586145600012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003307759 issn: 3004-9261 databaseCode: DOA dateStart: 20240101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003307759 issn: 3004-9261 databaseCode: M~E dateStart: 20240101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Earth, Atmospheric & Aquatic Science Database customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: PCBAR dateStart: 20190101 isFulltext: true titleUrlDefault: https://search.proquest.com/eaasdb providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: M7S dateStart: 20190101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Environmental Science Database customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: PATMY dateStart: 20190101 isFulltext: true titleUrlDefault: http://search.proquest.com/environmentalscience providerName: ProQuest – providerCode: PRVPQU databaseName: Materials Science Database customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: KB. dateStart: 20190101 isFulltext: true titleUrlDefault: http://search.proquest.com/materialsscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: BENPR dateStart: 20190101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: PIMPY dateStart: 20190101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: M2P dateStart: 20190101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerOpen customDbUrl: eissn: 3004-9261 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002793483 issn: 3004-9261 databaseCode: C24 dateStart: 20210101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LbxMxELag5UAPvFEDJfKBGxhie9ePE0qqVCDUaFVAKifLazspiCQlSTny25lxvSlFggtaySvtw9qdGc98Y3tmCHmePNi5oGoGvJUM_A3JWt5GJlSw0nolvYi52ISeTMzpqW3KhNu6bKvsdGJW1HEZcI78tUTsKyU4UW_OvzOsGoWrq6WExk2yC8iG45auY9F08lRzjEEp5u5rXmSzssqZOQX4X0yC8JU4mhxNh4uAgmF914HWsmLymq3KKf2v4dA_lk6zRTq6-7__co_cKViUDi-F5z65kRYPyN5vGQofEj2k7QWWUKHz7T4Z6r_NoLfN2ZyiDYx0uaBzrKQySzQHicCbj8ino_HHw7es1FpgQRqxYZVRbasBjtgUeAvENLW2KSkz5dybUAEw4WFqlNK-9kn5kAxStwVlygcxWvmY7CyWi7RPKAxxpas6xHraVmmgDLpsKUBXdQyChx550VHVnV-m1HDb5MmZBw544DIPnOyRERJ--ySmw84XlquZK6PLSUAZAAW9ChI0_7SygwgHJlOtQH8q3SMHHSNcGaNrd8WFHnnZsfLq9t8_6cm_e3tKbossRJYJe0B2NquL9IzcCj82X9arPtkdjSfNST87_9C-H73qZ6nFVn_A9ucYnmoOR8MTPL87bj7_Aoez7h4
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB5VBQl64I26UMAHOIFFYjt-HBAqhapVy6qHIvVmEtu7tGJ3y-4WxJ_iNzLjTbYtEtx6QLkljmXlG883k_HMADxPNfJc0BVHbCVHf0PypmwiFzo46WotaxFzswnT79ujI3ewAr-6XBg6VtnpxKyo4yTQP_LXkmxfKdGJenv6jVPXKIqudi00FmKxl37-QJdt9mb3PeL7QojtD4dbO7ztKsCDtGLOldVNY5B4XQplgwaRrYxLSdtBWdY2KKTgMgys1qau6qTrkGypTdGg2iiLGKn4Eqr8a4oqi9FRQXHQyW9F4zp6PclBPSdVrgQq0N_jEoW9zdvJ2XsUdBSc-skWxkjF5SVuzC0ELtm9f4RqMwNu3_7fvt0duNXa2mxzsTnuwkoa34O1CxUY74PZZM0ZtYhho-U5IFZ_HeLq519GjDg-ssmYjahTzDCxnASDbz6AT1ey8oewOp6M0zowVGHaqCrEatCoVGhLLmkKOFUVgyhDD152KPrTRckQvywOnTH3iLnPmHvZg3cE9HIklfvONybToW-1h5doRaGpW-sgkdkGyhURLyoWq5AftOnBRge8b3XQzJ-j3oNXneicP_77kh79e7ZncGPn8OO-39_t7z2GmyILsOPCbcDqfHqWnsD18H1-PJs-zbuDweerFqnfom1ArA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LbxMxEB5VKUJw4F0RKOADnMDqru3144BQoUREhSgHkMrJeG1vAJGkJCmIv8avY-zsphQJbj2gve16LWvn83wzO54ZgIfRIc95WVGULafob3Bal3WgTHrDjZPcsZCbTajRSB8dmfEW_OxyYdKxyk4nZkUd5j79I9_jyfblHJ2ovaY9FjE-GDw7_kpTB6kUae3aaawhchh_fEf3bfl0eICyfsTY4OXbF69o22GAeq7Zigot61ohCZvoyxqNI10pE6PUTVk67QXScekbLaVylYvS-ahLqYoaVUhZhJAKMaH630aTXLAebI-Hb8bvOzRXaWRHtp9ziM9wkeuCMvT-KEfot1k8OZcvhSAZTd1lC6W4oPwMU-aGAmes4D8Ct5kPB1f_5y95Da60VjjZX2-b67AVZzfg8m-1GW-C2if1SWoeQ6abE0LEfZng6lcfpySxfyDzGZmmHjKTSHJ6DL55C96dy8p3oDebz-JtIKjcpBKVD1VTi1hInZzV6HGqKnhW-j487iRqj9fFROymbHSWv0X52yx_y_vwPAl9MzIVAs835ouJbfWK5WhfoRHspOfIeY0wRcArlZEVyBxS9WG3A4FttdPSniKgD086GJ0-_vuS7vx7tgdwEZFkXw9Hh3fhEstYNpSZXeitFifxHlzw31aflov77VYh8OG8MfULtQRK9Q
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+buffer+management+algorithm+based+on+message+grouping&rft.jtitle=Discover+applied+sciences&rft.au=Wang%2C+Hezhe&rft.au=Wang%2C+Huiqiang&rft.date=2025-09-29&rft.issn=3004-9261&rft.eissn=3004-9261&rft.volume=7&rft.issue=10&rft_id=info:doi/10.1007%2Fs42452-025-07734-3&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s42452_025_07734_3
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=3004-9261&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=3004-9261&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=3004-9261&client=summon