• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.952-960
• /
• 1996

In this paper, a new overload control scheme is proposed for a control system in ATM switching system. The proposed control scheme includes a counter that conunts the number of accepted calls and is decreased at cach D time interval. In overload condition of call processor, the control scheme detects over load condition when the counter value reaches a certain threshold value. Under overload condition, processor utilization is measured and the value of the D is updataed according to the difference between measured processor utilization and target utilization. A new call is accepted accepted only if the value of the counter is less than the threshold value. In overflow condition of cell traffic, accept probability of new call is reduced exponetially according to the elapsed time. The results of simulation show that the proposed overload contorl scheme maintains the target utilization very well under the various processor overload conditions and reduces the cell loss probability under the cell overflow conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.842-856
• /
• 1994

The various services that a broadband integrated services digital network (B-ISDN) carries, have a wide range of delay, delay jitter and cell loss probability requirements. Design of appropriate control schemes for B-ISDN is an extremely important and challenging problem. In this paper, we proposed multiplexing algorithm with both delay and loss priorities in order to satisfy the diverse requirements. For the implementation of cell lose priority, we assumed that voice cells are generated as non-discardable(i.e., high priority) and discardable (i.e., low priotity)cells. The low priority voice cell may be discarded inside the network if congestion occurs. The cell dropping scheme is shown to reduce cell losses as well as delays for both voice and data. Such a load shedding scheme is expected to improve significantly utilization of B-ISDN.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.890-895
• /
• 2004

This paper describes constant alarm rates process of millimeter wave radar that exits on non-stationary target detection schemes in the ground clutter conditions. The comparison of various CFAR processes such as CA(Cell-Average)-CFAR, GO(Greatest Of)/SO(Smallest Of)-CFAR and OS(Order Statistics)-CFAR performance are applied. Using matlab software, we show the performance and loss between detection probability and signal to noise ratio. When rang bins increase, this results show the OS-CFAR process performance is better than any others and satisfies the optimal detection probability without loss of detection in the homogeneous clutter.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.603-627
• /
• 1998

The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.889-894
• /
• 1993

Asychronous Transfer Mode (ATM) provides the means to transport different types of bursty traffic such as voice, video, and bulk data. To handle more efficiently the traffic sources and to increase the bandwidth utilization as much as possible, flexible statistical multiplexing schemes must be adopted for the ATM networks. This paper presents an efficient computational procedure to calculate the queue state distribution in a finite buffer queueing system with a number of independent input sources, and the cell loss probability is exactly calculated with the use of this recursion computation method. The cell loss probability is related to a ATM multiplexer with a homogeneous ON-OFF source is also investigated through numerical examples.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.931-940
• /
• 2001

In this paper, I propose Fuzzy Policing Mechanism(FPM) over ATM networks for the control of traffic which is unpredictable and bursty source. The FPM is consist of counter, subtracter and Fuzzy Logic Controller(FLC). The FLC is divided to fuzzifier, inference engine and defuzzifer The output of FLC inputs to the subtractor and it controls the counter. The counter works as a switch in transmission of cells. In simulation, I compared the FPM with the Leaky Bucket algorithm(LBM) in cell loss probability and performance characteristics. As a result, FPM gives lower cell loss probability than that of LBM and has good response behavior The FPM efficiently controls the transmission of packets which are variable traffic source and, it also has good selectivity.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.81-95
• /
• 2001

This paper models and evaluates the AAL multiplexer to analyze AAL protocol in ATM networks. We consider an AAL multiplexer in which a single periodically determinsitic CBR traffic stream and several variable size bursty background traffic streams are multiplexed and one ATM cell stream goes out. We model the AAL multiplexer as a B/sup X/ + D/D/1/K queue and analyze this queueing system. We represent various performance measures such as loss probability and waiting time in the basis of cell and packet.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.305-314
• /
• 1996

In the paper, we divide the ATM cells generated by multimedia systems that want to transmit multimedia informations over B-ISDN into two categories:i)a media cell with a media information and ii) a synchronization cell with a synchronization information. We induce a media cell loss equation and a synchroni- zation cell loss equation based on probability distribution functions with on-off source as an input traffic model. In order to meet the requirements of real-time and integrity of multimedia informations, multimedia synchronization cells should provide the delay-sensitive and the loss-sensitive requirements. A traffic control mechanism needs to satisfy above requirements. According to the performance evaluation by a traffic control model simulation, we describe both spatial priority for minimizing the synchronization cell loss and temporal priority for reducing the synchronization cell delay must be applied simultaneously.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.1-16
• /
• 1997

The cell loss probability recommended in the B-ISDN is in the range $10^{-8}~10^{-12}$. When a simulation technique is used to analyze the performance of the ATM node, an enormous amount of computer processing time is required. In this study, we derive an importance sampling simulation technique that can be used to evaluate the performance of the ATM node very quickly, that is, the probability that the queue size at the ATM node reaches some large value N. The simulation results show that the backlog probability obtianed by the importance saimpling simulation is very close to that obtained by the ordinary simulation and the computer time can be reduced drastically by the importance sampling simulation.