• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.316-325
• /
• 2002

This paper investigates the restoration schemes which are applied to the MPLS domain upon a network failure. We define the following three restoration service models by combining the various restoration schemes: "FIS-based protection service" (FIS: failure indication signal), "inversion traffic protection service" and "1+1 protection service". After a qualitative analysis of the performance in them, we have analyzed it on quantitative basis by the simulation. According to the simulation results, "1+1 protection service" guarantees the fastest and most lossless restoration service among them; however, it results in consuming considerable bandwidth and producing an amount of control traffic, which means poor network utilization. On the other hand, "FIS-based protection service" spends less bandwidth and generates less control traffic, which means better network utilization, but produces poor restoration service. "Inversion traffic protection service" provides the medium restoration service and utilization between "1+1 protection service" and "FIS-based protection service."

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1160-1167
• /
• 2013

Web based simulation service is utilized to computationally analyze various phenomena in real world according to the progress of network and computing technology. In this paper, we present an improvement and utilization of e-AIRS (e-Science Aerospace Integrated Research System). e-AIRS, has been utilized to support web based CFD simulation service since 2008. has some problems such as stable system, pre processing, post processing. To solver this problem, we improved e-AIRS such as distributed service processing, personal simulation job assignment control, and faster data loading. After improvement, although users increase from 110 to 606, the priority of user requirements is changed from stable system to pre/post processor. User requirements and statistics about e-AIRS simulation service for each semester is analyzed to support more stable and comfortable service.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.59-65
• /
• 2007

HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.657-666
• /
• 2015

We propose a two-stage resource allocation algorithm for the high link utilization of an orthogonal frequency-division multiplexing passive optical network (OFDM-PON). An OFDM-PON is assumed to use a synchronous frame structure in supporting service differentiation. In distributing resources, the proposed algorithm first allocates a time window for each optical network unit (ONU), and then it arranges a subchannel, which is a group of subcarriers. This algorithm needs to satisfy two constraints. First, computations for the resource allocation should be done using a frame unit. Second, an ONU has to use a single subchannel to send upstream data for multiple services within a frame duration. We show through a computer simulation that the proposed algorithm improves the link utilization.

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

• IE interfaces
• /
• v.17 no.4
• /
• pp.466-471
• /
• 2004

In this paper, I develop a simple dynamic resource allocation algorithm that reduces the call blocking rate by improving the resource utilization of the WCDMA (Wideband Code Division Multiple Access) systems under multimedia service environment. Simulation results show that the proposed algorithm significantly reduces the blocking rate of high speed multimedia calls. The algorithm developed in this paper is currently working in the commercial WCDMA IMT-2000 system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.342-352
• /
• 2002

In this paper, we compare the performances of RIO and RIO-DC buffer management schemes for DiffServ AF PHB standardized in IETF. For the comparison, we relatively differentiate maximum delay for each Assured Service subclass in Differentiated Services by allocating bandwidth to each subclass differently. In addition, we set the values of RIO and RIO-DC parameters considering the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. In this simulation environment, the performances of RIO and RIO-DC schemes are analyzed focusing on the throughput of the In-profile traffic, the link utilization and the fairness. Simulation results show that the performance of RIO-DC scheme is comparable to that of RIO scheme with regard to the throughput of the In-profile traffic and the link utilization. However, under the simulation condition RIO-DC scheme improves the fairness between flows much better than RIO scheme.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.95-99
• /
• 2000

The domestic ports become less competitive for the out of dated equipments and inefficient information system. Specially, Inchon Port, which is the second largest port of Korea, has the point at issue such as the excessive logistics cost because of the limit of handling capacity and the chronic demurrage. In this paper to develope the simulation programs the basic input parameters such as arrival intervals, cargo tons, service rates are analyzed and the probability density functions for there variable are estimated. Also to perform the conception of continuous berth utilization, the berth and cargo classification is reconstructed. And the more actual simulation is realized by using more detailed depth representation of water The simulation model is executed based on the knowledge base and database, and is constructed using Visual Basic and Access database. Simulation results reveal that this study suitably reflect the real berth operation and waiting time of ships is shortened.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

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

The purpose of this paper is to analyse the manager's policy to maximize the profit in a multiple-server queueing facility with a limited queue capacity. We assume that the level of advertizing effects on the arrival rate of customers to the facility. The model without ‘word of mouth effect’ is assumed that the arrival rate is independent on the qualify of service level. We estimate the service quality by the balking rate of customers from system. We extend this to the model with ‘word of mouth effect’. To achieve the maximum profit, the most important factor is the considerably high utilization of facility for both models. Given service rate, we should maintain an effective arrival rate to some extent. To this end, among the available options, an increase of advertizing effort is more desirable than reducing the fee if the service value of customers remains unchanged. We also investigate whether the variability of service time has a significant impact on determining the optimal policy. The cost of service variability is not so expensive as that in a single server model due to the reduced variability of service times in a multiple-server model.