• Industrial Engineering and Management Systems
• /
• v.9 no.3
• /
• pp.285-293
• /
• 2010

To obtain visible and traceable information from the supply chain, HW/SW standards for the EPC global network, which process electronic product code (EPC) data read from Radio frequency identification (RFID) tags, are regarded as the de facto industry standard. Supply chain participants install information service systems and provide logistics information to partners by following the EPCglobal architecture framework. Although quality of service (QoS) is essential for providing dependable and scalable services as pointed out by Auto-ID Lab, only a few models for the performance analysis of QoS-related work have been developed in the context of EPC information service systems. Specifically, doing so allows alternative design choices to be tested in an easy and cost-effective manner and can highlight potential performance problems in designs long before any construction costs are incurred. Thus, in this study we construct a model of an EPC information service system for the purposes of performance analysis and designing a dependable system. We also develop a set of building blocks for analytical performance models. To illustrate how the model works, we determine the characteristics of an EPC information service system and then select a combination of these proven modeling concepts. We construct a performance model that considers the response time and shows how to derive meaningful performance values. Finally, we compare the analytical results to measurements of the EPC information service system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1035-1044
• /
• 1998

A new multi-channel access scheme and the associated network architecture for a single-hop WDM local area network is proposed in this paper. The proposed architecture has Central Scheduling Node (CSN) for the transmission coordination among many users, which is one of the key issues in single-hop WDM networks. The data channels, source nodes, and destination nodes are selected at CSN in very simple menner. Our scheme can relive the control processing overhead at all nodes in the network which is caused in existing distributed scheduling algorithms. CSN is simple in the architecture can be implemented easily. in respect to the network performance, the maximum obtainable throughput is up to that of the ideal output queuing because of collision free scheduling. We use the MQMS (multi-queue multi-server) model for performance analaysis.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.138-147
• /
• 2002

The concept of the critical path in the workflow is important because it can be utilized In many issues in workflow systems, e.g., workflow resource management and workflow time management. However, the critical path in the contest of the workflow has not been much addressed in the past. This is because control flows in the workflow, generally including sequence, parallel, alternative, iteration and so on, are much more complex than those in the ordinary graph or network. In this paper we first describe our workflow model that has considerable work(low control constructs. They would provide the sufficient expressive power for modeling the growing complexities of today's most business processes. Then, we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.187-193
• /
• 2015

The ICT healing platform sets a couple of goals including preventing chronic diseases and sending out early disease warnings based on personal information such as bio-signals and life habits. The 2-step open system(TOS) had a relay designed between the healing platform and the storage of personal health data. It also took into account a publish/subscribe(pub/sub) service based on large-scale connections to transmit(monitor) the data processing process in real time. In the early design of TOS pub/sub, however, the same buffers were allocated regardless of connection idling and type of message in order to encode connection messages into a deflate algorithm. Proposed in this study, the dynamic buffer allocation was performed as follows: the message transmission type of each connection was first put to queuing; each queue was extracted for its feature, computed, and converted into vector through tf-idf, then being entered into a k-means cluster and forming a cluster; connections categorized under a certain cluster would re-allocate the resources according to the resource table of the cluster; the centroid of each cluster would select a queuing pattern to represent the cluster in advance and present it as a resource reference table(encoding efficiency by the buffer sizes); and the proposed design would perform trade-off between the calculation resources and the network bandwidth for cluster and feature calculations to efficiently allocate the encoding buffer resources of TOS to the network connections, thus contributing to the increased tps(number of real-time data processing and monitoring connections per unit hour) of TOS.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.31-39
• /
• 1998

In this paper, we have presented a quantitative performance effect of CCP(Call Control Processor) when SAAL(Signalling ATM Adaptation Layer) function is distributed from CCP to SIMs(Subscriber Interface Modules) in an ATM switching system with distributed architecutre. For the performance analysis, SLAM II simulation language is used and subscriber signalling messageand inter-processor communication messages according to Q.2931 based local call processing procedure are taken into consideration in the proposed queuing network model. The results of simulation are compared with in case of processing SAAL function on CCP. It is observed that the processing utilization of CCP reach 24,000 BHCA and 25,700 BHCAwhen SAAL function load amounts to 10% and 20% of the processing time of the total message, respectively. These values shows that the processing utilization of CCP is alleviated about 7% in comparison with 2,000 BHCA in case that SAAL function is carried out on CCP. Consquently, it is shown that we have to consider seriously how to distribute the functions concerning call processing in a large cale ATM switching system architecture accomodating a number of SIMs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7B
• /
• pp.653-663
• /
• 2002

UMTS/GPRS has its own QoS architecture, but additionally needs to support IP-QoS to provide Internet services. This paper describes an IP-QoS provisioning mechanism in the MPLS-based UMTS/GPRS network. We propose a QoS framework that includes the functional architecture of the MPLS-based GPRS networks and the efficient scheduling mechanism based on Diffserv model. The proposed scheduling mechanims is especially focused on the QoS support for real-time services. It also includes a new buffer management scheme that combines the priority queuing and weighted round robin method. The ns-2 simulator has been used to verify the validity of the proposed scheduling method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.117-124
• /
• 2008

In this paper, the call setup performance of the CSCF(Call Session Control function) that manages the session control in providing the IMS(IP Multimedia subsystem)-based multimedia service in the BcN(Broadband convergence Network) is analyzed. While the performance related with the call/session of the SIP-Based voice service is analysed, the study for the call recessing performance of the IMS-based multimedia service is insufficient. In this paper, as, the processing capacity and subscriber number of CSCF were changed, the call setup delay time according to the session setup procedure of IMS was measured using the M/M/1 queuing model and OPNET simulation. The experimental results show that the sudden increased delay showed up in case the session establishment requirement ratio of total users over 13% of the CSCF processing capacity. Therefore, the user number and capacity of CSCF suitable for the session establishment delay threshold can be calculated or estimated.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.677-687
• /
• 2001

The critical path has been widely applied to many areas of computer engineering especially a directed acyclic graph. Its concept can also be useful in the context of a workflow. The workflow critical path is defined as a path which has the longest average execution time from the start activity to the end activity of workflow. Because there can be several concurrently executed workflow instances for a specific workflow a new method to determine the critical path should be developed. In this paper we specify our workflow queuing network model from which we can easily analyze many workflow characteristics. Based on this workflow model. we propose a method to identify the critical path In addition, we show come workflow areas which can utilze the critical path.

• Safety and Health at Work
• /
• v.10 no.4
• /
• pp.452-460
• /
• 2019

Background: Monitoring and control of PM_2.5 are being recognized as key to address health issues attributed to PM_2.5. Availability of low-cost PM_2.5 sensors made it possible to introduce a number of portable PM_2.5 monitors based on light scattering to the consumer market at an affordable price. Accuracy of light scatteringe-based PM_2.5 monitors significantly depends on the method of calibration. Static calibration curve is used as the most popular calibration method for low-cost PM_2.5 sensors particularly because of ease of application. Drawback in this approach is, however, the lack of accuracy. Methods: This study discussed the calibration of a low-cost PM_2.5-monitoring device (PMD) to improve the accuracy and reliability for practical use. The proposed method is based on construction of the PM_2.5 sensor network using Message Queuing Telemetry Transport (MQTT) protocol and web query of reference measurement data available at government-authorized PM monitoring station (GAMS) in the republic of Korea. Four machine learning (ML) algorithms such as support vector machine, k-nearest neighbors, random forest, and extreme gradient boosting were used as regression models to calibrate the PMD measurements of PM_2.5. Performance of each ML algorithm was evaluated using stratified K-fold cross-validation, and a linear regression model was used as a reference. Results: Based on the performance of ML algorithms used, regression of the output of the PMD to PM_2.5 concentrations data available from the GAMS through web query was effective. The extreme gradient boosting algorithm showed the best performance with a mean coefficient of determination (R²) of 0.78 and standard error of 5.0 ㎍/㎥, corresponding to 8% increase in R² and 12% decrease in root mean square error in comparison with the linear regression model. Minimum 100 hours of calibration period was found required to calibrate the PMD to its full capacity. Calibration method proposed poses a limitation on the location of the PMD being in the vicinity of the GAMS. As the number of the PMD participating in the sensor network increases, however, calibrated PMDs can be used as reference devices to nearby PMDs that require calibration, forming a calibration chain through MQTT protocol. Conclusions: Calibration of a low-cost PMD, which is based on construction of PM_2.5 sensor network using MQTT protocol and web query of reference measurement data available at a GAMS, significantly improves the accuracy and reliability of a PMD, thereby making practical use of the low-cost PMD possible.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.