• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.231-234
• /
• 2020

In the past few years, the industrial internet of things (IIoT) has received great attention in various industrial sectors which have potentially increased a high level of integrity, availability, and scalability. The increasing of IIoT is expected to create new smart industrial enterprises and build the next generation smart system. However existing IIoT systems rely on centralized servers that are vulnerable to a single point of failure and malicious attack, which exposes the data to security risks and storage. To address the above issues, blockchain is widely considered as a promising solution, which can build a secure and efficient environment for data storing, processing and sharing in IIoT. In this paper, we propose a decentralized, peer-to-peer platform for secure data storing in industrial IoT base on the ethereum blockchain. We exploit ethereum to ensure data security and reliability when smart devices store the data.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.345-354
• /
• 2003

IP Multicast is required of more little network resources than one in unicast. Furthermore, reliable multicast has been researched for supporting reliability at IP Multicast mechanism. Although these studies are carried out, they only have focused on general data. In other words, in case that realtime packet, they can not support reliability since they do not consider realtime properties such as dependency of interframe and playback in time. Besides, we also request to support scalability because we are based on Mobile IP network together with internet. Thus, we need a mechanism to guarantee reliability and scalability of realtime stream data. In this paper, we propose PER (Preceding Error Recovery) that reflect characteristics of the realtime data, especially for H.323. PER provides scalable reliability because it is based on tree-based multicast basically and helps to support scalable relibility as reducing control packet and recovers stream buffer space from underflow status as soon as possible. PER shows much better scalable and reliable than existing works.

• IE interfaces
• /
• v.24 no.2
• /
• pp.139-150
• /
• 2011

The EPCglobal Network is a computer network used to share product data among trading partners. It provides the supply chain with improved visibility and traceability by using Electronic Product Code (EPC), which is stored on an RFID tag. Although this network model is widely accepted as a global standard and the growth of EPCglobal-subscriber base is considerable, the EPC technology adoption process is still in its infancy. This is because some of the critical issues on this model still remain to be verified such as scalability, data management, security, privacy and the economic value of data sharing. In this paper, we focus on scalability issue among the challenges to overcome and we regard performance of the EPCglobal Network only as a track and trace query-processing cost in the network. We developed performance models consisting of three elements of the EPCglobal Network : Discovery Services (DS), EPC Information Services (EPCIS), Object Naming Services (ONS). Then we abstracted out the track and trace query execution model to evaluate performance of the overall EPCglobal Network. Finally using the proposed models, we carried out simulation analysis based on an RFID-based inbound logistics process of automobile parts. This work is an important step towards the EPC technology diffusion and provides guidelines for businesses looking to buy or build the EPCglobal Network-based systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.27-38
• /
• 2005

IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.

• The Korean Journal of Applied Statistics
• /
• v.27 no.2
• /
• pp.249-261
• /
• 2014

Ever increasing "Big data" can only be effectively processed by parallel computing. Parallel computing refers to a high performance computational method that achieves effectiveness by dividing a big query into smaller subtasks and aggregating results from subtasks to provide an output. However, it is well-known that parallel computing does not achieve scalability which means that performance is improved linearly by adding more computers because it requires a very careful assignment of tasks to each node and collecting results in a timely manner. Hadoop is one of the most successful platforms to attain scalability. In this paper, we propose a measurement for Hadoop optimization by utilizing a Lorenz curve which is a proxy for the inequality of hardware resources. Our proposed index takes into account the intrinsic overhead of Hadoop systems such as CPU, disk I/O and network. Therefore, it also indicates that a given Hadoop can be improved explicitly and in what capacity. Our proposed method is illustrated with experimental data and substantiated by Monte Carlo simulations.

• Journal of Digital Contents Society
• /
• v.17 no.2
• /
• pp.89-96
• /
• 2016

SVC(Scalable Video Coding), which is one form among video encoding technologies, makes video streaming with the various frame rate, resolution, and video quality by combining three different scalability dimensions: temporal, spatial, and video quality scalability. As the above SVC-encoded video streaming consists of one base layer and several enhancement layers, and a wireless AP(Access Point) chooses and sends a suitable layer according to the received power from the receiving terminals in the changeable wireless network environment, the receiving terminals supporting SVC are able to receive video streaming with the appropriate resolution and quality according to their received powers. In this paper, after the performance analysis for the received power, packet loss rate, PSNR(Required Peak Signal to Noise Ratio), video quality level and amount of received video data based on the number of SVC layers was performed, an efficient method for selecting the number of SVC layer satisfying the RSNR and minimizing the amount of received video data is proposed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.1 no.1
• /
• pp.33-51
• /
• 2007

There are two newly emerging research issues in the enterprise information systems literature. One is the scalability issue for rapidly increasing choreographic volumes between interrelated organizations. The other is the business intelligence issue for traceable and monitorable business processes and services interchanging e-Business data and applications across organizations. Based upon these emerging issues, through a functional extension of the ebXML technology we have developed a process-driven e- Business service integration (BSI) system, which is named ‘e-Lollapalooza’. It consists of three major components ? the Choreography Modeler coping with the processdriven collaboration issue, the Runtime & Monitoring Client for coping with the business intelligence issue and the EJB-based BSI Engine coping with the scalability issue. This paper particularly focuses on the e-Lollapalooza’s development aspects for supporting the ebXML-based choreography and orchestration among the engaged organizations in a process-driven multiparty collaboration for e-Logistics and e- Commerce services. Here, it is fully deployed in an EJB-based middleware computing environment for e-Logistics process automation and B2B choreography.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.163-166
• /
• 2003

In recent years, there has been increased to access multimedia service through the Internet due to rise of the access speed. We suppose the co-existence of the various access networks in adjacent area in the future, such as wireless LAN, Bluetooth, and 3G Cellular So, the size of the cell will be smaller and the number of access point will be increased. In other words, the potable devices need the efficient mobility scheme due to move between cells frequently Currently, the several of the scheme, which is Cellular IP, HAWAII, Mobile IPv4 regional registration, and hierarchical Mobile IPv6, is suggested to support micro-mobility but Mobile IPv4 is standard scheme to support the mobility of the mobile node. MPLS, which forwards the packet through switching instead of routing using IP address, has begun to deploy in the internet backbone to increase the performance of mobility protocol. The integration of both MPLS and Mobile IP improves the scalability of the Mobile IP data forwarding process by leveraging on the features MPLS which are fast switching and high scalability. Moreover it abbreviates IP-in-IP tunneling between HA and FA. In this paper, we suggest efficient mobility scheme through integration of both MPLS and hierarchical Mobile IPv6.

• Journal of Convergence Society for SMB
• /
• v.2 no.1
• /
• pp.41-50
• /
• 2012

In this research, we developed a scalable resource monitoring system for large scale scientific computing data centers. Usually, there are limitations and overheads for keeping track of every computing nodes because of the huge number of computing nodes. So, this research proposes a layered summarizing techniques during collection of all system resource information. The technique results in improved scalability by reducing the amount of information at higher layer. Our prototype system which is implemented with web service is applicable with the HTML5 mobile web technology on smart devices.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.5
• /
• pp.58-70
• /
• 2008

Earlier researches on Sensor Networks preferred symmetric key-based authentication schemes in consideration of limitations in network resources. However, recent advancements in cryptographic algorithms and sensor-node manufacturing techniques have opened suggestion to public key-based solutions such as Merkle tree-based schemes. These previous schemes, however, must perform the authentication process one-by-one in hierarchical manner and thus are not fit to be used as primary authentication methods in sensor networks which require mass of multiple authentications at any given time. This paper proposes a new concept of public key-based authentication that can be effectively applied to sensor networks. This scheme is based on exponential distributed data concept, a derivative from Shamir's (t, n) threshold scheme, in which the authentication of neighbouring nodes are done simultaneously while minimising resources of sensor nodes and providing network scalability. The performance advantages of this scheme on memory usage, communication overload and scalability compared to Merkle tree-based authentication are clearly demonstrated using performance analysis.