Browsing by Author "CHANG, CJ"

Now showing 1 - 20 of 31

A 2-THRESHOLD REACTIVE CONGESTION CONTROL FOR NETWORK TERMINATION OF B-ISDN
(1993)
CHANG, CJ
;
KAO, HC
;
電信工程研究所
;
Institute of Communications Engineering
A CROSS-CLASSIFICATION ANALYSIS OF THE EFFECTIVENESS OF SAFETY HELMETS IN MOTORCYCLE ACCIDENT INJURIES
(1981)
CHANG, CJ
;
交大名義發表
;
National Chiao Tung University
A FINITE-BUFFERED CELLULAR MOBILE RADIO SYSTEM WITH VARIOUS MULTIPLE-CALL PLATFORMS
(1994)
CHANG, CJ
;
YEH, YH
;
SU, TT
;
電信工程研究所
;
Institute of Communications Engineering
A NEW RECURSIVE METHOD FOR THE MEAN WAITING TIME IN A POLLING NETWORK WITH GATED GENERAL ORDER SERVICE
(1994-08-01)
CHANG, CJ
;
HWANG, LC
;
電信工程研究所
;
電信研究中心
;
Institute of Communications Engineering
A new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.
A SCHEDULING MECHANISM OF GENERAL SERVICE ORDER SEQUENCE AND LIMITED SERVICE DISCIPLINE FOR A DISTRIBUTED SWITCHING SOFTWARE
(1994)
CHANG, CJ
;
HWANG, LC
;
電信工程研究所
;
Institute of Communications Engineering
A SIMULATION STUDY ON THE SERVICE STRATEGIES FOR PACKET VOICE COMMUNICATION-NETWORKS
(1991-10-07)
CHANG, CJ
;
WONG, JW
;
CHIU, JH
;
電信工程研究所
;
電信研究中心
Two service strategies for packet voice communication networks are studied by simulation in this paper. The first one is the first-packet-first-priority (FPFP) service strategy. This strategy gives the packet firstly generated in a talkspurt the first priority. The second one is the maximum-delay-first-serve (MDFS) service strategy. This strategy gives the more delayed voice packet the higher priority. The FPFP and the MDFS strategies are proposed in order to match with the null timing information (NTI) and the complete timing information (CTI) reassembly schemes adopted at a packet voice receiver in Barberis and Pazzaglia's "Analysis and optimal design of a packet voice receiver", respectively, to improve the network performance. These two strategies are also compared with the simple first-in-first-out (FIFO) service strategy. The results show that the MDFS strategy has the smallest delay variation and loss rate of voice packet, the FIFO strategy has the middle values, while the FPFP strategy has the maximum.
A SIMULATION STUDY ON THE SERVICE STRATEGIES FOR PACKET VOICE COMMUNICATION-NETWORKS
(1991-10-07)
CHANG, CJ
;
WONG, JW
;
CHIU, JH
;
電信研究中心
;
Center for Telecommunications Research
Two service strategies for packet voice communication networks are studied by simulation in this paper. The first one is the first-packet-first-priority (FPFP) service strategy. This strategy gives the packet firstly generated in a talkspurt the first priority. The second one is the maximum-delay-first-serve (MDFS) service strategy. This strategy gives the more delayed voice packet the higher priority. The FPFP and the MDFS strategies are proposed in order to match with the null timing information (NTI) and the complete timing information (CTI) reassembly schemes adopted at a packet voice receiver in Barberis and Pazzaglia's "Analysis and optimal design of a packet voice receiver", respectively, to improve the network performance. These two strategies are also compared with the simple first-in-first-out (FIFO) service strategy. The results show that the MDFS strategy has the smallest delay variation and loss rate of voice packet, the FIFO strategy has the middle values, while the FPFP strategy has the maximum.
ANALYSIS OF A CUTOFF PRIORITY CELLULAR RADIO SYSTEM WITH FINITE QUEUING AND RENEGING/DROPPING
(1994-04-01)
CHANG, CJ
;
SU, TT
;
CHIANG, YY
;
電信工程研究所
;
電信研究中心
Queueing of new or handoff calls can minimize blocking probabilities or increase total carried traffic. This paper investigates a new cutoff priority cellular radio system that allows Smite queueing of both new and handoff calls. We consider the reneging from the system of queued new calls due to caller impatience and the dropping of queued handoff calls by the system as they move out of a handoff area before being accomplished successfully. We use signal-flow graphs and Mason's formula to obtain the blocking probabilities of new and handoff calls and the average waiting times. Moreover, an optimal cutoff parameter and appropriate queue sizes for new and handoff calls are numerically determined so that a proposed overall blocking probability is minimized.
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.
ANALYSIS OF AN INTEGRATED MULTIPLEXER WITH ALL QUEUEABLE AND FIXED-LENGTH TRAFFICS IN INTERMEDIATE NODE
(1992-07-01)
CHANG, CJ
;
WANG, SY
;
交大名義發表
;
電信工程研究所
;
National Chiao Tung University
An integrated multiplexer in intermediate node is analyzed. The multiplexer is modeled as a system with multiple synchronous servers (channels) and having two kinds of customers. Between the two, one is wideband (WB) and the other is narrowband (NB); they are queueable with the same deterministic service time. The WB customer is given higher priority of channel access than the NB. To incorporate the delay constraint of WB, we use a simple instant discarding scheme(8) for WB. As a result, the system states defined just after the beginning of a slot form an one-dimensional embedded Markov chain. This makes the analysis computationally tractable. The performance measures such as queue length distribution, average blocking probability, and average waiting time are obtained, particularly, the waiting time distribution. Some interesting numerical examples are discussed. Simulation results are also provided to help verify the validity of analysis.
ANALYSIS OF COMBINED BUOYANCY EFFECTS OF THERMAL AND MASS DIFFUSION ON LAMINAR FORCED-CONVECTION HEAT-TRANSFER IN A VERTICAL TUBE
(1988-05-01)
LIN, TF
;
CHANG, CJ
;
YAN, WM
;
交大名義發表
;
機械工程學系
ANALYSIS OF PACKET-SWITCHED DATA IN A NEW BASIC RATE USER-NETWORK INTERFACE OF ISDN
(1994-12-01)
CHANG, CJ
;
DAI, MD
;
電信工程研究所
;
電信研究中心
;
Institute of Communications Engineering
We present here an exact method for analyzing the queueing behavior of packet-switched data in a new basic rate user-network interface of ISDN. The new interface of ISDN in this paper adopts statistical multiplexing for providing integrated voice and data services. In order to properly represent the arrival of multirate data service, this interface assumes that the data packet input process is in batch Poisson. Furthermore, it is modeled by a multiple synchronous servers with priority queues and finite waiting room with complete rejection strategy. The analytical method, with an application of the residue theorem in complex variable, can accurately obtain the performance measures of data.
ANALYSIS OF STATISTICAL VOICE PACKET MULTIPLEXER WITH DNA MODEL
(1991-11-01)
CHANG, CJ
;
WANG, YH
;
交大名義發表
;
電信工程研究所
;
National Chiao Tung University
A discrete and near-uniform arrival (DNA) model is proposed to analyze a statistical voice packet multiplexer. The DNA model assumes that the arrival process of aggregate voice packets from several voice sources in talkspurt be in a discrete mode with near-uniform distribution over a packetization time. Finite queue size for the statistical voice packet multiplexer is also assumed. Results of the probability distribution functions of the queue length and the packet delay are obtained; the optimal packet length is also determined by the 99.9th percentile of delay.
ANALYSIS OF SYNCHRONOUS AND ASYNCHRONOUS TRAFFIC IN AN FDDI NETWORK
(1993)
CHANG, CJ
;
WU, HW
;
電信研究中心
;
Center for Telecommunications Research
COMBINED HEAT AND MASS-TRANSFER IN NATURAL-CONVECTION BETWEEN VERTICAL PARALLEL PLATES
(1988)
YAN, WM
;
LIN, TF
;
CHANG, CJ
;
交大名義發表
;
機械工程學系
ERROR CONTROL STRATEGIES FOR CUT-THROUGH SWITCHING NETWORK
(1990-10-25)
CHANG, CJ
;
WANG, JI
;
交大名義發表
;
電信工程研究所
;
National Chiao Tung University
NATURAL-CONVECTION FLOWS IN A VERTICAL, OPEN TUBE RESULTING FROM COMBINED BUOYANCY EFFECTS OF THERMAL AND MASS DIFFUSION
(1986-10-01)
CHANG, CJ
;
LIN, TF
;
YAN, WM
;
機械工程學系
;
Department of Mechanical Engineering
NONLINEAR OPTICAL PROPERTIES AND POLING DYNAMICS OF A SIDE-CHAIN POLYIMIDE DISPERSE-RED DYE FILM - INSITU OPTICAL 2ND-HARMONIC GENERATION STUDY
(1994-01-01)
HUANG, JY
;
LIAO, CL
;
CHANG, CJ
;
WHANG, WT
;
交大名義發表
NONLINEAR OPTICAL PROPERTIES AND POLING DYNAMICS OF A SIDE-CHAIN POLYIMIDE DISPERSE-RED DYE FILM - INSITU OPTICAL 2ND-HARMONIC GENERATION STUDY
(1994-01-01)
HUANG, JY
;
LIAO, CL
;
CHANG, CJ
;
WHANG, WT
;
交大名義發表
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.