• Journal of the Korean Statistical Society
• /
• v.24 no.1
• /
• pp.225-231
• /
• 1995

An eventual uniform equicontinuity condition is investigated in the context of the uniform central limit theorem (UCLT) for continuous martingales. We assume the usual intergrability condition on metric entropy. We establish an exponential inequality for a martingales. Then we use the chaining lemma of Pollard (1984) to prove an eventual uniform equicontinuity which is a sufficient condition of UCLT. We apply the result to approximate a stochastic integral with respect to a martingale to that of a Brownian motion.

• Information and Communications Magazine
• /
• v.31 no.9
• /
• pp.46-51
• /
• 2014

미래지향적 네트워크 및 서비스 인프라의 구축을 위해 네트워크의 개방화와 가상화에 대한 관심이 높아졌다. 이를 지원하는 기술로서 SDN (Software-defined Networking) 및 NFV(Network Function Virtualisation) 기술이 소개되었다. 특히 트래픽에 따라 필요한 네트워크 기능들을 선택적으로 조합 및 실행하여 하나의 네트워크 서비스를 구현하는 서비스 체이닝(Service Chaining 혹은 Service Function Chaining) 기술이 높은 관심을 받고 있다. 이를 통해 컴포넌트 서비스들로 이루어진 경로를 정의함으로써 네트워크 서비스를 적시에 구성 및 능동적으로 제어할 수 있다. 본 고에서는 서비스 체이닝 기술의 기본 개념및 기능에 대해 간략히 소개하고, 주요 기능의 표준화를 담당하는 IETF SFC WG 의 주요 표준화 이슈에 대한 분석 및 향후 전망을 기술한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1032-1039
• /
• 2015

Service function chaining(SFC) defines the creation of network services that consist of an ordered set of service function. A multiple service function instances should be deployed across networks for scalable and fault-tolerant SFC services. Therefore, an incoming flows should be distributed to multiple service function instances appropriately. In this paper, we formulate the flow distribution problem in SFC aiming at minimizing the end-to-end flow latency under resource constraints. Then, we evaluate its optimal solution in a realistic network topology generated by the GT-ITM topology generator. Simulation results reveal that the optimal solution can reduce the total flow latency significantly.

• Journal of Internet Computing and Services
• /
• v.16 no.6
• /
• pp.47-55
• /
• 2015

The conventional dynamic routing methods in Software Defined Networks (SDN) set the optimal routing path based on the minimum link cost, and thereby transmits the incoming or outgoing flows to the terminal. However, in this case, flows can bypass the middlebox that is responsible for security service and thus, thus the network can face a threat. That is, while determining the best route for each flow, it is necessary to consider a dynamic service chaining, which routes a flow via a security middlebox. Therefore, int this paper, we propose a new dynamic routing method that considers the dynamic flow routing method combined with the security service functions over the SDN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4640-4661
• /
• 2018

To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.39-47
• /
• 2006

The evaluation of MDx family hash functions such as MD5 is difficult because the design background or a generalized model is unknown. In this paper, an approximated model is proposed to generalize hash functions. The diffusion of a input difference is tested by an approximated model for MD5. The results show that MD5 does not provide perfect diffusion, so MD5 is weak against some attacks. We propose a multiple chaining pattern which provides perfect diffusion in approximated model of hash function without extra calculation or memory. And We show the probability of differential characteristics of our proposal.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.2
• /
• pp.55-69
• /
• 2010

This article proposed the authentication protocol for peer-to-peer resource sharing community. The proposed protocol does not require a priori information for generating and exchanging authentication key. Also this protocol can provide the delicate access control by allowing the user(authenticator) to assign the trust level to the authentication supplicant, which can be used to decide if the resource providing node will accept the resource sharing request from a resource requesting node. Trust Relationship Chaining provides the environment where trust levels (included in the trust table) of nodes in the resource sharing community are propagated among nodes when trust tables are exchanged between two nodes engaged in mutual authentication process and authentication refresh so that any two nodes which are not directly mutual-authenticated can assign the trust level each other for the access control for resource sharing. In the proposed protocol a node can implements the authentication refresh continuously to verify the effectiveness of authentication after mutual authentication so that the authentication of new node or authentication revocation(effectiveness cancellation) of the departed node can be propagated to the all the nodes in RSC and eventually safe resource sharing community is configured.

• Therapeutic Science for Rehabilitation
• /
• v.13 no.1
• /
• pp.87-97
• /
• 2024

Objective : This study aimed to acquire activities of daily living (ADL) skills through activity analysis and forward chaining in children with developmental disabilities. Methods : In this study, the performance of children with developmental disabilities was guided stepwise using a changing criterion design. The intervention was conducted in forward chaining after the therapist analyzed the activities of three tasks (shoes, shorts, and short-sleeved T-shirts) set as the Canadian Occupational Performance Measure (COPM). The performance rate at each stage of the three tasks was used as an independent variable, and COPM performance and satisfaction scores before and after the intervention were set as dependent variables. Results : The task performance rates of children wearing shoes, shorts, and short-sleeved T-shirts improved over time. Even at home, the scores for performance and satisfaction of all three tasks increased. Conclusion : Hopefully, activity analysis and behavioral chaining methods will be used not only for ADL but also for various tasks in children with developmental disabilities who have difficulty acquiring tasks.

• Journal of Information Processing Systems
• /
• v.11 no.2
• /
• pp.266-279
• /
• 2015

In this paper, we propose a novel block cipher mode of operation, which is known as the counter chain (CC) mode. The proposed CC mode integrates the cipher block chaining (CBC) block cipher mode of operation with the counter (CTR) mode in a consistent fashion. In the CC mode, the confidentiality and authenticity of data are assured by the CBC mode, while speed is achieved through the CTR mode. The proposed mode of operation overcomes the parallelization deficiency of the CBC mode and the chaining dependency of the counter mode. Experimental results indicate that the proposed CC mode achieves the encryption speed of the CTR mode, which is exceptionally faster than the encryption speed of the CBC mode. Moreover, our proposed CC mode provides better security over the CBC mode. In summary, the proposed CC block cipher mode of operation takes the advantages of both the Counter mode and the CBC mode, while avoiding their shortcomings.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.353-359
• /
• 1999

We present a matrix-based inference algorithm suitable for electronic commerce applications. For this purpose, an Extended AND-OR Graph (EAOG) was developed with the intention that fast inference process is enabled within the electronic commerce situations. The proposed EAOG inference mechanism has the following three characteristics. 1. Real-time inference: The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation. 2. Matrix operation: All the subjective knowledge is delineated in a matrix form. so that inference process can proceed based on the matrix operation which is computationally efficient. 3. Bi-directional inference: Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency. We have proved the validity of our approach with several propositions and an illustrative EC example.