DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pyun, K | ko |
dc.contributor.author | Song, Junehwa | ko |
dc.contributor.author | Lee, Heung-Kyu | ko |
dc.date.accessioned | 2009-12-11T01:41:13Z | - |
dc.date.available | 2009-12-11T01:41:13Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2003-12 | - |
dc.identifier.citation | COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, v.43, no.5, pp.669 - 694 | - |
dc.identifier.issn | 1389-1286 | - |
dc.identifier.uri | http://hdl.handle.net/10203/14627 | - |
dc.description.abstract | The number of real-time applications, such as video-on-demand and video conferencing, is rapidly increasing. Real-time data now occupies a significant portion of network traffic. These applications require real-time service; as such, they need to bound end-to-end delays. Generally, real-time service is provided by reserving bandwidth in advance. Thus, to admit a large number of real-time applications, bandwidth needs to be reserved efficiently. In addition, to share limited bandwidth effectively among multiple agencies, a link-sharing service is required. A link-sharing service provides a guaranteed share of link bandwidth to each agency. To provide both real-time and link-sharing services simultaneously, several hierarchical link-sharing schemes have been proposed. However, existing hierarchical schemes still have problems in achieving a high level of network utilization, especially when variable-bit-rate (VBR) video sessions participate in a hierarchy. The problem is serious since a large portion of real-time applications transmit MPEG-coded VBR data. We propose a new scheduling algorithm that can achieve a high level of network utilization even with VBR video sessions. The proposed scheduling algorithm is a hierarchical link-sharing scheme; it is an extension of the H-FSC generalized with a new bandwidth reservation scheme. The new scheme provides tight bandwidth reservations for VBR video sessions. Even with the advantage in network utilization, the generalized H-FSC does not require high overhead for scheduling; the scheduling complexity remains the same as that of the H-FSC. (C) 2003 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | QUEUING ALGORITHMS | - |
dc.subject | VBR VIDEO | - |
dc.subject | REAL-TIME | - |
dc.subject | DELAY | - |
dc.subject | QUALITY | - |
dc.subject | SCHEME | - |
dc.title | A generalized hierarchical fair service curve algorithm for high network utilization and link-sharing | - |
dc.type | Article | - |
dc.identifier.wosid | 000186480500008 | - |
dc.identifier.scopusid | 2-s2.0-0142062601 | - |
dc.type.rims | ART | - |
dc.citation.volume | 43 | - |
dc.citation.issue | 5 | - |
dc.citation.beginningpage | 669 | - |
dc.citation.endingpage | 694 | - |
dc.citation.publicationname | COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Song, Junehwa | - |
dc.contributor.localauthor | Lee, Heung-Kyu | - |
dc.contributor.nonIdAuthor | Pyun, K | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | packet scheduling | - |
dc.subject.keywordAuthor | guaranteed service | - |
dc.subject.keywordAuthor | quality-of-service | - |
dc.subject.keywordAuthor | service curve | - |
dc.subject.keywordPlus | QUEUING ALGORITHMS | - |
dc.subject.keywordPlus | VBR VIDEO | - |
dc.subject.keywordPlus | REAL-TIME | - |
dc.subject.keywordPlus | DELAY | - |
dc.subject.keywordPlus | QUALITY | - |
dc.subject.keywordPlus | SCHEME | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.