DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Dan-Keun | - |
dc.contributor.advisor | 성단근 | - |
dc.contributor.author | Nam, Seung-Yeob | - |
dc.contributor.author | 남승엽 | - |
dc.date.accessioned | 2011-12-14 | - |
dc.date.available | 2011-12-14 | - |
dc.date.issued | 2004 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=240717&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/35245 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2004.8, [ vii, 148 p. ] | - |
dc.description.abstract | The capacity of core networks has increased tremendously due to recent technology development in optical transmission and high-speed router/ethernet switches. However, IP networks originally designed to provide best-effort services can not guarantee strict or statistical quality-of-service (QoS) requirements for real-time traffic flows because resources are not reserved and all packets are treated equally in most nodes. Thus, it is very important to monitor network status and manage network resources in order to guarantee QoS for flows with real-time performance requirements. Since the delay performance strongly depends on the available band-width of the path among many network resources, this dissertation is concerned with monitoring the available bandwidth and proposing an admission control scheme of internet flows based on the estimated available bandwidth. First, a new mechanism is proposed to estimate the available bandwidth of a queueing system, whose service rate and the load of input traffic are not known in advance. In order to estimate the available bandwidth, we propose a probing method called a minimally backlogging method and propose two statistics. The first statistic is based on the delay of each probing packet and the second statistic is based on the amount of probing packets served in a specific time interval. We first show that an M/G/1 queueing system is stable when probing packets are sent to the system according to the minimally backlogging method. We also show that the available bandwidth can be estimated by using either of the two statistics if the probing packets are sent to the queueing system by the minimally backlogging method. Especially, the second statistic can be used to estimate the available bandwidth of a G/G/1 queueing system. We apply the theory developed for a single server. in order to estimate the available bandwidth for a local server as an application. The accuracy of the two proposed statistics is evaluated numerically ... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | QUALITY OF SERVICE | - |
dc.subject | IP NETWORKS | - |
dc.subject | ADMISSION CONTROL | - |
dc.subject | AVAILABLE BANDWIDTH | - |
dc.subject | ADMISSIBLE BANDWIDTHVIEW STEREOON | - |
dc.subject | 허용 대역다중-영상 스테레오 변환차분법 | - |
dc.subject | 서비스 품질 | - |
dc.subject | 인터넷 | - |
dc.subject | 수락 제어 | - |
dc.subject | 가용 대역 | - |
dc.title | Available bandwidth estimation and measurement-based admission control in IP networks | - |
dc.title.alternative | 인터넷 망에서의 가용대역 예측과 측정 기반의 수락 제어 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 240717/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학전공, | - |
dc.identifier.uid | 000995119 | - |
dc.contributor.localauthor | Sung, Dan-Keun | - |
dc.contributor.localauthor | 성단근 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.