• Journal of Information Technology Applications and Management
• /
• 제26권5호
• /
• pp.57-65
• /
• 2019

Recommendation Systems are information technologies that E-commerce merchants have adopted so that online shoppers can receive suggestions on items that might be interesting or complementing to their purchased items. These systems stipulate valuable assistance to the user's purchasing decisions, and provide quality of push service. Traditionally, Recommendation Systems have been designed using a centralized system, but information service is growing vast with a rapid and strong scalability. The next generation of information technology such as Cloud Computing and Big Data Environment has handled massive data and is able to support enormous processing power. Nevertheless, analytic technologies are lacking the different capabilities when processing big data. Accordingly, we are trying to design a conceptual service model with a proposed new algorithm and user adaptation on dynamic recommendation service for big data environment.

• 정보처리학회논문지C
• /
• 제9C권5호
• /
• pp.725-732
• /
• 2002

기존 LAN 환경에서 멀티미디어 실시간 전송과 같은 QoS 보장형 서비스에 대한 요구가 증대되면서, ATM 기술을 LAM에 적용하는 기술들이 등장하였다. LANE(LAN Emulation)은 그러한 기술들 중에서 캠퍼스와 기업의 네트워크 인프라로 가장 많이 보급되고 있는 대안 중의 하나이다. 그러나 활발한 LANE 도입에 비하여 이의 효과적인 운용에 대한 연구는 드문 실정이다. 본 논문에서는 LANE을 구축한 캠퍼스 네트워크에서 멀티미디어 방송형(broadcast) 트래픽의 최적 운영방안에 대하여 논의한다. 방송형 트래픽 관리에서 발생하는 규모성(scalability) 문제로 인하여 전체 LANE 네트워크는 일반적으로 여러 개의 ELAN(Emulated MU)으로 분할되어 관리된다. 본 연구는 특히 규모성 문제해결을 위한 ELAN 구성(configuration)에 수반되는 비용을 정의하고, LANE 성능에 직결되는 규모성 제약과 ELAN 운용과 관계된 기술적 제약하에서 제반비용을 최소화하는 ELAN 구성(LANE 분할) 의사결정모형을 제공한다. 이는 그래프분할문제(graph partition problem)의 확장된 형태로 모형화 되며, 제안된 수리적 모형을 위한 유전자 알고리즘 해법을 개발하여 소개한다. 또한 실제 LANE 네트워크 운영자료를 사용한 실험을 통하여 최적 ELAN 구성을 위한 정책변수들의 효과를 살펴보고, 이러한 결과들이 기존의 LANE 운영과 관련하여 가지는 함축적인 의미를 고찰한다.

• KNOM Review
• /
• 제22권2호
• /
• pp.22-28
• /
• 2019

Science DeMilitarized Zone (DMZ)은 연구데이터의 특성에 최적화 된 대용량 연구데이터 전용 네크워크 기술이다. Science DMZ는 망을 사용하는 연구자 간의 신뢰성을 보장하는 폐쇄망을 구성하여, 전송성능을 저하할 수 있는 보안장비등을 배제함으로써 단대단 성능을 보장한다. Data Transfer Node (DTN)는 연구 데이터의 송수신 기능만을 담당하며 망의 성능과 보안을 보장하는 Science DMZ의 필수 구성요소이다. 현재의 Science DMZ 구조에서는 망사용자마다 DTN 서버를 포설하며 이는 과도한 망 관리 부담, 신규 사용자의 진입장벽, 그리고 망 전체 CAPEX 측면에서 확장성의 한계가 있다. 본 논문에서는 전술한 Science DMZ의 확장성 문제를 해결하기 위해 연구망 사용자들을 그룹화하여 중앙 집중형 공용 DTN 서버를 공유하는 구조에 대해 제시한다. 특히 상용 컴퓨팅 장비의 성능대비 장비 비용 추세를 적용하여 네트워크 로드에 따른 네트워크 장비 구성비용을 비교함으로써, 제안하는 공용 DTN 방안의 효과에 대해 예측 분석한다.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• 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.

• 한국정보통신학회논문지
• /
• 제2권4호
• /
• pp.575-581
• /
• 1998

현재의 인터넷은 대역폭의 확대, 망 규모의 확장, 그리고 새로운 서비스의 제공이라는 과제를 안고 있다. 본 논문에서는 이러한 현재의 인터넷 백본망의 과제를 해결하기 위하여 ATM 스위치를 기반으로 IP 패킷을 전달하는 ATM 망에서의 IP 스위칭 기술을 적용할 경우 고려해야 할 기술적인 과제와 그 해결 방향을 제시하고 있다. 기술적인 과제로 확장성(scalability), ATM VC 설정과 패킷 흐름과의 매핑, 트래픽 관리와 트래픽 엔지니어링의 과제, 멀티캐스트, 그리고 ATM 스위치에서 멀티서비스의 수용의 필요성에 대해서 언급하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1120-1122
• /
• 1999

This paper introduces a clustering for Central Control System in New Distribution Automation System. There are three primary benefits to use clustering: improved availability, easier manageability and more cost-effective scalability. Availability: Clustering can automatically detect the failure of an application or server and quickly restart it on a surviving server. Clients only experience a momentary pause in service. Manageability: Clustering lets administrators quickly inspect the status of all cluster resources and easily move workload around onto different servers within a cluster. Scalability: Applications can use the Clustering services through the MSCS Application Programming Interface(API) to do dynamic load balancing and scale across multiple servers within a cluster.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2002년도 춘계학술발표논문집 (상)
• /
• pp.381-384
• /
• 2002

This paper describes the motivation, design and performance of bi-active Load balancer in Linux Virtual Server. The goal of bi-active Load balancer is to provide a framework to build highly scalable, fault-tolerant services using a large cluster of commodity servers. The TCP/IP stack of Linux Kernel is extended to support three IP load balancing techniques, which can make parallel services of different kinds of server clusters to appear as a service on a single IP address. Scalability is achieved by transparently adding or removing a node in the cluster. and high availability is provided by detecting node or daemon failures and reconfiguring the system appropriately. Extensive simulation reveals that the proposed approach improves the reply rate about 20% compared to earlier design.

• ETRI Journal
• /
• 제30권4호
• /
• pp.618-620
• /
• 2008

A distributed virtual environment (DVE) allows multiple geographically distributed objects to interact concurrently in a shared virtual space. Most DVE applications use a non-replicated server architecture, which dynamically partitions a virtual space. An important issue in this system is effective scalability as the number of users increases. However, it is hard to provide suitable load balancing because of the unpredictable movements of users and hot-spot locations. Therefore, we propose a mechanism for sharing roles and separating service regions. The proposed mechanism reduces unnecessary partitions of short duration and supports efficient load balancing.

• International Journal of Advanced Culture Technology
• /
• 제11권1호
• /
• pp.290-295
• /
• 2023

The global warming by greenhouse gases causes climate change and disasters such as earthquakes and tsunamis frequently, leading to great damage. It is important to build efficient and scalable disaster response services to minimize the damage. Existing disaster warning service by the mobile text is limited by the scalability and the data size to be delivered. In this paper, we propose a framework for disaster response services that is efficient and flexible by allowing to adopt various indexing schemes and scalable by supporting any number of clients in disaster situations anytime and anywhere. Also, the framework by wireless data broadcast can be free from the limitation of the size of data to be delivered. We design and implement the proposed framework and evaluate the framework. For the evaluation, we simulate the implemented framework by adopting various indexing schemes like HCI, DSI and TTSI, and by comparing the access times of the clients. Through the evaluation, we show that the proposed framework can provide efficient and scalable and flexible disaster response services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권7호
• /
• pp.2257-2285
• /
• 2022

Cyber-physical systems (CPS) have been growing exponentially due to improved cloud-datacenter infrastructure-as-a-service (CDIaaS). Incremental expandability (scalability), Quality of Service (QoS) performance, and reliability are currently the automation focus on healthy Tier 4 CDIaaS. However, stable QoS is yet to be fully addressed in Cyber-physical data centers (CP-DCS). Also, balanced agility and flexibility for the application workloads need urgent attention. There is a need for a resilient and fault-tolerance scheme in terms of CPS routing service including Pod cluster reliability analytics that meets QoS requirements. Motivated by these concerns, our contributions are fourfold. First, a Distributed Non-Recursive Cloud Model (DNRCM) is proposed to support cyber-physical workloads for remote lab activities. Second, an efficient QoS stability model with Routh-Hurwitz criteria is established. Third, an evaluation of the CDIaaS DCN topology is validated for handling large-scale, traffic workloads. Network Function Virtualization (NFV) with Floodlight SDN controllers was adopted for the implementation of DNRCM with embedded rule-base in Open vSwitch engines. Fourth, QoS evaluation is carried out experimentally. Considering the non-recursive queuing delays with SDN isolation (logical), a lower queuing delay (19.65%) is observed. Without logical isolation, the average queuing delay is 80.34%. Without logical resource isolation, the fault tolerance yields 33.55%, while with logical isolation, it yields 66.44%. In terms of throughput, DNRCM, recursive BCube, and DCell offered 38.30%, 36.37%, and 25.53% respectively. Similarly, the DNRCM had an improved incremental scalability profile of 40.00%, while BCube and Recursive DCell had 33.33%, and 26.67% respectively. In terms of service availability, the DNRCM offered 52.10% compared with recursive BCube and DCell which yielded 34.72% and 13.18% respectively. The average delays obtained for DNRCM, recursive BCube, and DCell are 32.81%, 33.44%, and 33.75% respectively. Finally, workload utilization for DNRCM, recursive BCube, and DCell yielded 50.28%, 27.93%, and 21.79% respectively.