• Journal of Korean Society of Transportation
• /
• v.30 no.3
• /
• pp.95-106
• /
• 2012

The railway service in the Seoul metropolitan area is facing variety of l changes such as extension of service coverage, new construction, and introduction of express service which in turn causes changes on demands. The demand affects train operation characteristics (frequency of service, train formation) as well as on the congestion rate which is one of the major evaluation index in metropolitan area user service. For the efficient operation of the train, the relationship among the minimization of fleet number, operating cost, and service level has been analyzed. Using the Powersim, which is a system dynamics (System Dynamics) simulation program for realizing optimized simulation for train-formation, this paper identified that some stations of Gyeong-bu line exceeded limit congestion rate(150%) of a fleet already that means it is best to maintain current condition of the line; however, the Gyeong-in line and the Gwa-chon line showed no excess of the limit congestion rate so that it is possible to reduce 2-4 fleets of train for efficient operation. In addition, in case of Jang-hang line between Cheon-an and Sin-chang, a train consisting of 10 fleets provides services which is same formation of train for Gyeong-bu line. This study proved that the congestion rate will not rise greatly with only 4 fleets of a train for the service in Jang-hang line, and it is considered that a study for shuttle service between Cheon-an and Sin-chang is necessary.

• Journal of the Korea Society for Simulation
• /
• v.8 no.2
• /
• pp.101-109
• /
• 1999

In a commercial facsimile network system, a simulation analysis has been performed using ARENA due to the unavailability of theoretical models. The effect of a priority is compared with that of the current FCFS rule on the arriving call blocking rate and transmission time delay. The result shows that the priority rule reduces more service time delay as the arrival rate increases. A simulation analysis procedure is proposed to select optimal in/out port ratio at various hourly arrival rates with a given multiple-place transmission requests ratio.

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.65-74
• /
• 2019

For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

• Journal of Korean Society of Water and Wastewater
• /
• v.28 no.6
• /
• pp.755-763
• /
• 2014

In this paper, a System Dynamics(SD) computer simulation model has been developed to assess the effects of developing and providing an alternate water source. A water service index was also developed to estimate the level of overall customer satisfaction on water supply service. Data from the Busan water supply service and the Korea Development Institute regarding the Nak Dong river bank storage development were utilized during the modeling processes. Some important indicators of the system under study were analyzed by the simulations of development of the alternate water source for Busan. The developed SD model and the water service index can be further utilized as a tool that can assess the extent and timing of an additional service improvement project.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.65-73
• /
• 2005

Request about fast diffusion of internet and high-capacity multimedia service is increasing day after day. Because existent wireless LAN is short range, if subscriber is far away in base station transceiver system(Base Station), subscriber's quality of service becomes low, and wileless internet is expensive. Lately, WiBro(Wireless Broadband Internet) system that is developed in domestic by world first, is high-speed portable internet service that is situated in middle area of mobile phone and wireless LAN. In this paper, service traffic model and characteristics are analyzed to provide multimedia service based on IEEE 802.16 BWA accomplishes base of WiBro and simulation is conducted according to various traffic mixing ratio. Finally, on the basis of these simulation results, maximum allowable number of subscriber per cell is calculated.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.795-797
• /
• 2009

Voice over Internet Protocol(VoIP) service becomes more and more popular nowadays. As such, it is developed over many kinds of network models, especially wireless networks. Mean Opinion Score(MOS) computes the QoS of VoIP service which should be supported by robust network environment. However, MANET is not stable enough to supply high MOS values for VoIP service. In this paper, VoIP service over MANET is simulated using ns-2(Network Simulation 2). In oder to get different MOS values in the results, we differentiate between network environments by adjusting the parameters of MANET.Through comparing the results we can know how to improve the QoS.

• International Journal of Contents
• /
• v.2 no.2
• /
• pp.29-31
• /
• 2006

Mobile Ad hoc network is a self configuring network of mobile nodes. It allows mobile nodes to configure network spontaneously and share their services. In these networks, service discovery is very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Some service discovery protocols have been proposed in last couple of years but they include significant traffic overhead and for small scale MANETS. In this paper, we present extensible lookup service scheme based on distributed mechanism. In our scheme neighboring nodes of service provider monitor service provider and send notification to lookup server when the service provider terminates its services unexpectedly. Lookup server can find other service provider or other alternative services in advance because of advance notification method and can provide consistent lookup services. In our scheme neighboring nodes also monitor lookup server and send notification to network when lookup server terminates unexpectedly. Simulation results show that our scheme can reduce up to 70% and 30% lookup failure as compare to centralize and simple distributed mechanism respectively.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.185-191
• /
• 2010

We present the system architecture for service collision avoidance and propose the modified service session table and service collision avoidance scheme. The simulation results show that the proposed scheme reduces the number of unnecessary service request messages and service provisioning delivery time. Therefore Personal Server (PS) uses the battery efficiently and can use the service rapidly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.114-129
• /
• 2005

In this paper, we examine Interleaved Polling with Adaptive Cycle Time (IPACT) algorithm which was proposed to control upstream traffic for Gigabit Ethernet-PONs, and we analyze the performance of the gated service and the limited service of the IPACT mathematically. For the mathematical performance analysis, we model IPACT algorithm as a polling system and use mean-value analysis. We divide arrival rate λ value into three regions and analyze each region accordingly. We obtain average packet delay, average queue size and average cycle time of both the gated and the limited service. We compare analytical results with simulation to verify the accuracy of the mathematical analysis. Upon now, simulation analysis have been used to evaluate the performance of EPONs, which require much time sud effort. Mathematical analysis can be widely used in the design of EPON systems since system designers can obtain various performance results rapidly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1522-1545
• /
• 2012

Call admission control (CAC) plays an important role in mobile cellular network to guarantee the quality of service (QoS). In this paper, a dynamic hybrid CAC scheme with integrated cutoff priority and handoff queue for mobile cellular network is proposed and some performance metrics are derived. The unique characteristic of the proposed CAC scheme is that it can support any number of service types and that the cutoff thresholds for handoff calls are dynamically adjusted according to the number of service types and service priority index. Moreover, timeouts of handoff calls in queues are also considered in our scheme. By modeling the proposed CAC scheme with a one-dimensional Markov chain (1DMC), some performance metrics are derived, which include new call blocking probability ($P_{nb}$), forced termination probability (PF), average queue length, average waiting time in queue, offered traffic utilization, wireless channel utilization and system performance which is defined as the ratio of channel utilization to Grade of Service (GoS) cost function. In order to validate the correctness of the derived analytical performance metrics, simulation is performed. It is shown that simulation results match closely with the derived analytic results in terms of $P_{nb}$ and PF. And then, to show the advantage of 1DMC modeling for the performance analysis of our proposed CAC scheme, the computing complexity of multi-dimensional Markov chain (MDMC) modeling in performance analysis is analyzed in detail. It is indicated that state-space cardinality, which reflects the computing complexity of MDMC, increases exponentially with the number of service types and total channels in a cell. However, the state-space cardinality of our 1DMC model for performance analysis is unrelated to the number of service types and is determined by total number of channels and queue capacity of the highest priority service in a cell. At last, the performance comparison between our CAC scheme and Mahmoud ASH's scheme is carried out. The results show that our CAC scheme performs well to some extend.