• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.15 no.3
• /
• pp.19-32
• /
• 2020

This study analyzed the effects of ICT technical characteristics of agricultural industry on smart farm entrepreneurial intention by using smart farm effort expectation and smart farm acceptance intention as mediators for smart farm pre-founders. Sub-variables of the technical characteristics of agricultural industry ICT were classified into availability, economics, data convergence and scalability. 349 questionnaires collected from pre-founders living in the country were used for empirical analysis. SPSS v22.0 and Process macro v3.4 were used to analyze the data based on serial multiple mediation model. First, economics and scalability had a positive (+) effect on start-up intention. Second, availability, economics and scalability had a significant effect on effort expectation. Third, effort expectation had a significant positive effect on acceptance intention. Fourth, acceptance intention had a significant positive effect on start-up intention. Fifth, the indirect effects of economics on start-up intention were all significant through effort expectation, through acceptance intention and through both effort expectation and acceptance intention. Sixth, the indirect effect of data convergence on start-up intention was significant through acceptance intention. Seventh, the indirect effect of scalability on start-up intention was significant through effort expectation and through both effort expectation and acceptance intention. As a follow-up study, it is necessary to study for the mediating variables other than mediators introduced in the study or the moderated mediation analysis through the conditional process model in which the moderating variable is introduced.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.375-385
• /
• 2002

The IETF has defined the Intserv model and the RSVP signaling protocol to improve QoS capability for a set of newly emerging services including voice and video streams that require high transmission bandwidth and low delay. However, since the current Intserv model requires each router to maintain the states of each service flow, the complexity and the overhead for processing packets in each rioter drastically increase as the size of the network increases, giving rise to the scalability problem. This motivates our work; namely, we investigate and devise new control schemes to enhance the scalability of the Intesev model. To do this, we basically resort to the SCORE network model, extend it to fairly well adapt to the three services presented in the Intserv model, and devise schemes of the QoS scheduling, the admission control, and the edge and core node architectures. We also carry out the computer simulation by using ns-2 simulator to examine the performance of the proposed scheme in respects of the bandwidth allocation capability, the packet delay, and the packet delay variation. The results show that the proposed scheme meets the QoS requirements of the respective three services of Intserv model, thus we conclude that the proposed scheme enhances the scalability, while keeping the efficiency of the current Intserv model.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.199-210
• /
• 2008

A Clustering based wireless internet proxy server needs a layer-7 load balancer with URL hashing methods to reduce the total storage space for servers. Layer-4 load balancer located in front of server cluster is to distribute client requests to the servers with the same contents at transport layer, such as TCP or UDP, without looking at the content of the request. Layer-7 load balancer located in front of server cluster is to parse client requests in application layer and distribute them to servers based on different types of request contents. Layer 7 load balancer allows servers to have different contents in an exclusive way so that it can minimize the total storage space for servers and improve overall cluster performance. However, its scalability is limited due to the high overhead of parsing requests in application layer as different from layer-4 load balancer. In order to overcome its scalability limitation, in this paper, we propose a distributed layer-7 load balancer by replacing a single layer-7 load balancer in the conventional scheme by a single layer-4 load balancer located in front of server cluster and a set of layer-7 load balancers located at server cluster. In a clustering based wireless internet proxy server, we implemented the conventional scheme by using KTCPVS(Kernel TCP Virtual Server), a linux based layer-7 load balancer. Also, we implemented the proposed scheme by using IPVS(IP Virtual Server), a linux-based layer-4 load balancer, installing KTCPVS in each server, and making them work together. We performed experiments using 16 PCs. Experimental results show scalability and high performance of the proposed scheme, as the number of servers grows, compared to the conventional scheme.

• Journal of Broadcast Engineering
• /
• v.28 no.3
• /
• pp.314-328
• /
• 2023

In this paper, we propose a texture map compression method based on the hierarchical coding method of SHVC to support the scalability function of dynamic mesh compression. The proposed method effectively eliminates the redundancy of multiple-resolution texture maps by downsampling a high-resolution texture map to generate multiple-resolution texture maps and encoding them with SHVC. The dynamic mesh decoder supports the scalability of mesh data by decoding a texture map having an appropriate resolution according to receiver performance and network environment. To evaluate the performance of the proposed method, the proposed method is applied to V-DMC (Video-based Dynamic Mesh Coding) reference software, TMMv1.0, and the performance of the scalable encoder/decoder proposed in this paper and TMMv1.0-based simulcast method is compared. As a result of experiments, the proposed method effectively improves in performance the average of -7.7% and -5.7% in terms of point cloud-based BD-rate (Luma PSNR) in AI and LD conditions compared to the simulcast method, confirming that it is possible to effectively support the texture map scalability of dynamic mesh data through the proposed method.

• 축산식품과학과 산업
• /
• v.6 no.2
• /
• pp.30-33
• /
• 2017

• Electronics and Telecommunications Trends
• /
• v.14 no.2 s.56
• /
• pp.53-57
• /
• 1999

Speedup is often used to show scalability, but its classical definition fails to explain some real measurements such as superlinear speedup. This leads to scaled speedup which scales other system parameters as number of rocessors changes. In this paper, scaled speedup and architectural speedup are introduced and superlinear speedup is explained with its cause.

• Proceedings of the Korea Database Society Conference
• /
• 1998.09a
• /
• pp.347-364
• /
• 1998

Oracle's KM Technology ㆍCore Technologies - Oracle Application Server 4.0 JCORBA Cartridge, JTS - Oracle 8.1 JavaVM, Java Stored Procedure, CORBA/ORB, IIOP - ConText Carridge 8.1 - Enterprise Scalability and Performance - Open SQL Query Layer - Fully-Extensible Object Model for custom solutions ㆍNext Plan - Oracle Application Server 4.1 EJB Cartridge(omitted)

• Annual Conference of KIPS
• /
• 2024.10a
• /
• pp.90-91
• /
• 2024

This study compares CPU-based and custom metric-based scaling methods in Kubernetes, showing that custom metrics tailored to application needs can enhance scalability and efficiency. Findings reveal that, at certain scaling thresholds under dynamic network traffic, custom metrics reduce average latency by 85% to 87% compared to CPU-based scaling.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.527-538
• /
• 2004

In this paper, we present the flow aggregation method and the FLTC(flow lasting time control) algorithm to reduce the number of flows and solve the scalability problem in high speed IP switching networks. The flow aggregation based on the destination address could reduce the total number of flows, improve the label efficiency, and increase the total amount of the switched packets. The FLTC algorithm also eliminates the waste of label by deleting the flow binding efficiently. With the traces of real Internet traffics, we evaluate the performance of these schemes by simulation. The label efficiency, the average number of label used, and the percentage of packets switched and the number of packets switched are used as performance measures for this simulation.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.545-553
• /
• 2009

String matching is a fundamental element of an important category of modern packet processing applications which involve scanning the content flowing through a network for thousands of strings at the line rate. To keep pace with high network speeds, specialized hardware-based solutions are needed which should be efficient enough to maintain scalability in terms of speed and the number of strings. In this paper, a novel architecture based upon a recently proposed data structure called the Bloomier filter is proposed which can successfully support scalability. The Bloomier filter is a compact data structure for encoding arbitrary functions, and it supports approximate evaluation queries. By eliminating the Bloomier filter's false positives in a space efficient way, a simple yet powerful exact string matching architecture is proposed that can handle several thousand strings at high rates and is amenable to on-chip realization. The proposed scheme is implemented in reconfigurable hardware and we compare it with existing solutions. The results show that the proposed approach achieves better performance compared to other existing architectures measured in terms of throughput per logic cells per character as a metric.