• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.3
• /
• pp.247-255
• /
• 2002

The objective of this paper is to clarify the decomposition property for $M^{X}$/G/1 queues with generalized vacations so that the decomposition property is better understood and becomes more applicable. As an example model, we use the $M^{X}$/G/1 queue with setup time. For this queue, we correct Choudhry's (2000) steady-state queue size PGF and derive the steady-state waiting time LST. We also present a meaningful interpretation for the decomposed steady-state waiting time LST.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.317-323
• /
• 2007

Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of the information on Internet traffic makes this problem particularly suited to fuzzy methodologies. We propose a new solution that employs a fuzzy inference system to dynamically and efficiently schedule these priority queues. The fuzzy rules are derived to minimize the selected Lyapunov function. Simulation experiments show that the proposed fuzzy scheduling algorithm outperforms the popular Weighted Round Robin (WRR) queue scheduling mechanism.

• Industrial Engineering and Management Systems
• /
• v.9 no.4
• /
• pp.339-347
• /
• 2010

Simple-closed expressions for approximate calculation of quality of service (QoS) metrics of isolated cell of wireless networks with either finite or infinite queues of both new and handover calls are developed. It is assumed that both kinds of calls might leave the system without receiving service if their waiting times exceed some threshold value. For the models with infinite queues of heterogeneous calls easily checkable ergodicity conditions are proposed. The high accuracy of the developed approximation formulas is shown. Results of numerical experiments are given.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.373-376
• /
• 2003

This paper presents a new, three-dimensional round-robin scheduler that provides high throughput and fair across in an advanced input-queued packet switch using shared input buffers. We consider an architecture in which each input port group shares a common buffer and maintains a separate queue for each output, which is ratted the distributed common input buffer switch. In an NxN switch, our scheduler determines which queue in the total MxN input queues is served during each time slot where M is the number of common buffers. We suppose that each common buffer has K input ports and K output ports, and manages N output queues. The 3DRR scheduler determines MxK queues in every K(M) cycle when $K\geq$M (K$\leq$M), and provides massively parallel processing for the applications of high-speed switches with a large number of ports. The 3-DRR scheduler can be implemented using duplicated simple logic components allowing very high-speed implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.365-377
• /
• 2006

We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.

• Communications for Statistical Applications and Methods
• /
• v.25 no.4
• /
• pp.443-451
• /
• 2018

$P^M_{\lambda}$-service policy is a workload dependent hysteretic policy. The policy has two service states comprised of the ordinary stage and the fast stage. An ordinary service stage is initiated by the arrival of a customer in an idle state. When the workload of the server surpasses threshold ${\lambda}$, the ordinary service stage changes to the fast service state, and it continues until the system is empty. These service stages alternate in this manner. When the cost of changing service stages is high, the hysteretic policy is more efficient than the threshold policy, where a service stage changes immediately into the other service stage at either case of the workload's surpassing or crossing down a threshold. $P^M_{\lambda}$-service policy is a modification of $P^M_{\lambda}$-policy proposed to control finite dams, and also an extension of the well-known D-policy. The distributions of the stationary workload of $P^M_{\lambda}$-service policy and its variants are studied well. However, there is no known result on the sojourn time distribution. We prove that there is a relation between the sojourn time of a customer and the first up-crossing time of the workload process over the threshold ${\lambda}$ after the arrival of the customer. Using the relation and the duality of M/G/1 and G/M/1 queues, we obtain conditional sojourn time distributions in M/G/1 and G/M/1 queues under the policy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.251-252
• /
• 2000

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.431-439
• /
• 2005

The aim of this paper is to derive the analytical solution of the queue: $M/E_{r}/1/k/N$ for machine interference system with balking and reneging considering the discipline FIFO. Some measures of effectiveness and some special cases are obtained.

• 한국데이터정보과학회:학술대회논문집
• /
• 2001.10a
• /
• pp.87-97
• /
• 2001

We consider a stable tandem network which consists of two M/M/1 queues. The optimal changes of measure to run the fast simulation for the probability of rare events such as buffer overflows are obtained.

• Communications of the Korean Mathematical Society
• /
• v.16 no.4
• /
• pp.659-666
• /
• 2001

The aim of this paper is to derive the analytical so-lution of the queue: H$_{r}$/M/c/k/N for machine interference with balking and reneging, and FIFO (first in, first out) service disci-pline.e.