2002
DOI: 10.1023/a:1012959023043
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 287 publications
(18 citation statements)
references
References 8 publications
0
18
0
Order By: Relevance
“…The proposed IDBA algorithm is designed to allocate the bandwidth in a decentralized manner and support QoS prospects. The interleaved polling with adaptive cycle tim (IPACT) [23] and Enhanced Decentralized DBA (EDDBA) [24].…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…The proposed IDBA algorithm is designed to allocate the bandwidth in a decentralized manner and support QoS prospects. The interleaved polling with adaptive cycle tim (IPACT) [23] and Enhanced Decentralized DBA (EDDBA) [24].…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…(1) to (8) are repeatedly executed in each DBA cycle. Therefore, we can set an ultra-short T data value.…”
Section: Proposed Dba Methodsmentioning
confidence: 99%
“…However, the efficiency of bandwidth utilization with the NSR method is lower than with the SR method [7]. IPACT [8] can reduce the GPT owing its simple SR-DBA method, but latency increases as the number of linked up ONUs increases because of the adaptive DBA cycle depends the amounts of requests from the ONUs. In addition, priority control is beyond its scope.…”
Section: Introductionmentioning
confidence: 99%
“…However, it is inefficient because traffic nature is not homogeneous and not continuous [4][5][6]. In this way, algorithms which distribute the available bandwidth in a dynamic way, called Dynamic Bandwidth Allocation algorithms (DBA), are necessary to adapt the network capacity to traffic conditions by changing the distribution of the bandwidth assigned to each ONU depending on the current requirements [5][6][7][8][9][10][11][12][13][14][15][16][17].…”
Section: Introductionmentioning
confidence: 99%
“…This behaviour causes a waste of time during the waiting period [7][8][9][10]. In polling schemes, the OLT allocates bandwidth to each ONU for the next cycle before the last packet of the previous one arrives, resulting in efficient upstream channel utilization [6,[11][12][13]. The algorithm called Interleaved Polling with Adaptive Cycle Time (IPACT) is one of the most efficient polling algorithms in which ONUs are polled individually in a round robin fashion [11].…”
Section: Introductionmentioning
confidence: 99%