DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hwang, Gang-Uk | - |
dc.contributor.advisor | 황강욱 | - |
dc.contributor.author | Moon, Ki-Hyo | - |
dc.contributor.author | 문기효 | - |
dc.date.accessioned | 2011-12-14T04:56:10Z | - |
dc.date.available | 2011-12-14T04:56:10Z | - |
dc.date.issued | 2008 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=296225&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/42178 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2008.2, [ iv, 19 p. ] | - |
dc.description.abstract | We analyze the queueing performance of a relay network by using a simulation model and a Markov chain of SNR. We consider two relay channels, fixed-to-mobile channel and mobile-to-mobile channel. Jake`s model is used to construct the simulation model for the relay channel. The equal duration method is used to construct a Markov chain of the relay channel. We present queueing lengths and waiting times of the queue to compare the simulation model and the Markov chain. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Queueing | - |
dc.subject | Relay | - |
dc.subject | Fading | - |
dc.subject | Simulation | - |
dc.subject | Markov | - |
dc.subject | 큐잉 | - |
dc.subject | 릴레이 | - |
dc.subject | 페이딩 | - |
dc.subject | 시뮬레이션 | - |
dc.subject | 마르코프 | - |
dc.subject | Queueing | - |
dc.subject | Relay | - |
dc.subject | Fading | - |
dc.subject | Simulation | - |
dc.subject | Markov | - |
dc.subject | 큐잉 | - |
dc.subject | 릴레이 | - |
dc.subject | 페이딩 | - |
dc.subject | 시뮬레이션 | - |
dc.subject | 마르코프 | - |
dc.title | Analysis of a queueing system in a relay network with fading channels | - |
dc.title.alternative | 릴레이 채널에서의 큐잉 시스템의 분석 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 296225/325007 | - |
dc.description.department | 한국과학기술원 : 수리과학과, | - |
dc.identifier.uid | 020063161 | - |
dc.contributor.localauthor | Hwang, Gang-Uk | - |
dc.contributor.localauthor | 황강욱 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.