Virtual minimum potential queuing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Chul Ki | - |
dc.contributor.author | Jeong, Deog Kyoon | - |
dc.contributor.author | Shim, Yong Chul | - |
dc.date.accessioned | 2022-01-14T09:44:27Z | - |
dc.date.available | 2022-01-14T09:44:27Z | - |
dc.date.created | 2022-01-14 | - |
dc.date.issued | 2007 | - |
dc.identifier.issn | 0926-6801 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/24315 | - |
dc.description.abstract | We propose Virtual Minimum Potential Queuing (VMPQ) which provides a simple virtual time update function with O(1) complexity. While Weighted Fair Queuing (WFQ) provides low latency and good fairness, the virtual time update function has O(V) complexity for serving V busy flows. Start Potential Fair Queuing (SPFQ), which updates virtual time with a reduced complexity of O(log V), provides a fairness index very close to WFQ. Some other algorithms reduce virtual time update complexity further, but they degrade the fairness index significantly. VMPQ recalibrates virtual time using a virtual minimum potential, which is calculated with only a pre- computed constant and the finish time of the packet selected for transmission. This method requires O(1) complexity for the recalibration. Additionally, it does not affect the maximum latency and keeps fairness index to be almost identical to SPFQ. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IOS PRESS | - |
dc.subject | PACKET-SWITCHED NETWORKS | - |
dc.subject | ALGORITHMS | - |
dc.title | Virtual minimum potential queuing | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Shim, Yong Chul | - |
dc.identifier.scopusid | 2-s2.0-49049096333 | - |
dc.identifier.wosid | 000256838700001 | - |
dc.identifier.bibliographicCitation | JOURNAL OF HIGH SPEED NETWORKS, v.16, no.4, pp.323 - 339 | - |
dc.relation.isPartOf | JOURNAL OF HIGH SPEED NETWORKS | - |
dc.citation.title | JOURNAL OF HIGH SPEED NETWORKS | - |
dc.citation.volume | 16 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 323 | - |
dc.citation.endPage | 339 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | PACKET-SWITCHED NETWORKS | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | fair queuing | - |
dc.subject.keywordAuthor | virtual time update | - |
dc.subject.keywordAuthor | O(1) complexity | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.