• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.173-178
• /
• 2001

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.454-459
• /
• 2001

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.468-471
• /
• 2001

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.4
• /
• pp.17-24
• /
• 2004

Call blocking probabilities of streaming data service in CDMA system with access point(AP) of WLAN are analyzed for different cell geometry of base station and AP and queuing is modeled. The considered system leads to successful handoffs between the APs of WLAN. Blocking probabilities are enumerated as a function for ratio of base station and AP sizes, their locations and the number of buffer in the queue. Results show that blocking probability is not influenced by base station and AP locations but mainly by ratio of their sizes. For CDMA system of radius 100m, 5 buffers in the queue and 7㏈ noise rise(NR), in order to obtain 1% call blocking probability, a cell with hot spot of radius 20m has more 0.6Erlang than that of radius 60m.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.915-920
• /
• 2002

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish yon that it makes out about the characteristics of actual data traffic more easily.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.1
• /
• pp.1-12
• /
• 2024

Pedestrian facilities encompass pedestrian roads, stairs, and queuing areas exclusively designed for pedestrian use. The Korean Highway Capacity Manual provides guidelines for analyzing the capacity and level of service of pedestrian facilities. However, there is a lack of analysis methods tailored specifically for pedestrian facilities. Therefore, in this study, we introduced a new standard of pedestrian space to account for changes in the Korean body ellipse. Furthermore, based on this newly defined pedestrian space, we proposed a new standard value for the level of service of queuing areas. The results of on-site surveys confirmed that the proposed level of service can effectively reflect the actual walking situation.

• Journal of KIBIM
• /
• v.5 no.2
• /
• pp.1-11
• /
• 2015

Despite a lot of research on BIM, there is no quantitative study to measure accurately the performance of BIM coordination service. Thus, this study suggested method to measure the performace of BIM coordination services, applying queueing models in the field of management science. To analyze queuing system of BIM coordination services, a group of BIM coordinator were selected. Through focus group interviews with experts were used in the analysis to derive mean arrival rate(${\lambda}$), mean service rate(${\mu}$) of BIM coordination services. Single-server queuing model(M/M/1), multiple server queuing model(M/M/s) is utilized for the BIM coordination services performance measurement in construction phase. This study has significant quantitative performance measurement approaches that can be utilized in the decision-making for the improvement of the BIM coordination services and to support the review of the alternatives accordingly. But There is a limit but it is difficult to take into account the increase or decrease of the cost of alternatives according to the review.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.2
• /
• pp.1-15
• /
• 2007

This paper proposes a method for determining the number of storage rooms and designing the storage layout in warehouses for pyramid type stacks whose example are slacks for steel coils, paper rolls, and drums for oils. Formulas are derived for estimating the expected values and the variances of various handling times by cranes. From the derived formulas, the expected queuing time of road trucks is estimated. Base on the derived formulas, this study derives the cost function for determining the optimal numbers of rows, bays, and tiers of stacks and sizing cranes under the condition that the requirement for storage space is satisfied. Results of numerical analysis are provided.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.7
• /
• pp.14-21
• /
• 1998

In providing with low speed multimedia services, a call blocking rate is greatly varied according to the transmission rate, and thereofr, the call blocking rate is remarkably increased for a service having a high transmission rate compared to a service having a low transmission rate. This paper presents three methods of solving this problem; Packing Scheme in which available channels distributed to each frequency channel are concentrated on one frequency channel and a call having a high transmission rate is assigned to the frequency channel; Queuing Scheme in which queuing is assigned to calls under service is temporarily reduced and a call having a high transmission rate is allowed. The result of performance analysis for 13 Kbps and 128 Kbps service through computer simulation showed that the call blocking rate for 128 Kbpx service was reduced by tens of percent accoring to loads.

• 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.