• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.105-111
• /
• 2002

Presented is a Genetic Algorithm(GA) for dynamic partitioning an ATM LANE(LAN Emulation) network. LANE proves to be one of the best solutions to provide guaranteed Quality of Service(QoS) for mid-size campus or enterprise networks with a little modification of legacy LAN facilities. However, there are few researches on the efficient LANE network operations to deal with scalability issues arising from broadcast traffic delivery. To cope with this scalability issue, proposed is a decision model named LANE Partitioning Problem(LPP) which aims at partitioning the entire LANE network into multiple Emulated LANs(ELANs), each of which works as an independent virtual LAN.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.621-628
• /
• 2005

Scalability of clustering algorithms is critical issues facing the data mining community. This is particularly true for computationally intense tasks such as data clustering. Random sampling of instances is one possible means of achieving scalability but a pervasive problem with this approach is how to deal with the noise that this introduces in the evaluation of the learning algorithm. This paper develops a new optimization based clustering approach using an algorithms specifically designed for noisy performance. Numerical results illustrate that with this algorithm substantial benefits can be achieved in terms of computational time without sacrificing solution quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.575-581
• /
• 1998

In order to accommodate current accelerated growth in customers and traffic. Internet has faced the demand to scale its network dimension both in size and bandwidth, and new service provisioning. One way to solve this problem is to forward If packets based on ATM switching technology. This paper briefly explained technical tasks to apply this If switching technique in ATM networks for building Internet backbone, and presented the directions to approach these tasks. Those tasks are scalability, ATM VC setup and mapping between VC and IP packet flow, traffic management and traffic engineering, multicast, and finally ATM switch architecture to provide multiservice.

• Journal of computational fluids engineering
• /
• v.3 no.1
• /
• pp.22-29
• /
• 1998

Parallel implementation is conducted for a SIMPLER finite volume model. The present parallelism is based on domain decomposition and explicit message passing using MPI and SHMEM. Two parallel solvers to tridiagonal matrix equation are employed. The implementation is verified on the Cray T3E system for a benchmark problem of natural convection in a sidewall-heated cavity. The test results illustrate good scalability of the present parallel models. Performance issues are elaborated in view of convergence as well as conventional parallel overheads and single processor performance. The effectiveness of a localized matrix solution algorithm is demonstrated.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.173-178
• /
• 2012

Using accurate MOSFET substrate parameters obtained by a RF direct extraction method, it is demonstrated that a BSIM4 model with only substrate resistances is not physically valid to apply in the wide range of gate length because of scaling inaccuracy. In order to remove the unphysical problem of the BSIM4, a modified BSIM4 model with additional dielectric substrate capacitance is used and its physical validity is verified by observing excellent gate length scalability.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.337-345
• /
• 2016

Recently, as the number of cores in computer systems has increased, the need for larger memory capacity has also increased. Unfortunately, dynamic random access memory (DRAM), popularly used as main memory for decades, now faces a scalability limitation. Phase change memory (PCM) is considered one of the strong alternatives to DRAM due to its advantages, such as high scalability, non-volatility, low idle power, and so on. However, since PCM suffers from short write endurance, direct use of PCM in main memory incurs a significant problem due to its short lifetime. To solve the lifetime limitation, many studies have focused on reducing the number of bit flips per write request. In this paper, we describe the PCM operating principles in detail and explore various bit flip reduction schemes. Also, we compare their performance in terms of bit reduction rate and lifetime improvement.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.1
• /
• pp.19-25
• /
• 2009

Abstract JPEG2000 achieve quality scalability through the rate control method used in the encoding process, which embeds quality layers to the code-stream. This architecture might raise two drawbacks. First, when the coding process finishes, the number and bit-rates of quality layers are fixed, causing a lack of quality scalability to code-stream encoded with a single or few quality layers. Second, in Post compression rate distortion (PCRD) the bit streams after the truncation points discarded. Therefore, computational power for the discarded bit streams is wasted. For solving of problem, through bit rate control, there are many researches. Each proposed algorithms have specially target feature that is improved performance like reducing computational power. Research results have strength and weakness. For the mean time, research contents are reviewed and compared, so we proposed research direction in the future.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.143-146
• /
• 2015

Software Defined Network (SDN) separates control plane and data plane to achieve benefits such as centralized management, centralized provisioning, lower device cost and more flexibility. In SDN, scalability is an important issue. Centralized controller can be a bottle neck and many research tried to solve this issue on the control plan. However, scalability issue does not only happen in the control plane, but also happen in the data plane. In the data plane, flow table is an important component and its size is limited. In a large network operated by SDN technology, the performance of the network can be highly degraded because of the size limitation of a flow table. In this paper, we propose a ranking-based flow replacement method, Flow Table Management (FTM), to overcome this problem.

• Electronics and Telecommunications Trends
• /
• v.33 no.6
• /
• pp.139-153
• /
• 2018

The explosive interest in block chain, which was triggered by Bitcoin in 2009, is leading to substantial investment and the development of block chain technology. There is no dispute among experts that block chain will be the next generation of innovation. However, despite the high expectations for block chains, the related technology still has certain limitations. In addition to improving issues such as a low transaction throughput, inefficient agreement algorithms, and an inflexible governance structure, it is necessary to solve various problems for commercialization and full-scale spreading owing to the trilemma problem among the scalability, security, and decentralization. Under this situation, identification of the technology characteristics according to the generation is helpful for the development of the core technology requirements and commercialization blueprint in establishing an R&D direction. Therefore, in this article, the development of blockchain technology is divided into generations and analyzed in terms of the operational structure, consensus algorithm, governance, scalability, and security.

• Journal of KIBIM
• /
• v.12 no.4
• /
• pp.52-60
• /
• 2022

Recently, the demand for connection between various heterogeneous dataset and BIM as a construction data model hub is increasing. In the past, in order to connect model between BIM and heterogeneous dataset, related dataset was stored in the RDBMS, and the service was provided by programming a method to link with the BIM object. This approach causes problems such as the need to modify the database schema and business logic, and the migration of existing data when requirements change. This problem adversely affects the scalability, reusability, and maintainability of model information. This study proposes an ontology BIM-based knowledge service framework considering the connectivity and scalability between BIM and heterogeneous dataset. Through the proposed framework, ontology BIM mapping, semantic information query method for linking between knowledge-expressing dataset and BIM are presented. In addition, to identify the effectiveness of the proposed method, the prototype is developed. Also, the effectiveness and considerations of the ontology BIM-based knowledge service framework are derived.