A study on delay performance of schedulers in aggregate traffic environments집합 트래픽 수용 네트워크에서의 스케줄러 지연 성능 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 478
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorPark, Hong-Shik-
dc.contributor.advisor박홍식-
dc.contributor.authorKim, Myoung-Hoon-
dc.contributor.author김명훈-
dc.date.accessioned2011-12-28T02:43:55Z-
dc.date.available2011-12-28T02:43:55Z-
dc.date.issued2006-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392589&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/54554-
dc.description학위논문(박사) - 한국정보통신대학교 : 공학부, 2006, [ x, 135 p. ]-
dc.description.abstractThere are two major drivers for network services with QoS guarantees. One comes from applications with stringent QoS requirements. Two possible examples of such applications are IP telephony, video-on-demand, IP TV over the Internet. The other major driver for network QoS is the need for service differentiation due to competitive nature of the marketplace. In recent years the highlighted Differentiated Services (DiffServ), aggregate class-based traffic management and control have been used to mitigate scalability issues of Integrated Services (IntServ) in backbone networks. Fair Queueing schedulers can provide service isolation and guarantee QoS to all aggregate classes by reserving certain ratio of service-to-arrival rates. Although the GPS variants provide the network operator with a set of class differentiation parameters (i.e. the proportional bandwidth share of each class), the actual queueing delays at a bandwidth allocation server depend on the bandwidth share, and the input load and traffic burstiness of each class. Consequently, although the bandwidth differentiation is controllable, the short term delay guarantee is not. It is widely assumed that attempting to provide deterministic QoS guarantees for the aggregate traffic classes is difficult due to the unpredictable temporal and spatial variations in the aggregate traffic. First contribution of this dissertation is to guarantee absolute delay constraint in aggregate network. Although Fair Queueing can control the bandwidth differentiation, it can not guarantee absolute delay constraint because the forwarding resources allocated to each class do not follow the actual class load variations. We propose Absolute Delay Guaranteed Round Robin (ADRR) to support hard delay constraint by following the actual class load variations. Second contribution of this dissertation is to guarantee the short term delay while being able to attain long term fairness in aggregate QoS network. It is important to main...eng
dc.languageeng-
dc.publisher한국정보통신대학교-
dc.subjectDeficit and Surplus Estimator-
dc.subjectDelay Guaranteed Deficit Round Robin-
dc.subjectAbsolute Delay Guaranteed Deficit Round Robin-
dc.subjectAggregate QoS Network-
dc.subjectElapsing Time based Priority-
dc.subject공정성-
dc.subject절대적 지연 보장-
dc.subject서비스 별 차별화-
dc.subject집합 트래픽 수용 네트워크-
dc.subjectETP-
dc.titleA study on delay performance of schedulers in aggregate traffic environments-
dc.title.alternative집합 트래픽 수용 네트워크에서의 스케줄러 지연 성능 연구-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN392589/225023-
dc.description.department한국정보통신대학교 : 공학부, -
dc.identifier.uid020015316-
dc.contributor.localauthorPark, Hong-Shik-
dc.contributor.localauthor박홍식-
Appears in Collection
School of Engineering-Theses_Ph.D(공학부 박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0