• 제목/요약/키워드: Edge networks

검색결과 353건 처리시간 0.032초

흐름량을 고려한 네트워크 생존도 계산방법에 관한 연구 (An Algorithm for Calculating Flow-based Network Survivability)

  • 명영수;김현준
    • 한국경영과학회지
    • /
    • 제26권3호
    • /
    • pp.65-77
    • /
    • 2001
  • Survivability of a network is one of the most important issues in designing present-day communication networks. the k-edge survivability of a given network is defined as the percentage of total traffic surviving the worst case failure of k edges. Although several researches calculated k-edge survivability on small networks by enumeration, prior research has considered how to calculate k-edge survivability on large networks. In this paper, we develop an efficient procedure to obtain lower and upper bounds on the k-edge survivability of a network.

  • PDF

Distributed QoS Monitoring and Edge-to-Edge QoS Aggregation to Manage End-to-End Traffic Flows in Differentiated Services Networks

  • Kim, Jae-Young;James Won-Ki Hong
    • Journal of Communications and Networks
    • /
    • 제3권4호
    • /
    • pp.324-333
    • /
    • 2001
  • The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.

  • PDF

An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs

  • Chang, Jung-Hwan
    • Journal of Information Processing Systems
    • /
    • 제7권1호
    • /
    • pp.75-84
    • /
    • 2011
  • The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the graph is only four.

Performance analysis of local exit for distributed deep neural networks over cloud and edge computing

  • Lee, Changsik;Hong, Seungwoo;Hong, Sungback;Kim, Taeyeon
    • ETRI Journal
    • /
    • 제42권5호
    • /
    • pp.658-668
    • /
    • 2020
  • In edge computing, most procedures, including data collection, data processing, and service provision, are handled at edge nodes and not in the central cloud. This decreases the processing burden on the central cloud, enabling fast responses to end-device service requests in addition to reducing bandwidth consumption. However, edge nodes have restricted computing, storage, and energy resources to support computation-intensive tasks such as processing deep neural network (DNN) inference. In this study, we analyze the effect of models with single and multiple local exits on DNN inference in an edge-computing environment. Our test results show that a single-exit model performs better with respect to the number of local exited samples, inference accuracy, and inference latency than a multi-exit model at all exit points. These results signify that higher accuracy can be achieved with less computation when a single-exit model is adopted. In edge computing infrastructure, it is therefore more efficient to adopt a DNN model with only one or a few exit points to provide a fast and reliable inference service.

입지선정 범위 예측을 위한 신경망 기반의 엣지 가중치 예측 (Edge Weight Prediction Using Neural Networks for Predicting Geographical Scope of Enterprises)

  • 고정륜;전현주;전승훈;윤정섭;정재은;김봉길
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2021년도 춘계학술대회
    • /
    • pp.22-24
    • /
    • 2021
  • 본 논문은 노드와 엣지로 이루어진 그래프 구성을 통해 신경망을 활용하여 엣지 가중치 예측 방안을 제안하고자 한다. 사회 구성요소 중 하나인 브랜드들의 중요도 높은 전략 중 출점전략에 대해 초점을 맞추어보았다. 본 논문에서는 1) 브랜드 지점들을 노드로 구성하고, 지점 간 관계를 엣지로 구성한다. 그리고 지점 간 실제 도보 및 주행 가능 거릿값을 엣지 가중치로 표현한 그래프를 구성한다. 그리고 2) 엣지를 수치화하여 신경망을 학습해 엣지의 가중치인 지점 간 거릿값을 예측하는 방안을 제안한다. 제안한 방식을 활용함으로 예측되는 특정 브랜드의 출점 범위를 성공적인 브랜드의 출점전략 분석할 시에 활용할 수 있을 것으로 예상한다.

  • PDF

Game Theory based Dynamic Spectrum Allocation for Secondary Users in the Cell Edge of Cognitive Radio Networks

  • Jang, Sungjin;Kim, Jongbae;Byun, Jungwon;Shin, Yongtae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권7호
    • /
    • pp.2231-2245
    • /
    • 2014
  • Cognitive Radio (CR) has very promising potential to improve spectrum utilization by allowing unlicensed Secondary Users (SUs) to access the spectrum dynamically without disturbing licensed Primary Users (PUs). Mitigating interference is a fundamental problem in CR scenarios. This is particularly problematic for deploying CR in cellular networks, when users are located at the cell edge, as the inter-cell interference mitigation and frequency reuse are critical requirements for both PUs and SUs. Further cellular networks require higher cell edge performance, then SUs will meet more challenges than PUs. To solve the performance decrease for SUs at the cell edge, a novel Dynamic Spectrum Allocation (DSA) scheme based on Game Theory is proposed in this paper. Full frequency reuse can be realized as well as inter-cell interference mitigated according to SUs' sensing, measurement and interaction in this scheme. A joint power/channel allocation algorithm is proposed to improve both cell-edge user experience and network performance through distributed pricing calculation and exchange based on game theory. Analytical proof is presented and simulation results show that the proposed scheme achieves high efficiency of spectrum usage and improvement of cell edge SUs' performance.

A Heuristic Algorithm for Optimal Facility Placement in Mobile Edge Networks

  • Jiao, Jiping;Chen, Lingyu;Hong, Xuemin;Shi, Jianghong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권7호
    • /
    • pp.3329-3350
    • /
    • 2017
  • Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be $O(H^2{\gamma})$, where H is the height of the tree and ${\gamma}$ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.

전력정보 전달을 위한 ATM 망 설계 (Design of ATM Networks to transfer for Electric Power System Informations)

  • 정영경;김한경
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
    • /
    • pp.572-574
    • /
    • 1998
  • In this paper, we are proposed design of ATM networks to transfer for electric power system informations, proposed transport networks is partitioned management part and functional part, management part is partitioned edge network, core network, local network, authority network, functional part is partitioned core network, access network, edge area. It is based on laying and partitioning by ITU-T G.805, we also proposed ATM network requirements for Carrier Relay traffic acceptability in electric power system information.

  • PDF

컬러 영상 에지에 강건한 퍼지 웨이브렛 형태학 신경망 알고리즘 제안 (The Proposal of the Robust Fuzzy Wavelet Morphology Neural Networks Algorithm for Edge of Color Image)

  • 변오성
    • 한국컴퓨터정보학회논문지
    • /
    • 제12권2호
    • /
    • pp.53-62
    • /
    • 2007
  • 본 논문에서는 영상 에지 검출에 있어서 명암차에 의해 불분명한 경계 부분을 강건하게 하고, 방향성에 덜 민감한 에지 검출 알고리즘인 퍼지 웨이브렛 형태학 신경망을 제안한다. 이는 복잡하고 많은 연산 수행하는 단점을 극복하기 위해 DTCNN 구조에 데이터의 손실없이 강건하게 영상 단순화가 가능한 퍼지 웨이브렛 형태학 연산자를 적용한다. 또한 컬러 영상에서 효과적으로 에지 경계면의 특징 정보를 손실없이 가지고 있는 Y 영상을 YCbCr 공간 컬러 모델을 이용하여 분할 한다. 본 논문은 제안된 알고리즘의 성능검증을 위해 50개의 컬러 영상의 모의 실험을 제공한다.

  • PDF

도로 윤곽 검출을 위한 셀룰러 아나로직 병렬처리 회 로망(CAPPN) 알고리즘 (Fast Road Edge Detection with Cellular Analogic Parallel Processing Networks)

  • 홍승완;김형석;김봉수
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(3)
    • /
    • pp.143-146
    • /
    • 2002
  • The aim of this work is the real-time road edge detection using the fast processing of Cellular Analogic Parallel Processing Networks(CAPPN). The CAPPN is composed of 2D analog cell way. If the dynamic programming is implemented with the CAPPN, the optimal path can be detected in parallel manner Provided that fragments of road edge are utilized as the cost inverse(benefit) in the CAPPN-based optimal path algorithm, the CAPPN determines the most plausible path as the road edge line. Benefits of the proposed algorithm are the fast processing and the utilization of optimal technique to determine the road edge lines.

  • PDF