Browsing by Author "LIN, PC"

Now showing 1 - 3 of 3

ANALYSIS OF AN ATM MULTIPLEXER WITH CORRELATED REAL-TIME AND INDEPENDENT NON-REAL-TIME TRAFFIC
(1994-12-01)
CHANG, CJ
;
CHEN, JM
;
LIN, PC
;
電信工程研究所
;
電信研究中心
This paper presents an alternative traffic model for an ATM multiplexer providing video, voice, image, and data services. The traffic model classifies the input traffic into two types: real-time and non-real-time. The input process for real-time traffic is periodic and correlated, while that for non-real-time traffic is batch Poisson and independent. This multiplexer is assumed to be a priority queueing system with synchronous servers operating on time-frame basis and with separate finite buffers for each type of traffic. State probabilities and performance measures are successfully obtained using a Markov analysis technique and an application of the residue theorem in complex variable. The results can be applied in the design of an ATM multiplexer.
ON A HIGH-RANKING NODE OF B-ISDN
(1994-01-01)
CHANG, CJ
;
LIN, PC
;
CHEN, JM
;
電信工程研究所
;
電信研究中心
The paper studies a high-ranking node in a broadband integrated services digital network (B-ISDN). The input traffic is classified into two types: real-time and non-real-time. For each type of input traffic, we assume that the message arrival process is a batch Poisson process and that the message size is arbitrarily distributed so as to describe services from narrowband to wideband. We model the high-ranking node by a queueing system with multiple synchronous servers and two separate finite buffers, one for each type of traffic. We derive performance measures exactly by using a two-dimensional imbedded discrete-time Markov chain analysis, within which the transition probabilities are obtained via an application of the residue theorem in complex variables. The performance measures include the blocking probability, delay, and throughput.
STUDY ON OPTIMAL QUEUE-LENGTH-THRESHOLD SCHEDULING POLICY FOR AN ATM MULTIPLEXER WITH FINITE BUFFERS AND BATCH POISSON ARRIVALS
(1994-01-01)
CHANG, CJ
;
LIN, PC
;
CHEN, JM
;
電信工程研究所
;
Institute of Communications Engineering
This paper studies an optimal queue-length-threshold (QLT) scheduling policy for an ATM multiplexer with two types of traffic: real-time and nonreal-time. The proposed QLT scheduling policy is that if the number of queued nonreal-time packets is greater than or equal to a threshold value alpha, c2 servers are allocated to the nonreal-time traffic and the rest c1(= c - C2) servers are scheduled with priority policy that the real-time are given higher priority over the nonreal-time; otherwise all the c servers are scheduled with priority policy. The arrival process for each type of trafic is assumed to be batch Poisson with arbitrarily positive integer-valued probability distributions so as to describe the different bandwidth-requirement traffic from narrowband (NB) to wideband (WB). The multiplexer is modeled as a multiple synchronous-server system with separate finite buffers for each type of traffic. Performance measures are exactly derived by using a two-dimensional imbedded Markov-chain approach and the transition probabilities are exactly obtained via the application of residue theorem in complex variable. A trade-off between the effective measures of the two types of traffic is discussed under different (c2, alpha). Some performance criteria are defined to intend to determine an optimal QLT scheduling policy. This optimal QLT policy can indeed improve the performance criterion above 2-3% over the priority policy.