• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.11a
• /
• pp.157-162
• /
• 2002

A distributed simulation with HLA/RTI provides stable and satisfactory results. In this study, a distributed simulation of Petri net models under the HLA/RTI framework is considered. Throughout our experiences, it is recognized that the proper use of interface specification and time management services are important in order to achieve successful implementation of RTI. The interfacing tokens that are delivered to other models are distinguished as information entity and physical entity. Both entities are modeled as Interaction Class in order to send and receive messages. In synchronizing local simulation clocks, a conservative method with NERA service is considered. A eel manufacturing system is modeled and implemented with RTI to illustrate the distributed simulation of Petri net models.

• Journal of the Korea Society for Simulation
• /
• v.13 no.3
• /
• pp.1-10
• /
• 2004

The cell loss probability required in the ATM network is in the range of 10$^{-9}$ ∼10$^{-12}$ . If Monte Carlo simulation is used to analyze the performance of the ATM node, an enormous amount of computer time is required. To obtain large speed-up factors, importance sampling may be used. Since the Markov-modulated processes have been used to model various high-speed network traffic sources, we consider discrete time single server queueing systems with Markov-modulated arrival processes which can be used to model an ATM node. We apply importance sampling based on the Large Deviation Theory for the performance evaluation of, MMBP/D/1/K, ∑MMBP/D/1/K, and two stage tandem queueing networks with Markov-modulated arrival processes and deterministic service times. The simulation results show that the buffer overflow probabilities obtained by the importance sampling are very close to those obtained by the Monte Carlo simulation and the computer time can be reduced drastically.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.6-12
• /
• 2006

Peer-to-Peer (P2P) networks are attracting considerable research interest because of their scalability and high performance relative to cost. One of the important services on a P2P network is the streaming service. However, because each node in the P2P network is autonomous, it is difficult to provide a stable streaming service on the network. Therefore, for a stable streaming service on the P2P network, a fault-tolerant scheme must be provided. In this paper, we propose two new node selection schemes, Playback Node First (PNF) and Playback Node first with Prefetching (PNF-P) that can be used for a service migration-based fault-tolerant streaming service. The proposed schemes exploit the fact that the failure probability of a node currently being served is lower than that of a node not being served. Simulation results show that the proposed schemes outperform traditional node selection schemes.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.255-264
• /
• 2010

Interference scenarios and methodologies between a terrestrial mobile service (MS) system and mobile-satellite service (MSS) system in a co-channel environment are established. Taking into account a practical deployment situation for both systems, we perform computational simulation of interference in terms of carrier-to-interference ratio (C/I) and interference-to-noise ratio (I/N) to evaluate the cofrequency interference from an MS system into an MSS system, and from an MSS system into an MS system, respectively. The methodology and results can be used as a guide when planning the deployment of MSS and MS systems with no unacceptable interference impact between them.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.2
• /
• pp.67-75
• /
• 2001

This paper presents a fast and effective methodology for service restoration in large-scale distribution systems. The service restoration problem is formulated as a constrained optimization problem and requires the fast computation time and superior solution because the more unfaulted out-of-service area should be restored as soon as possible. The proposed methodology is designed to consider the fast computation time and priority service restoration by dijkstra algorithm and fuzzy theory in large-scale distribution systems. Simulation results demonstrate the validity and effectiveness of the proposed on a 26-bus and 140-bus system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.268-279
• /
• 1997

In this paper, we show the movable boundary (MB) method is the effective bandwidth allocation strategy for the ABR service among existing bandwidth allocation methods. The MB method can gurantee the QOS requirement according to the service priority and improve bandwidth utilization using the characteristics of the ABR service. The threshold values of the MB, which have an important effect upon connection blocking probability(CBP) performance of each service, are obtained by simulation. The MB method with the fixed thresholds, however, may not have good performance to variation of input traffic parameters. We suggest the dynamic MB method which changes the threshold values adaptively according to the required bandwidth of input traffic. We also show that the dynamic MB method can urantee the CBP performance according to the service priority regardless of variation of input traffic parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.767-778
• /
• 2007

In this paper, we propose a Intelligent Service Reasoning (ISR) model using data mining in smart home environments. Our model creates a service tree used for service reasoning on the basis of C4.5 algorithm, one of decision tree algorithms, and reasons service that will be offered to users through quantitative weight estimation algorithm that uses quantitative characteristic rule and quantitative discriminant rule. The effectiveness in the performance of the developed model is validated through a smart home-network simulation.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.10
• /
• pp.500-506
• /
• 2005

With the advent of electric power systems moving to a deregulated retail electricity market environment, calculating distribution service tariffs has become a challenging theme for distribution industries and tariff regulators. As distribution business remains as a monopoly, it is necessary to be regulated. And as multiple distribution companies compete with each other, it would be efficient to adopt competition to the determination of distribution service tariffs. This paper proposes a method to calculate distribution service tariffs using yardstick regulation, which can lead to competition among multiple distribution companies. The proposed method takes into account not only recovering revenue requirements but also the advantages of the yardstick regulation based on long-term marginal costs of distribution network expansion algorithms. A computer simulation is carried out to illustrate effectiveness of the proposed method and it is estimated that the algorithm can be applied to compute the distribution service tariffs under retail electricity markets.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.29-35
• /
• 2015

The heterogeneous LTE (Long Term Evolution)-Advanced networks comprising a macrocell and femtocells can provide an efficient solution not only to extend macrocell coverage but also to deal with packet traffics increasing explosively within macrocells. An efficient resource management scheme is necessary to maintain the QoS (Quality of Service) of mobile multimedia services because the LTE-Advanced system should support not only voice but also mobile applications such as data, image and video. This paper proposes a resource management scheme to guarantee QoS continuity of multimedia services and to maximize the resource utilization in OFDMA (Orthogonal Frequency Division Multiple Access) based LTE-Advanced systems. This scheme divides the resources into several service blocks and allocates those resources based on the competition between macrocell and femtocell. Simulation results show that it provides better performances than the conventional one in respect of handover failure rate and blocking rate.

• 전자공학회논문지 IE
• /
• v.48 no.3
• /
• pp.16-19
• /
• 2011

Differentiated Service is an IP QoS ensuring method based on packet marking that allows packets to be prioritized according to user requirements. During the time of congestion, more low priority packets are dropped than high priority packets. Different policy models are used to determine how to mark the packet. This paper investigated the performance of Differentiated Service using time sliding window with 3 color marking (TSW3CM). Simulation results using NS-2 showed that Differentiated Service can provide the quality of service requirements.