• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.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.

• Journal of Communications and Networks
• /
• v.3 no.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.

• Journal of Information Processing Systems
• /
• v.7 no.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.

• ETRI Journal
• /
• v.42 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.22-24
• /
• 2021

This paper is a proposal for edge weight prediction using neural networks to graph configurations of nodes and edges. Brand is one of the components of society. and one of the brand's most important strategies is geographical location strategy. This paper is focus on that strategy. In This paper propose two things: 1) Graph Configuration. node consists of brand store, edge consists of store-to-store relationships and edge weight consists of actual walk and drive distance values. 2) numbering edges and training neural networks to predict next store distance values. It is expected to be useful in analyzing successful brand geographical location strategies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.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.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.53-62
• /
• 2007

In this paper, it can propose that Fuzzy Wavelet Morphology Neural Networks for the edge detection algorithm with being robustly a unclear boundary parts by brightness difference and being less sensitivity on direction to be detected the edges of images. This is applying the Fuzzy Wavelet Morphology Operator which can be simple the image robustly without the loss of data to DTCNN Structure for improving defect which carrys out a lot of operation complexly. Also, this color image can segment Y image with YCbCr space color model which has a lossless feature information of edge boundary sides effectively. This paper can offer the simulation of color images of 50ea for the performance verification of the proposal algorithm.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• 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.