Quasi-Pushout Cell Discarding
| dc.citation.epage | 148 | en_US |
| dc.citation.issue | 5 | en_US |
| dc.citation.spage | 146 | en_US |
| dc.citation.volume | 1 | en_US |
| dc.citation.woscount | 4 | |
| dc.contributor.author | Lin, Yu-Sheng | en_US |
| dc.contributor.author | Shung, C. Bernard | en_US |
| dc.contributor.department | 電子工程學系及電子研究所 | zh_TW |
| dc.contributor.department | Department of Electronics Engineering and Institute of Electronics | en_US |
| dc.date.accessioned | 2014-12-08T15:01:31Z | |
| dc.date.available | 2014-12-08T15:01:31Z | |
| dc.date.issued | 1997-09-01 | en_US |
| dc.description.abstract | Cell discarding takes place when the buffer space of a network node is used up. Though Pushout cell discarding was found to achieve fair buffer utilization and good cell loss performance, it is difficult to implement because of the large number of queue length comparisons. In this letter, we propose Quasi-Pushout cell discarding which reduces the number of queue length comparisons by employing the concept of quasi-longest queue. Simulation results under bursty and imbalanced traffic conditions show that Quasi-Pushout can achieve comparable cell loss performance as Pushout at a much lower complexity. | en_US |
| dc.identifier.doi | 10.1109/4234.625041 | en_US |
| dc.identifier.issn | 1089-7798 | en_US |
| dc.identifier.journal | IEEE COMMUNICATIONS LETTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/4234.625041 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/361 | |
| dc.identifier.wosnumber | WOS:000207086900009 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Cell loss performance | en_US |
| dc.subject | pushout discarding | en_US |
| dc.title | Quasi-Pushout Cell Discarding | en_US |
| dc.type | Article | en_US |