Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
A simple FIFO-based scheme for differentiated loss guarantees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Pervasive and Mobile Computing
Competitive FIFO Buffer Management for Weighted Packets
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
An optimal joint scheduling and drop policy for Delay Tolerant Networks
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Prioritized Buffer Management Policy for Wireless Sensor Nodes
WAINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops
Scheduling and drop policies for traffic differentiation on vehicular delay-tolerant networks
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Adaptive optimal buffer management policies for realistic DTN
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Context- and social-aware middleware for opportunistic networks
Journal of Network and Computer Applications
TTL based routing in opportunistic networks
Journal of Network and Computer Applications
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
| Hi-index | 0.00 |
Messages in delay-tolerant networks (DTNs) are generally classified by relative priority into low, medium, and high priority classes, thus creating challenges in structuring scheduling and drop policies of a traffic management system. This study proposes a novel traffic management strategy for DTNs. The proposed scheme improves message deliveries of different priority classes by utilizing message properties such as estimated total number of replicas, elapsed time, and remaining time-to-live. A delete mechanism of delivered messages is also incorporated to use buffer space efficiently. The performance of the proposed strategy is verified via implementation of a simulation model along with existing scheduling and drop policies and is tested with two well-known real-world trace datasets. The results demonstrate that the proposed strategy yields improved message deliveries of high priority as well as medium and low priority classes.