Scheduling and drop policies for traffic differentiation on vehicular delay-tolerant networks
Type
article
conferenceObject
conferenceObject
Publisher
Identifier
SOARES, Vasco N. G. J. ; FARAHMAND, Farid; RODRIGUES, Joel J. P. C. - Scheduling and drop policies for traffic differentiation on vehicular delay-tolerant networks. In International Conference on Software, Telecommunications and Computer Networks, 17, Split, 24-26 Setembro 2009. SoftCOM 2009. [S. l.] : IEEE, 2009. p. 353-357
978-1-4244-4973-6
Title
Scheduling and drop policies for traffic differentiation on vehicular delay-tolerant networks
Subject
Vehicular delay-tolerant networks
Mobile radio
Routing protocols
Scheduling
Mobile radio
Routing protocols
Scheduling
Date
2011-03-09T15:19:53Z
2011-03-09T15:19:53Z
2009-09-24
2011-03-09T15:19:53Z
2009-09-24
Description
“Copyright © [2009] IEEE. Reprinted from 17th International Conference on Software, Telecommunications & Computer Networks, 2009. SoftCOM 2009.ISBN:978-1-4244-4973-6. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”
Vehicular Delay-Tolerant Networks (VDTNs) are a promising technology for vehicular communications, creating application scenarios that enable non-real time services with diverse performance requirements. Because of scarce network resources (e.g. bandwidth and storage capacity) and node’s short contact durations, the underlying VDTN network infrastructure must be capable of prioritizing traffic. This paper investigates several scheduling and drop policies, which can be used to implement traffic differentiation. Priority Greedy, Round Robin, and Time Threshold scheduling polices are proposed. In terms of drop policy, the message with the lowest priority and the lowest remaining time-to-live is discarded first. We evaluate their efficiency and tradeoffs, through simulation. The results presented in this paper can be used as a starting point for further studies in this research field, and give helpful guidelines for future VDTN protocol design.
Part of this work has been supported by Instituto de Telecomunicações, Next Generation Networks and Applications Group (NetGNA), Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of the Seventh Framework Programme of EU.
Vehicular Delay-Tolerant Networks (VDTNs) are a promising technology for vehicular communications, creating application scenarios that enable non-real time services with diverse performance requirements. Because of scarce network resources (e.g. bandwidth and storage capacity) and node’s short contact durations, the underlying VDTN network infrastructure must be capable of prioritizing traffic. This paper investigates several scheduling and drop policies, which can be used to implement traffic differentiation. Priority Greedy, Round Robin, and Time Threshold scheduling polices are proposed. In terms of drop policy, the message with the lowest priority and the lowest remaining time-to-live is discarded first. We evaluate their efficiency and tradeoffs, through simulation. The results presented in this paper can be used as a starting point for further studies in this research field, and give helpful guidelines for future VDTN protocol design.
Part of this work has been supported by Instituto de Telecomunicações, Next Generation Networks and Applications Group (NetGNA), Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of the Seventh Framework Programme of EU.
Access restrictions
restrictedAccess
Language
eng
Comments
