DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tae-Joon Kim | ko |
dc.contributor.author | Byung-Cheol Shin | ko |
dc.contributor.author | Cho, Dong-Ho | ko |
dc.date.accessioned | 2007-05-17T06:42:42Z | - |
dc.date.available | 2007-05-17T06:42:42Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1999-04 | - |
dc.identifier.citation | IEEE COMMUNICATIONS LETTERS, v.3, no.4, pp.116 - 118 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.uri | http://hdl.handle.net/10203/134 | - |
dc.description.abstract | Quota-based fairness control on a ring with spatial reuse inherently brings about bandwidth waste due to a nature of fairness control. This letter suggests a cycle window and proposes a fairness control scheme based on a two-layer window composed of cycle and packet windows, under which the otherwise wasted bandwidth can be reused to carry, in advance, packets allocated to future fairness cycles. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | A two-layer window-based fairness control scheme for rings with spatial reuse | - |
dc.type | Article | - |
dc.identifier.wosid | 000080421000012 | - |
dc.identifier.scopusid | 2-s2.0-0033357961 | - |
dc.type.rims | ART | - |
dc.citation.volume | 3 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 116 | - |
dc.citation.endingpage | 118 | - |
dc.citation.publicationname | IEEE COMMUNICATIONS LETTERS | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Cho, Dong-Ho | - |
dc.contributor.nonIdAuthor | Tae-Joon Kim | - |
dc.contributor.nonIdAuthor | Byung-Cheol Shin | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | fairness control | - |
dc.subject.keywordAuthor | ring network | - |
dc.subject.keywordAuthor | spatial reuse | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.