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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 477
  • Download : 0
There 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...
Advisors
Park, Hong-Shikresearcher박홍식researcher
Description
한국정보통신대학교 : 공학부,
Publisher
한국정보통신대학교
Issue Date
2006
Identifier
392589/225023 / 020015316
Language
eng
Description

학위논문(박사) - 한국정보통신대학교 : 공학부, 2006, [ x, 135 p. ]

Keywords

Deficit and Surplus Estimator; Delay Guaranteed Deficit Round Robin; Absolute Delay Guaranteed Deficit Round Robin; Aggregate QoS Network; Elapsing Time based Priority; 공정성; 절대적 지연 보장; 서비스 별 차별화; 집합 트래픽 수용 네트워크; ETP

URI
http://hdl.handle.net/10203/54554
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392589&flag=dissertation
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