• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.783-792
• /
• 2003

We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K＋B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.274-280
• /
• 2013

This paper proposes a space merging approach to studying the queuing models with finite buffers and jump priorities. Upon the arrival of a call with low priority, one call of such kind is assumed to be transferred to the end of the queue of high priority calls. The transfer probabilities depend on the state of the queue of the heterogeneous calls. We developed the algorithms to calculate the quality of service metrics of such queuing models, and the results of the numerical experiments are shown.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.861-873
• /
• 2000

Rate-based flow control plays an important role for efficient traffic management of Available Bit Rate(ABR) services. We deal with the problem of the buffer dimension for rate-based ABR control. In this paper, we analyze the Allowed Cell Rate(ACR) of a source and the queue size in a steady state. First, we investigate the effect of the number of active sources on the behavior of the ACR and the maximum queue size. Reflecting the effect of this real scenes, we determine the optimal buffer size and buffer threshold. Furthermore, our analytic results are compared with the case when the effect of the number of active sources is disregarded.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.59-66
• /
• 2000

In this paper we propose an approximation analysis for the system size distribution of the M/G/c system which is transform-free,. At first we borrow the system size distribution from the Markovian service models and then introduce a newly defined parameter in place of traffic intensity. In this step we find the distribution of the number of customers up to c. Next we concentrate on each waiting space of the queue separately rather than consider the entire queue as a whole. Then according to the system state of the arrival epoch we induce the probability distribution of the system size recursively. We discuss the effectiveness of this approximation method by comparing with simulation for the mean system size.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1668-1669
• /
• 2007

In this paper, we propose nonlinear congestion controller for active queue management of differentiated-services networks. Two important issues in differentiated-services architecture are bandwidth guarantee and fair sharing of unsubscribed bandwidth among TCP flows with and without bandwidth reservation. The nonlinear congestion controller was composed fuzzy logic controller and state feedback controller. The nonlinear congestion controller methodology has been applied to a TCP network. We use NS-2 simulation to demonstrate that the proposed control methodology achieves the desired behavior of the network, and possesses important attributes.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3011-3018
• /
• 2000

On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.435-444
• /
• 1995

We propose a new approach to the calculation of the exact cells loss probability in a shared buffer ATM multiplexer, which is loaded with homogeneous discrete-time ON-OFF sources. Renewal cycles are identified in regard to the state of input sources and the buffer state on each renewal circle is modelled as a K(shared buffer size)-state Markov chain. We also analyze the behavior of queue build-up at the shared buffer whose distribution together with the steady-state probabilities of the Markov chain leads to the exact cell loss probability. Our approach to obtaining the exact cell loss probability seems to be more efficient than most of other existing ones since our underlying Markov chain has less number of states.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.1
• /
• pp.13-20
• /
• 2012

This paper proposes a marine engine state monitoring system using a DPQ (Distributed Precedence Queue) mechanism which collects the state of bearings, temperature and pressure of engine through the CAN network. The CAN is developed by Bosch Corp. in the early 1980' for automobile network. The data from various sensors attached in the marine engine are converted to digital by the analog to digital converter and formatted to fit the CAN protocol at the CAN module. All the CAN modules are connected to the SPU (Signal Processing Unit) module for the efficient communication and processing. This design reduces the cost for wiring and improves the data transmission reliability by recognizing the sensor errors and data transmission errors. The DPQ mechanism is newly developed for the performance improvement of the marine engine system, which is demonstrated through the experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.867-875
• /
• 2003

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.