• Title/Summary/Keyword: Edge computing.

Search Result 505, Processing Time 0.026 seconds

A XML Instance Repository Model based on the Edge-Labeled Graph (Edge-Labeled 그래프 기반의 XML 인스턴스 저장 모델)

  • Kim Jeong-Hee;Kwak Ho-Young
    • Journal of Internet Computing and Services
    • /
    • v.4 no.6
    • /
    • pp.33-42
    • /
    • 2003
  • A XML Instance repository model based on the Edge-Labeled Graph is suggested for storing the XML instance in Relational Databases, This repository model represents the XML instance as a data graph based on the Edge-Labeled Graph, extracts the defined value based on the structure of data path, element, attribute, and table index table presented as database schema, and stores these values using the Mapper module, In order to support querry, XML repository model offers the module translating XQL which is a query language under XPATH to SQL, and has DBtoXML generator module restoring the stored XML instance. As a result, it is possible to represent the storage relationship between the XML instances and the proposed repository model in terms of Graph-based Path, and it shows the possibility of easy search of specific element and attribute information.

  • PDF

Performance Optimization and Analysis on P2P Mobile Communication Systems Accelerated by MEC Servers

  • Liang, Xuesong;Wu, Yongpeng;Huang, Yujin;Ng, Derrick Wing Kwan;Li, Pei;Yao, Yingbiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.1
    • /
    • pp.188-210
    • /
    • 2022
  • As a promising technique to support tremendous numbers of Internet of Things devices and a variety of applications efficiently, mobile edge computing (MEC) has attracted extensive studies recently. In this paper, we consider a MEC-assisted peer-to-peer (P2P) mobile communication system where MEC servers are deployed at access points to accelerate the communication process between mobile terminals. To capture the tradeoff between the time delay and the energy consumption of the system, a cost function is introduced to facilitate the optimization of the computation and communication resources. The formulated optimization problem is non-convex and is tackled by an iterative block coordinate descent algorithm that decouples the original optimization problem into two subproblems and alternately optimizes the computation and communication resources. Moreover, the MEC-assisted P2P communication system is compared with the conventional P2P communication system, then a condition is provided in closed-form expression when the MEC-assisted P2P communication system performs better. Simulation results show that the advantage of this system is enhanced when the computing capability of the receiver increases whereas it is reduced when the computing capability of the transmitter increases. In addition, the performance of this system is significantly improved when the signal-to-noise ratio of hop-1 exceeds that of hop-2.

An Efficient Algorithm for Finding the k-edge Survivability in Ring Networks

  • Myung, Young-Soo
    • Management Science and Financial Engineering
    • /
    • v.16 no.3
    • /
    • pp.85-93
    • /
    • 2010
  • Given an undirected network with a set of source-sink pairs, we are assumed to get a benefit if a pair of source and sink nodes are connected. The k-edge survivability of a network is defined as the total benefit secured after arbitrarily selected k edges are destroyed. The problem of computing k-edge survivability is known to be NP-hard and has applications of evaluating the survivability or vulnerability of a network. In this paper, we consider the k-edge survivability problem restricted to ring networks and develop an algorithm to solve it in O($n^3$|K|) time where n is the number of nodes and K is the set of source-sink pairs.

A Study on Performance Compare WasmEdge to different Runtimes, Frameworks (WasmEdge와 다양한 런타임 및 프레임워크에서의 성능 비교 연구)

  • Seok-Min Hong;So-Yeoung Lee;Yong-Tae Shin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.95-98
    • /
    • 2024
  • 현대 소프트웨어는 다양한 서비스 구조가 사용되고 있다. 이러한 환경에서는 각 서비스의 요구사항을 충족시킬 수 있는 기술들이 필요하며, Wasm(WebAssembly)은 많은 서비스에서 요구하는 조건을 만족시킬 수 있는 장점을 가지고 있다. 이에 본 논문에서는 WasmEdge와 다양한 런타임 환경의 성능을 비교하기 위해 로직 실행 시간, HTTP 부하 테스트, 컨테이너 이미지 크기의 세 가지 지표를 분석한다. 결과는 로직 실행 시간에서 Wasm이 1.81초로 가장 빨랐고, 컨테이너 이미지 크기 역시 9.54MB로 가장 작았다. 마지막으로 HTTP 부하 테스트에서는 가장 빠른 트래픽 처리를 보여준 Spring Boot의 평균 초당 15076개보다 WasmEdge가 9239개로 트래픽 처리가 느렸지만, 로직 실행 속도와 컨테이너 이미지 크기가 작기 때문에 충분히 서버리스 컴퓨팅, 마이크로 서버, 엣지 컴퓨팅 분야에서 요구하는 조건을 만족시킬 수 있다.

Energy-Efficient Resource Allocation for Application Including Dependent Tasks in Mobile Edge Computing

  • Li, Yang;Xu, Gaochao;Ge, Jiaqi;Liu, Peng;Fu, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2422-2443
    • /
    • 2020
  • This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

Development of an intelligent edge computing device equipped with on-device AI vision model (온디바이스 AI 비전 모델이 탑재된 지능형 엣지 컴퓨팅 기기 개발)

  • Kang, Namhi
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.17-22
    • /
    • 2022
  • In this paper, we design a lightweight embedded device that can support intelligent edge computing, and show that the device quickly detects an object in an image input from a camera device in real time. The proposed system can be applied to environments without pre-installed infrastructure, such as an intelligent video control system for industrial sites or military areas, or video security systems mounted on autonomous vehicles such as drones. The On-Device AI(Artificial intelligence) technology is increasingly required for the widespread application of intelligent vision recognition systems. Computing offloading from an image data acquisition device to a nearby edge device enables fast service with less network and system resources than AI services performed in the cloud. In addition, it is expected to be safely applied to various industries as it can reduce the attack surface vulnerable to various hacking attacks and minimize the disclosure of sensitive data.

Energy-Efficient MEC Offloading Decision Algorithm in Industrial IoT Environments (산업용 IoT 환경에서 MEC 기반의 에너지 효율적인 오프로딩 결정 알고리즘)

  • Koo, Seolwon;Lim, YuJin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.11
    • /
    • pp.291-296
    • /
    • 2021
  • The development of the Internet of Things(IoT) requires large computational resources for tasks from numerous devices. Mobile Edge Computing(MEC) has attracted a lot of attention in the IoT environment because it provides computational resources geographically close to the devices. Task offloading to MEC servers is efficient for devices with limited battery life and computational capability. In this paper, we assumed an industrial IoT environment requiring high reliability. The complexity of optimization problem in industrial IoT environment with many devices and multiple MEC servers is very high. To solve this problem, the problem is divided into two. After selecting the MEC server considering the queue status of the MEC server, we propose an offloading decision algorithm that optimizes reliability and energy consumption using genetic algorithm. Through experiments, we analyze the performance of the proposed algorithm in terms of energy consumption and reliability.

Stacked Sparse Autoencoder-DeepCNN Model Trained on CICIDS2017 Dataset for Network Intrusion Detection (네트워크 침입 탐지를 위해 CICIDS2017 데이터셋으로 학습한 Stacked Sparse Autoencoder-DeepCNN 모델)

  • Lee, Jong-Hwa;Kim, Jong-Wouk;Choi, Mi-Jung
    • KNOM Review
    • /
    • v.24 no.2
    • /
    • pp.24-34
    • /
    • 2021
  • Service providers using edge computing provide a high level of service. As a result, devices store important information in inner storage and have become a target of the latest cyberattacks, which are more difficult to detect. Although experts use a security system such as intrusion detection systems, the existing intrusion systems have low detection accuracy. Therefore, in this paper, we proposed a machine learning model for more accurate intrusion detections of devices in edge computing. The proposed model is a hybrid model that combines a stacked sparse autoencoder (SSAE) and a convolutional neural network (CNN) to extract important feature vectors from the input data using sparsity constraints. To find the optimal model, we compared and analyzed the performance as adjusting the sparsity coefficient of SSAE. As a result, the model showed the highest accuracy as a 96.9% using the sparsity constraints. Therefore, the model showed the highest performance when model trains only important features.

Research on Metadata Schema for Data Exchange between Smart Housing Fire Service and Smart City Integration Platform (스마트하우징 화재 서비스의 스마트시티 플랫폼 연계 데이터 교환용 메타데이터 스키마 연구)

  • Dae-Kug Lee;Dae-Gyu Lee;Hyun-Kook Kahng;Choong-Ho Cho
    • Journal of Internet Computing and Services
    • /
    • v.25 no.2
    • /
    • pp.113-122
    • /
    • 2024
  • Recently, cutting-edge ICT technologies such as artificial intelligence, blockchain, edge computing, and the Internet of Things have been applied in various fields to create new services and a new digital era. Along with these technological developments, various policies are being implemented in Korea to transform the country from a "Smart City" to a "Platform City". We can create new services and values by linking with the Smart City Integrated Platform and Smart Housing Platform. This paper defines a linkage scenario between a Smart Housing Platform and the Smart 119 Emergency Dispatch Support Service, one of the Smart City Safety Nets. We propose a data transmission protocol and a metadata schema for data exchange between the Smart Housing Platform and the Smart City Integrated Platform to provide the Smart 119 Emergency Dispatch Support Service.

Graph Assisted Resource Allocation for Energy Efficient IoT Computing

  • Mohammed, Alkhathami
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.140-146
    • /
    • 2023
  • Resource allocation is one of the top challenges in Internet of Things (IoT) networks. This is due to the scarcity of computing, energy and communication resources in IoT devices. As a result, IoT devices that are not using efficient algorithms for resource allocation may cause applications to fail and devices to get shut down. Owing to this challenge, this paper proposes a novel algorithm for managing computing resources in IoT network. The fog computing devices are placed near the network edge and IoT devices send their large tasks to them for computing. The goal of the algorithm is to conserve energy of both IoT nodes and the fog nodes such that all tasks are computed within a deadline. A bi-partite graph-based algorithm is proposed for stable matching of tasks and fog node computing units. The output of the algorithm is a stable mapping between the IoT tasks and fog computing units. Simulation results are conducted to evaluate the performance of the proposed algorithm which proves the improvement in terms of energy efficiency and task delay.