• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.1-6
• /
• 2006

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.271-275
• /
• 2005

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.2
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.10
• /
• pp.1911-1915
• /
• 2009

The problem of determining the proper capacity of electric vehicle charging station is studied in the presented paper. Based on the expected arrival rate and the expected charging time, we calculate the proper capacity that guarantees electric vehicles get service better than a given lower bound which is termed the loss of charging probability. The problem is studied by using certain queueing models. We first formulate the problem as a queueless model of type M/M/n/n, known as the Erlang loss system. And then the M/M/n/K type queueing model is formulated to consider the parking space constraint. Results of the study may be used for designing the electric vehicle charging station.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.2
• /
• pp.139-146
• /
• 2002

The third generation mobile communication needs to provide multimedia service with increased data rates. Thus an efficient allocation of radio and network resources is very important. This paper models the 'burst switching' as an efficient radio resource allocation scheme and the performance is compared to the circuit and packet switching. In burst switching, radio resource is allocated to a call for the duration of data bursts rather than an entire session or a single packet as in the case of circuit and packet switching. After a stream of data burst, if a packet does not arrive during timer2 value ($\tau_{2}$), the channel of physical layer is released and the call stays in suspended state. Again if a packet does not arrive for timerl value ($\tau_{1}$) in the suspended state, the upper layer is also released. Thus the two timer values to minimize the sum of access delay and queuing delay need to be determined. In this paper, we focus on the decision of $\tau_{2}$ which minimizes the access and queueing delay with the assumption that traffic arrivals follow Poison process. The simulation, however, is performed with Pareto distribution which well describes the bursty traffic. The computational results show that the delay and the packet loss probability by the burst switching is dramatically reduced compared to the packet switching.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.692-699
• /
• 2000

We build and analyze some types of queueing model to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Internet backbone network. We assume that the IWU has a FIFO buffer to transmit IP packets to the Internet through the backbone. In order to analyze the system, we use a Poisson process and an MMPP process as input traffic models of IP packets and we use a general service time distribution as a service time model. But we use both an exponential service time and a deterministic service time in numerical examples for simple and efficient performance comparisons. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effect of arrival rate, buffer size and link capacity on packet loss and mean delay.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.45-52
• /
• 2009

In this paper, we develop queueing network models of communication networks with reliability model considering link failures. The reliability of a communication network with a virtual connection exposed to link failures is analyzed. Stochastic Reward Nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. It is shown that SRN modeling is well suited to specify, automatically generate and solve for reliability under rerouting. Markov models using SRN are developed and solved to depict various rerouting caused by link failures and reliability analysis in communication networks.