• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.58-62
• /
• 2007

Recnetly, the demands of QoS(Quality of Service) and the traffic in network is increased. So, H-MPLS(Hierarchical MPLS) network research what guarantees the scalability is in progress. But, the H-MPLS has a problem of increasing of groups and the links of these group's nodes. It happens a problem that is increasing of H-MPLS setup cost. In this paper, We setup the H-MPLS groups. We use NS simulator in order to analyze the performance and traffic transfer times of each H-MPLS groups. In conclusion, we can find out the elevation of the traffic performance, by increasing a amount of links.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3293-3311
• /
• 2015

Cloud services are required to be composed as a single service to fulfill the workflow applications. Service composition in Cloud raises new challenges caused by the diversity of users with different QoS requirements and vague preferences, as well as the development of cloud computing having geographically distributed characteristics. So the selection of the best service composition is a complex problem and it faces trade-off among various QoS criteria. In this paper, we propose a Cloud service composition approach based on evolutionary algorithms, i.e., NSGA-II and MOPSO. We utilize the combination of multi-objective evolutionary approaches and Decision-Making method (AHP) to solve Cloud service composition optimization problem. The weights generated from AHP are applied to the Crowding Distance calculations of the above two evolutionary algorithms. Our algorithm beats single-objective algorithms on the optimization ability. And compared with general multi-objective algorithms, it is able to precisely capture the users' preferences. The results of the simulation also show that our approach can achieve a better scalability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.836-858
• /
• 2010

Web Services allow a user to integrate applications from different platforms and languages. Since mobile applications often run on heterogeneous platforms and conditions, Web Service becomes a popular solution for integrating with server applications. However, because of its verbosity, XML based SOAP messaging gives the possible overhead to the less powerful mobile devices. Based on the mobile client's behavior that it usually exchanges messages with Web Service continuously in a session, we design the Handheld Flexible Representation architecture. Our proposed architecture consists of three main components: optimizing message representation by using a data format language (Simple_DFDL), streaming communication channel to reduce latency and the Context-store to store context information of a session as well as redundant parts of the messages. In this paper, we focus on the Context-store and describe the architecture with the Context-store for improving the performance of mobile Web Service messaging. We verify our approach by conducting various evaluations and investigate the performance and scalability of the proposed architecture. The empirical results show that we save 40% of transit time between a client and a service by reducing the message size. In contrast to solutions for a single problem such as the compression or binarization, our architecture addresses the problem at a system level. Thus, by using the Context-store, we expect reliable recovery from the fault condition and enhancing interoperability as well as improving the messaging performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.607-615
• /
• 2005

Group key agreement protocols are designed to allow a group of parties communicating over a public network to securely establish a common secret key. Over the years, a number of solutions to this problem have been proposed with varying degrees of complexity. However, there seems to have been no previous systematic look at the growing problem of key agreement over combined wired/wireless networks, consisting of both high-performance computing machines and low-power mobile devices. In this paper we present an efficient group key agreement scheme well suited for this networking environment. Our scheme meets efficiency, scalability, and all the desired security requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1847-1870
• /
• 2021

With the development of information and communication technologies, especially wireless networks and cell phones, the e-voting system becomes popular as its cost-effectiveness, swiftness, scalability, and ecological sustainability. However, the current e-voting schemes are faced with the problem of privacy leakage and further cause worse vote-buying and voter-coercion problems. Moreover, in large-scale voting, some previous e-voting system encryption scheme with pairing operation also brings huge overhead pressure to the voting system. Thus, it is a vital problem to design a protocol that can protect voter privacy and simultaneously has high efficiency to guarantee the effective implementation of e-voting. To address these problems, our paper proposes an efficient unidirectional proxy re-encryption scheme that provides the re-encryption of vote content and the verification of users' identity. This function can be exactly applied in the e-voting system to protect the content of vote and preserve the privacy of the voter. Our proposal is proven to be CCA secure and collusion resistant. The detailed analysis also shows that our scheme achieves higher efficiency in computation cost and ciphertext size than the schemes in related fields.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4725-4747
• /
• 2020

Software defined networking (SDN) is considered to be one of the most promising paradigms in the future. To solve the scalability and performance problem that a single and centralized controller suffers from, the distributed multi-controller architecture is adopted, thus forms multi-domain SDN. In a multi-domain SDN network, it is of great importance to ensure a reliable control plane. In this paper, we focus on the reliability problem of multi-domain SDN against controller failure from perspectives of backup controller deployment and controller replication. We firstly propose a placement algorithm for backup controllers, which considers both the reliability and the cost factors. Then a controller replication mechanism based on shared data storage is proposed to solve the inconsistency between the active and standby controllers. We also propose a shared data storage layout method that considers both reliability and performance. Besides, a fault recovery and repair process is designed based on the controller backup and shared data storage mechanism. Simulations show that our approach can recover and repair controller failure. Evaluation results also show that the proposed backup controller placement approach is more effective than other methods.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.331-340
• /
• 2021

The Internet of Things (IoT) is a rapidly growing physical network that depends on objects, vehicles, sensors, and smart devices. IoT has recently become an important research topic as it autonomously acquires, integrates, communicates, and shares data directly across each other. The centralized architecture of IoT makes it complex to concurrently access control them and presents a new set of technological limitations when trying to manage them globally. This paper proposes a new decentralized access control architecture to manage IoT devices using blockchain, that proposes a solution to concurrency management problems and enhances resource locking to reduce the transaction conflict and avoids deadlock problems. In addition, the proposed algorithm improves performance using a fully distributed access control system for IoT based on blockchain technology. Finally, a performance comparison is provided between the proposed solution and the existing access management solutions in IoT. Deadlock detection is evaluated with the latency of requesting in order to examine various configurations of our solution for increasing scalability. The main goal of the proposed solution is concurrency problem avoidance in decentralized access control management for IoT devices.

• Journal of Animal Science and Technology
• /
• v.65 no.6
• /
• pp.1254-1269
• /
• 2023

This study aims to predict the change in corn share according to the grazing of 20 gestational sows in a mature corn field by taking images with a camera-equipped unmanned air vehicle (UAV). Deep learning based on convolutional neural networks (CNNs) has been verified for its performance in various areas. It has also demonstrated high recognition accuracy and detection time in agricultural applications such as pest and disease diagnosis and prediction. A large amount of data is required to train CNNs effectively. Still, since UAVs capture only a limited number of images, we propose a data augmentation method that can effectively increase data. And most occupancy prediction predicts occupancy by designing a CNN-based object detector for an image and counting the number of recognized objects or calculating the number of pixels occupied by an object. These methods require complex occupancy rate calculations; the accuracy depends on whether the object features of interest are visible in the image. However, in this study, CNN is not approached as a corn object detection and classification problem but as a function approximation and regression problem so that the occupancy rate of corn objects in an image can be represented as the CNN output. The proposed method effectively estimates occupancy for a limited number of cornfield photos, shows excellent prediction accuracy, and confirms the potential and scalability of deep learning.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.797-809
• /
• 2006

To support the QoS streams for large scale clients, the internal resources of VOD servers should be utilized based on the characteristics of the streaming media service. Among the various resources in the server, the main memory is used for the buffer space to the media data loaded from the disks and the buffer hit ratio has a great impact upon the server performance. However, if the buffer data with high hit ratio are replaced for the new media data as a result of the number of clients and the required movie titles are increased, the negative impact on the scalability of server performance is occurred. To address this problem, the buffer replacement policy considers the intrinsic characteristics of the streaming media such as the sequential access to large volume data and the highly disproportionate preference to specific movies. In this paper, the preference-based segment buffer replacement policy is proposed in the cluster-based VOD server to exploit the characteristics of the streaming media. Since the proposed method reflects both the temporal locality by the clients' preference and the spatial locality by the sequential access to media data, the buffer hit ratio would be improved as compared to the existing buffer replacement policy. The enhanced buffer hit ratio causes the fact that the performance scalability of the cluster-based VOD server is linearly improved as the number of cluster nodes is increased.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.3
• /
• pp.363-369
• /
• 2017

Phase-change random access memory (PRAM) has been emerged as a potential memory due to its excellent scalability, non-volatility, and random accessibility. But, as the cell current is reducing due to cell size scaling, the read-sensing window margin is also decreasing due to increased variation of cell performance distribution, resulting in a substantial loss of yield. To cope with this problem, a novel adaptive read-sensing reference current generation scheme is proposed, whose trimming range and resolution are adaptively controlled depending on process conditions. Performance evaluation in a 58-nm CMOS process indicated that the proposed read-sensing reference current scheme allowed the integral nonlinearity (INL) to be improved from 10.3 LSB to 2.14 LSB (79% reduction), and the differential nonlinearity (DNL) from 2.29 LSB to 0.94 LSB (59% reduction).