Analysis of finite-capacity polling systems based on virtual buffering and lumped modeling = 가상 버퍼 및 집중형 모델을 이용한 제한된 용량의 버퍼를 갖는 폴링 시스템에 대한 성능 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 329
  • Download : 0
The main objective of this dissertation is to analyze the performance of two finite-capacity polling ststems from which we investigate the behavior of two well-known media assess protocols in local area networks:the token ring and the slotted ring. First, we analyze the performance of a general asymmetric polling system where each station has a finite-capacity buffer and exhaustive service descipline. The system is a generalized analytic model of the token ring. Since it is very difficult to describe the exact behavior of the finite-buffer polling system, we introduce a model system named as the virtual buffer model which yields the same performance of the original system. In the virtual buffer model, we assume that each station has a temporary virtual buffer with infinite capacity attached to the real buffer while the server is unavailabe to the station. The virtual buffer stores all those packets which are forced to be lost due to the limitation of the real buffer capacity. Choosing as imbedded points the instants when the server visits each station (called polling instants), we build a Markov chain whose state consists of the queue lengths of all stations. We note that in the exhaustive service discipline the server leaves a station only when there are no waiting packets in the buffer. Thus, from the margianl queue length distribution of the station at each polling instant, we readily derive the intervisit time distribution of the station. Then, we obtain the performance measures of the station such as the waiting time distribution, the blocking probability, and the cycle time distribution, using the known results for a single M/G/1/K queneing system with multiple vacations. Next, we present an analysis of a high-speed slotted ring where each station has a single-packet buffer. Since we consider a high-speed network, the slot size is assumed to be large enough to hold a whole packet. Assuming that distances between stations affect the network performance onl...
Advisors
Un, Chong-Kwanresearcher은종관researcher
Description
한국과학기술원 : 전기 및 전자공학과,
Publisher
한국과학기술원
Issue Date
1991
Identifier
61735/325007 / 000845305
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기 및 전자공학과, 1991.8, [ vii, 99 p. ]

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