Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Yu-Shengen_US
dc.contributor.authorShung, C. Bernarden_US
dc.date.accessioned2014-12-08T15:01:31Z-
dc.date.available2014-12-08T15:01:31Z-
dc.date.issued1997-09-01en_US
dc.identifier.issn1089-7798en_US
dc.identifier.urihttp://dx.doi.org/10.1109/4234.625041en_US
dc.identifier.urihttp://hdl.handle.net/11536/361-
dc.description.abstractCell 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.language.isoen_USen_US
dc.subjectCell loss performanceen_US
dc.subjectpushout discardingen_US
dc.titleQuasi-Pushout Cell Discardingen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/4234.625041en_US
dc.identifier.journalIEEE COMMUNICATIONS LETTERSen_US
dc.citation.volume1en_US
dc.citation.issue5en_US
dc.citation.spage146en_US
dc.citation.epage148en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000207086900009-
dc.citation.woscount4-
Appears in Collections:Articles


Files in This Item:

  1. 000207086900009.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.