Depth first traversal algorithm for the back-off tree of distributed queuing
An analytic model was provided for the conventional distributed queueing (DQ) and its back-off tree operations, followed by a design of improving algorithm based on depth first traversal.Combing the specific analysis of complete binary tree with generalized extension by random tree reconstruction, t...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2021-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021044/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850123288355799040 |
|---|---|
| author | Wennai WANG Yanhe ZHANG Wei WU Chen BAI Bin WANG |
| author_facet | Wennai WANG Yanhe ZHANG Wei WU Chen BAI Bin WANG |
| author_sort | Wennai WANG |
| collection | DOAJ |
| description | An analytic model was provided for the conventional distributed queueing (DQ) and its back-off tree operations, followed by a design of improving algorithm based on depth first traversal.Combing the specific analysis of complete binary tree with generalized extension by random tree reconstruction, the performance of proposed algorithm was evaluated on the throughput in both theory and simulation experiment.A theoretic optimal solution of contention slots of DQ frame and a brief description of simulation extension based on the open source NS-3 were presented.The simulation results show that the maximum stationary throughput by the proposed algorithm reaches 70% of the physical capacity of channel. |
| format | Article |
| id | doaj-art-63134e03cab045b5863e5e304a09fae8 |
| institution | OA Journals |
| issn | 1000-436X |
| language | zho |
| publishDate | 2021-02-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-63134e03cab045b5863e5e304a09fae82025-08-20T02:34:39ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2021-02-0142728059740245Depth first traversal algorithm for the back-off tree of distributed queuingWennai WANGYanhe ZHANGWei WUChen BAIBin WANGAn analytic model was provided for the conventional distributed queueing (DQ) and its back-off tree operations, followed by a design of improving algorithm based on depth first traversal.Combing the specific analysis of complete binary tree with generalized extension by random tree reconstruction, the performance of proposed algorithm was evaluated on the throughput in both theory and simulation experiment.A theoretic optimal solution of contention slots of DQ frame and a brief description of simulation extension based on the open source NS-3 were presented.The simulation results show that the maximum stationary throughput by the proposed algorithm reaches 70% of the physical capacity of channel.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021044/random multiple accessdistributed queuingexponential back-off treedepth first searchingperformance evaluation |
| spellingShingle | Wennai WANG Yanhe ZHANG Wei WU Chen BAI Bin WANG Depth first traversal algorithm for the back-off tree of distributed queuing Tongxin xuebao random multiple access distributed queuing exponential back-off tree depth first searching performance evaluation |
| title | Depth first traversal algorithm for the back-off tree of distributed queuing |
| title_full | Depth first traversal algorithm for the back-off tree of distributed queuing |
| title_fullStr | Depth first traversal algorithm for the back-off tree of distributed queuing |
| title_full_unstemmed | Depth first traversal algorithm for the back-off tree of distributed queuing |
| title_short | Depth first traversal algorithm for the back-off tree of distributed queuing |
| title_sort | depth first traversal algorithm for the back off tree of distributed queuing |
| topic | random multiple access distributed queuing exponential back-off tree depth first searching performance evaluation |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021044/ |
| work_keys_str_mv | AT wennaiwang depthfirsttraversalalgorithmforthebackofftreeofdistributedqueuing AT yanhezhang depthfirsttraversalalgorithmforthebackofftreeofdistributedqueuing AT weiwu depthfirsttraversalalgorithmforthebackofftreeofdistributedqueuing AT chenbai depthfirsttraversalalgorithmforthebackofftreeofdistributedqueuing AT binwang depthfirsttraversalalgorithmforthebackofftreeofdistributedqueuing |