2014
DOI: 10.1109/tmc.2013.25
|View full text |Cite
|
Sign up to set email alerts
|

Performance Modeling of Delay-Tolerant Network Routing via Queueing Petri Nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…QPN has proven to be an effective tool to model various computing systems, eg, the studies of Mahendran, Gunasekaran, and Murthy and Chakraborty, due to the integration of queueing disciplines in the ordinary places of classic Petri networks. The variety and complexity of IMS nodes and components require such modeling power, which we have applied in our model in this section.…”
Section: The Modelmentioning
confidence: 99%
“…QPN has proven to be an effective tool to model various computing systems, eg, the studies of Mahendran, Gunasekaran, and Murthy and Chakraborty, due to the integration of queueing disciplines in the ordinary places of classic Petri networks. The variety and complexity of IMS nodes and components require such modeling power, which we have applied in our model in this section.…”
Section: The Modelmentioning
confidence: 99%
“…To the best of our knowledge, little has been done to understand the performance of DTNs under realistic settings involving the interplay of diverse factors such as bundle fragmentation, scheduling, and buffer spacing. So Mahendran et al [15] take Queueing Petri Nets (QPNs) as a modeling framework to study the performance of DTN routing and develop QPN models for DTNs. The complete QPN model considers a number of realistic factors that impact performance such as finite buffer space, finite link bandwidth, bundles with different priorities and intra-scheduling delays arising due to different levels of the memory hierarchy at the nodes.…”
Section: A Routing Algorithmsmentioning
confidence: 99%
“…Among them, (12), (15) and (18) suggest the driver to maintain the current speed. In order to avoid parking, (13), (16) and (19) suggest the driver to accelerate to the maximum speed in the current traffic light cycle.…”
Section: B Calculation Policy To the Recommended Speedmentioning
confidence: 99%
See 1 more Smart Citation
“…Subramanian and Fekri [26] analyze the efficiency of multihop routing over two-hop routing for multiple unicasts in DTNs with finite-sized buffer. Gunasekaran et al [27], [28] apply Queuing Petri-Net and derive the end-to-end delivery delay from the modeled semi-Markov process. Khouzani et al [29] investigate an energy-aware optimal epidemic routing in DTNs by a threshold-based scheme, where the forwarding probability is determined by relay node's current remaining energy.…”
Section: Content Delivery In Dtnsmentioning
confidence: 99%