DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Dan-Keun | - |
dc.contributor.advisor | 성단근 | - |
dc.contributor.author | Park, Won-Young | - |
dc.contributor.author | 박원영 | - |
dc.date.accessioned | 2011-12-14 | - |
dc.date.available | 2011-12-14 | - |
dc.date.issued | 2007 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=268727&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/35421 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2007. 8, [ x, 126 p. ] | - |
dc.description.abstract | We consider a bandwidth optimization problem in a Generalized Processor Sharing (GPS) server with multiple class queues to minimize the total bandwidth such that QoS requirements for each class queue are satisfied. Since it is difficult to obtain analytically evaluate the performance such as the delay distribution for self-similar input traffic in a GPS server, an optimized bandwidth vector is obtained using simulation based optimization technique. The conventional optimization algorithm requires rather long simulation time to solve the problem by using exterior penalty function methods. We propose a weight vector adjustment scheme that improves the performance of some classes and degrades other classes. We propose a new bandwidth optimization algorithm based on the weight vector adjustment scheme without complex calculations. In numerical results, the required time to find the optimal bandwidth allocation in GPS servers is greatly reduced. Then, we characterize the performance of a GPS server. We show that we can find the unique optimal solution by using the proposed algorithm. In addition to the bandwidth optimization in the GPS server, an end-to-end bandwidth optimization algorithm is proposed. To support the end-to-end QoS requirements, a QoS partitioning algorithm is proposed to reduce the complexity of the end-to-end bandwidth algorithm. We use a linear model to obtain optimal parameters in GPS network. By partitioning the end-to-end QoS requirements into multiple single node QoS requirements, we can use a single node optimization algorithm to solve the end-to-end bandwidth optimization problem. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Internet traffic | - |
dc.subject | QoS | - |
dc.subject | GPS scheduling | - |
dc.subject | Bandwidth allocation | - |
dc.subject | optimization | - |
dc.subject | 인터넷 트래픽 | - |
dc.subject | QoS | - |
dc.subject | GPS 스케줄링 | - |
dc.subject | 대역 할당 | - |
dc.subject | 최적화 | - |
dc.subject | Internet traffic | - |
dc.subject | QoS | - |
dc.subject | GPS scheduling | - |
dc.subject | Bandwidth allocation | - |
dc.subject | optimization | - |
dc.subject | 인터넷 트래픽 | - |
dc.subject | QoS | - |
dc.subject | GPS 스케줄링 | - |
dc.subject | 대역 할당 | - |
dc.subject | 최적화 | - |
dc.title | Bandwidth allocation algorithm for supporting differentiated quality of services in the internet | - |
dc.title.alternative | 인터넷에서 차별화된 QoS를 지원하기 위한 대역 할당 방법 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 268727/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학전공, | - |
dc.identifier.uid | 020005127 | - |
dc.contributor.localauthor | Sung, Dan-Keun | - |
dc.contributor.localauthor | 성단근 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.