2012
DOI: 10.1007/s11107-012-0383-x
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and simulation of a delay-based service differentiation algorithm for IPACT-based PONs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…This strategy favors the creation of short HP cycles and long LP cycles, with a predefined ratio between them. In this paper we showed simulation results of this idea, fully developed in [13]. Then we introduced un upper bound on the HP cycle times in order to set a hard limit to HP traffic delay, and analysed its impact on LP traffic loss.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This strategy favors the creation of short HP cycles and long LP cycles, with a predefined ratio between them. In this paper we showed simulation results of this idea, fully developed in [13]. Then we introduced un upper bound on the HP cycle times in order to set a hard limit to HP traffic delay, and analysed its impact on LP traffic loss.…”
Section: Discussionmentioning
confidence: 99%
“…This new algorithm forces the transmission of high-priority traffic more often than low-priority one such that the expected average cycle time for high-priority packets is much smaller (and also proportional and configurable) than for low-priority ones. A complete explanation of this algorithm and the proposed analytical model can be found in [13] We shall start by reviewing the formulae ruling delay in regular IPACT in the next section.…”
Section: Delay Differentiation In Pon and Related Workmentioning
confidence: 99%