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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discover applied sciences Jg. 7; H. 10; S. 1081 - 16
Hauptverfasser: Wang, Hezhe, Wang, Huiqiang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 29.09.2025
Springer Nature B.V
Springer
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:3004-9261
2523-3963
3004-9261
2523-3971
DOI:10.1007/s42452-025-07734-3