(The) MAP/G/1 queue and its applications to ATM networks = MAP/G/1 대기체계와 ATM망에의 응용

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 400
  • Download : 0
The MAP/G/1 queueing system has been considered to study the effects of high burstiness and strong correlation between interarrival times. This type of queueing system can be easily found in broadband-integrated services digital networks (B-ISDNs) based on Asynchronous Transfer Mode (ATM) which is expected to be a suitable transfer mode to integrate various kinds of traffics such as voice, data, image, motion video, and so on. In the analysis of queueing systems with MAPs, the matrix analytic method and Markov renewal theory have been employed until recent years. Note that the matrix analytic method allows no more than one random variable to have the countably infinite state space for the description of system dynamics. However, in most real systems we have models which require two or more random variables, each of which is defined in either a countably infinite space (e.g., the number of customers in the queue) or a continuous space (e.g., the unfinished work in the system, or the elapsed/remaining service time) to describe them properly. For those models the matrix analytic method does not give any help in analysis, and hence a new analytic method should be needed. In this thesis we present how to apply the supplementary variable method to analyze the MAP/G/1 queueing system and its variants which can be applicable for ATM networks. The supplementary variable method is known as a simple and convenient method to derive the double transform of the queue length and the supplementary variable used. To solve the matrix differential equations arising in queueing systems with MAPs when we use the supplementary variable method, we need to extend the notion of Laplace transform for positive real numbers $s$ to that of Laplace transform for matrices S. In chapter 3, we consider a packet voice/data multiplexer which is modeled by the MAP/G/1 queueing system where a single server queue is fed by an MAP and served in first-come-first-served (FCFS) manner, with general ...
Choi, Bong-Dae최봉대
한국과학기술원 : 수학과,
Issue Date
112600/325007 / 000935406

학위논문(박사) - 한국과학기술원 : 수학과, 1997.2, [ [v], [88] p. ; ]


광대역통신망; 휴가시간 대기체계; 대기체계; Vacation; Priority; Queueing system; MAP; ATM network; 우선순위제어

Appears in Collection
Files in This Item
There are no files associated with this item.


  • mendeley


rss_1.0 rss_2.0 atom_1.0