• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2786-2800
• /
• 1997

In this paper, we investigate how well the channel memory (statistical dependence in the occurrence of transmission errors) can be used in the evaluation of widely used error control schemes. For this we assume a special case named as the simplest Markovian block-error pattern with two states, in which each block is classified into two classes of whether the block transmission is in error or not. We apply the derived pattern to the performance evaluation of the practical link-level procedures, LAPB/D/M with multi-reject options, and investigate both throughput and user-perceived response time behaviors on the discrete-time domain to determine how much the performance of error recovery action is improved under burst error condition. Through numerical examples, we show that the simplest Markovian block-error pattern tends to be superior in throughput and delay characteristics to the random error case. Also, instead of mean alone, we propose a new measure of the response time specified as mean plus two standard deviations 50 as to consider user-perceived worst cases, and show that it results in much greater sensitivity to parameter variations than does mean alone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.227-236
• /
• 1986

In this paper, an integrated voice/data packet network with window flow control is modeled by a colsed multichain queueing system, and its performance is analyzed by the mean value analysis method. Particularly, for the analysis of a packet network having various kinds of messages with different priority classes, we introduce an approach based on the mean value analysis and the concept of effective capacity. By the mathematical analysis and computer simulation, we obtain the following network statistics in the steady state: Mean buffer occupancy at each node, utilization of link throughput of a virtual channel, and mean delay time of each message. Our iterative analysis method can predict the link data status in most cases within about 10 percent of accurady, and the statistics of voice messages and external data within 5 percent as compared to simulation results.

• ETRI Journal
• /
• v.25 no.1
• /
• pp.34-40
• /
• 2003

This paper considers a TMN-based management system for the management of public ATM switching networks using a four-level hierarchical structure consisting of one network management system, several element management systems, and several agent-ATM switch pairs. Using Jackson's queuing model, we analyze the effects of one TMN command on the performance of the component ATM switch in processing local calls. The TMN command considered is the permanent virtual call connection. We analyze four performance measures of ATM switches- utilization, mean queue length and mean waiting time for the processor directly interfacing with the subscriber lines and trunks, and the call setup delay of the ATM switch- and compare the results with those from Jackson's queuing model.

• Annual Conference of KIPS
• /
• 2001.10b
• /
• pp.1533-1536
• /
• 2001

This paper considers the TMN system for management of public ATM switching network which has the four-level hierarchical structure consisting of one network management system, a few element management system and several agent-ATM switch pairs, respectively. The effects of one TMN command on the local call processing performance of the component ATM switch an analyzed using Jackson's queueing model. The TMN command considered is the permanent virtual call connection, and the performance measures of ATM switch are the utilization, mean queue length and mean waiting time for the processor interfacing the subscriber lines and trunks directly, and the call setup delay of the ATM switch.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.673-689
• /
• 2009

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.4
• /
• pp.263-268
• /
• 2007

It applied the linear tapped delay line structure to the least mean square algorithm and the recursive least square algorithm it investigated the mean square error characteristics of compensation algorithm. The purpose of this paper is to propose multi-tap update algorithm, which is superior to compensation capacity of data, and then compare and analyze it from the perspective of convergence characteristics at time invariant transmission channel and frequency selective fading channel.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.5
• /
• pp.345-352
• /
• 2017

We propose a methods which is reducing direction estimation error of sound source in the reverberant and noisy environments. The proposed algorithm divides speech signal into voice and unvoice using VAD. We estimate the direction of source when current frame is voiced. TDOA (Time-Difference of Arrival) between microphone array using the GCC-PHAT (Generalized Cross Correlation with Phase Transform) method will be estimated in that frame. Then, we compare the peak value of cross-correlation of two signals applied to estimated time-delay with other time-delay in time-table in order to improve the accuracy of source location. If the angle of current frame is far different from before and after frame in successive voiced frame, the angle of current frame is replaced with mean value of the estimated angle in before and after frames.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.6
• /
• pp.533-544
• /
• 1991

In this paper, the performance of bridges used to interconnect LAN to FD야 backbone networks as well as the performance of MAC protocols for FD야 backbone networks were thoroughly analyzed, The exhaustive service discipline and three ource models were applied to analyze the mean waiting time of the system. the performance is evaluated in terms of the service rate of bridge, total load of backbone. medium length of back bone, value of T and station latency. The result of analysis show that in general , processing delay of the system is mainly determined by bridge delays. But when processing time of bridge mereases, processing delays of the system are primarily determined by MAC protocols. Therefore, speed-up of processing time of bridge is necessary to efficiently use the high speed backbone networks.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.2D
• /
• pp.233-239
• /
• 2006

Most research for until at now link travel time were research for mean link travel time calculate or estimate which uses the average of the individual vehicle. however, the link travel time distribution is divided caused by with the impact factor which is various traffic condition, signal operation condition and the road conditional etc. preceding study result for link travel time distribution characteristic showed that the patterns of going through traffic were divided up to 2 in the link travel times. therefore, it will be more accurate to divide up the link travel time into the one involving delay and the other without delay, rather than using the average link travel time in terms of assessing the traffic situation. this study is it analyzed transit hour distribution characteristic and a cause using examine to the variables which give an effect at link travel time distribute using simulation program and determinate link travel time distribute ratio estimation model. to assess the distribution of the link travel times, this research develops the regression model and the fuzzy model. the variables that have high level of correlations in both estimation models are the rest time of green ball and the delay vehicles. these variables were used to construct the methods in the estimation models. The comparison of the two estimation models-fuzzy and regression model- showed that fuzzy model out-competed the regression model in terms of reliability and applicability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.114-129
• /
• 2005

In this paper, we examine Interleaved Polling with Adaptive Cycle Time (IPACT) algorithm which was proposed to control upstream traffic for Gigabit Ethernet-PONs, and we analyze the performance of the gated service and the limited service of the IPACT mathematically. For the mathematical performance analysis, we model IPACT algorithm as a polling system and use mean-value analysis. We divide arrival rate λ value into three regions and analyze each region accordingly. We obtain average packet delay, average queue size and average cycle time of both the gated and the limited service. We compare analytical results with simulation to verify the accuracy of the mathematical analysis. Upon now, simulation analysis have been used to evaluate the performance of EPONs, which require much time sud effort. Mathematical analysis can be widely used in the design of EPON systems since system designers can obtain various performance results rapidly.