1973
DOI: 10.1049/piee.1973.0112
|View full text |Cite
|
Sign up to set email alerts
|

Waiting time in common-control queuing system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Thus, basic message dropping policies maximize the average delivery rate or minimize the average delivery delay. Zhang et al [Zhang et al, 2011] present a simple message prioritization scheme for multi-copy routing solutions based on First-Come-First-Serve (FCFS) [Chan et al, 1973].…”
Section: Discussionmentioning
confidence: 99%
“…Thus, basic message dropping policies maximize the average delivery rate or minimize the average delivery delay. Zhang et al [Zhang et al, 2011] present a simple message prioritization scheme for multi-copy routing solutions based on First-Come-First-Serve (FCFS) [Chan et al, 1973].…”
Section: Discussionmentioning
confidence: 99%
“…Thus, basic message dropping policies maximize the average delivery rate or minimize the average delivery delay. Zhang et al [48] present a simple message prioritization scheme for multi-copy DTN routing solutions based on First-Come-First-Serve (FCFS) [3].…”
Section: Related Work On Dtn Buffer Managementmentioning
confidence: 99%