Priority queueing systems and its applications to ATM networks = 우선순위를 갖는 대기체계와 ATM망에의 응용

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 383
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChoi, Bong-Dae-
dc.contributor.advisor최봉대-
dc.contributor.authorLee, Yu-Tae-
dc.contributor.author이유태-
dc.date.accessioned2011-12-14T04:38:35Z-
dc.date.available2011-12-14T04:38:35Z-
dc.date.issued1997-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=128454&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/41792-
dc.description학위논문(박사) - 한국과학기술원 : 수학과, 1997.8, [ iv, 73 p. ]-
dc.description.abstractThe Broadband Integrated Services Digital Network(B-ISDN) will support a wide variety of communication services with different Quality of Service (QoS)requirements. The Asynchronous Transfer Mode(ATM) has already been selected by the ITU-T as the target solution for implementing the B-ISDN. In an ATM network, various types of traffic are statistically multiplexed to utilize the network resources efficiently. Due to the consequence of statistical multiplexing, the network has to deal with random and unpredictable overflows. The priority control is necessary to enhance the efficiency of resource satisfying greatly different QoS requirements of various types of traffic. In this thesis, we analyze various priority queueing systems which has applications to the performance analysis of ATM networks. In Chapter 3, we consider a $Geo^{X_1},Geo^{X_2}/D/c$ Head-of-Line(HOL) priority queueing system with random order selection within each priority class. The motivation of this study comes from the performance analysis of an ATM non-blocking packet switch with capacity c and input queues. We assume that packets arrive at input queues according to independent and identical Bernoulli processes. As the main work of this chapter, we obtain the joint queue length distribution and the waiting time of each class. This waiting time corresponds to the packet contention time at ATM packet switch. In Chapter 4,we consider an M/G/1/K queueing system with two classes of customers, where the system is controlled by a push-out scheme. By using simple recursive equations, we obtain the Laplace-Stieltjes transform``s of the waiting time and the push-out time of a low priority customer. These results are then used to derive the loss probabilities for both classes. Then, from the above results, we can also obtain the mean waiting time of a high priority customer. In Chapter 5, we investigate an ATM buffer management strategy with multiple delay and loss priorities based on four different...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectPush-Out-
dc.subjectMultiple priority-
dc.subject우선순위 대기체계-
dc.subjectHOL-
dc.subjectPriority queue-
dc.subject비동기 전송방식-
dc.subjectATM-
dc.titlePriority queueing systems and its applications to ATM networks = 우선순위를 갖는 대기체계와 ATM망에의 응용-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN128454/325007-
dc.description.department한국과학기술원 : 수학과, -
dc.identifier.uid000945305-
dc.contributor.localauthorChoi, Bong-Dae-
dc.contributor.localauthor최봉대-
Appears in Collection
MA-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