• 제목/요약/키워드: In-network computation

검색결과 795건 처리시간 0.029초

A Design of Architecture for Federating between NRNs and Determination Optimal Path

  • Park, Jinhyung;Cho, Hyunhun;Lee, Wonhyuk;Kim, Seunghae;Yun, Byoung-Ju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권2호
    • /
    • pp.678-690
    • /
    • 2014
  • The current networks do not disclose information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to calculate an optimal path to the destination. Also, due to poor information sharing, if an error occurs in the intermediate path, it is very difficult to re-search the path and find the best path. Hence, to manage each domain more efficiently, an architecture with top-level path computation node which can obtain information of separate nodes are highly needed This study aims to investigate a federation of a united network around NRN(National Research Network) that could allow resource sharing between countries and also independent resource management for each country. Considering first the aspects that can be accessed from the perspective of a national research network, ICE(Information Control Element) and GFO(Global Federation Organizer)-based architecture is designed as a top-level path computation element to support traffic engineering and applied to the multi-domain network. Then, the federation for the independent management of resources and resource information sharing among national research networks have been examined.

전력계통해석을 위한 자코비안행렬 가우스소거의병렬계산 알고리즘 (Parallel Computation Algorithm of Gauss Elimination in Power system Analysis)

  • 서의석;오태규
    • 대한전기학회논문지
    • /
    • 제43권2호
    • /
    • pp.189-196
    • /
    • 1994
  • This paper describes a parallel computing algorithm in Gauss elimination of Jacobian matrix to large-scale power system. The structure of Jacobian matrix becomes different according to ordering method of buses. In sequential computation buses are ordered to minimize the number of fill-in in the triangulation of the Jacobian matrix. The proposed method develops the parallelism in the Gauss elimination by using ND(nested dissection) ordering. In this procedure the level structure of the power system network is transformed to be long and narrow by using end buses which results in balance of computing load among processes and maximization of parallel computation. Each processor uses the sequential computation method to preserve the sqarsity of matrix.

  • PDF

Software Defined Networking and Network Function Virtualization for improved data privacy using the emergent blockchain in banking systems

  • ALRUWAILI, Anfal;Hendaoui, Saloua
    • International Journal of Computer Science & Network Security
    • /
    • 제21권8호
    • /
    • pp.111-118
    • /
    • 2021
  • Banking systems are sensitive to data privacy since users' data, if not well protected, may be used to perform fake transactions. Blockchains, public and private, are frequently used in such systems thanks to their efficiency and high security. Public blockchains fail to fully protect users' data, despite their power in the accuracy of the transactions. The private blockchain is better used to protect the privacy of the sensitive data. They are not open and they apply authorization to login into the blockchain. However, they have a lower security compared to public blockchain. We propose in this paper a hybrid public-private architecture that profits from network virtualization. The main novelty of this proposal is the use of network virtualization that helps to reduce the complexity and efficiency of the computations. Simulations have been conducted to evaluate the performance of the proposed solution. Findings prove the efficiency of the scheme in reducing complexity and enhancing data privacy by guarantee high security. The contribution conducted by this proposal is that the results are verified by the centralized controller that ensures a correct validation of the resulted blockchains. In addition, computation complexity is to be reduced by profiting from the cooperation performed by the virtual agents.

An Overview of Mobile Edge Computing: Architecture, Technology and Direction

  • Rasheed, Arslan;Chong, Peter Han Joo;Ho, Ivan Wang-Hei;Li, Xue Jun;Liu, William
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권10호
    • /
    • pp.4849-4864
    • /
    • 2019
  • Modern applications such as augmented reality, connected vehicles, video streaming and gaming have stringent requirements on latency, bandwidth and computation resources. The explosion in data generation by mobile devices has further exacerbated the situation. Mobile Edge Computing (MEC) is a recent addition to the edge computing paradigm that amalgamates the cloud computing capabilities with cellular communications. The concept of MEC is to relocate the cloud capabilities to the edge of the network for yielding ultra-low latency, high computation, high bandwidth, low burden on the core network, enhanced quality of experience (QoE), and efficient resource utilization. In this paper, we provide a comprehensive overview on different traits of MEC including its use cases, architecture, computation offloading, security, economic aspects, research challenges, and potential future directions.

SLS의 공정 파라미터 최적화에 관한 연구 (Optimization of Build Parameters in SLS Process)

  • 허성민;오도근;최경현;이석희
    • 대한기계학회논문집A
    • /
    • 제24권3호
    • /
    • pp.769-776
    • /
    • 2000
  • RP(Rapid Prototyping) technology is gaining its popularity in building a prototype in all industries. SLS(Slective Laser Sintering) is one of RP technologies, which is focused on tooling processes as well as three dimension solid model. There are several factors, the length and the cross-sectional area of a part, that have an effect on build setup in SLS process. In this paper, the computation on geometrical relationship is used to slice STL file and to estimate these factors. Based on these values, the build setup parameters such as the heating temperature, the laser power, and the powder cartridge feed rate are determined by neural network approaches. The test results show that the computation time is saved and the neural network approach is able to apply to get the optimal parameters of build process within an acceptable error rate.

Sparse 소수를 사용한 효과적인 지수연산 (A fast exponentiation with sparse prime)

  • 고재영;박봉주;김인중
    • 한국통신학회논문지
    • /
    • 제23권4호
    • /
    • pp.1024-1034
    • /
    • 1998
  • 정보통신망에서 사용하는 공개키 암호시스템은 대부분 지수 연산을 사용한다. 하지만, 암호시스템은 안전성을 고려한 큰 수의 지수 연산을 사용하기 때문에 많은 계산 량과 준비시간을 요구한다. 이러한 문제점을 해결하기 위하여 모듈러 감소 연산에서 Montgomery, Yang, Kawamura 등이 사전계산 방법, 중간계산, 그리고 테이블을 사용하는 방법을 제안하였으며, 지수 연산에서 Coster, Brickel, Lee 등이 addition chain, window, 그리고 고정된 수를 사용하는 경우 사전 계산을 하는 방법을 제안하였다. 본 논문에서는 sparse 소수를 사용한 모듈러 감소 연산 방법을 제안하고 지수연산시 계산 량을 줄이는 방법을 제안한다. 이는 이산대수 방식의 암호시스템에서 매우 효과적으로 적용할 수 있다.

  • PDF

다층 신경 망을 이용한 비중심F분포 확률계산 (Computation of Noncentral F Probabilities using multilayer neural network)

  • 구선희
    • 정보처리학회논문지B
    • /
    • 제9B권3호
    • /
    • pp.271-276
    • /
    • 2002
  • ANOVA 검정에서 검정통계량은 단일 또는 이중 비중심F분포를 따르며 비중심F분포는 일반적인 선형 가설 검정에서 검정함수 계산에 적용되고 있다. 기존 비중심F분포의 함수 계산에 대한 연구로 여러 접근 방법이 제시되었지만, 하나의 정확한 함수값을 구하는데도 많은 시간이 소요되는 문제점이 발생되었다. 본 논문에서는 기존 함수 계산의 문제점을 해결하기 위하여 다층 퍼셉트론 네트워크로부터 역전파 학습 알고리즘을 적용하여 비중심F분포의 함수값을 구하는 방법을 제안하였다. 제안된 신경망에 의한 함수값과 기존 Patnaik이 제시한 분포식에 의한 함수값의 차이를 표와 그림을 통하여 비교하였으며, 정확성과 계산속도를 고려할 때 Patnaik의 함수식에 의한 방법보다 신경망을 이용한 방법이 효율적임을 알 수가 있다.

Regulatory Network Analysis of MicroRNAs and Genes in Neuroblastoma

  • Wang, Li;Che, Xiang-Jiu;Wang, Ning;Li, Jie;Zhu, Ming-Hui
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제15권18호
    • /
    • pp.7645-7652
    • /
    • 2014
  • Neuroblastoma (NB), the most common extracranial solid tumor, accounts for 10% of childhood cancer. To date, scientists have gained quite a lot of knowledge about microRNAs (miRNAs) and their genes in NB. Discovering inner regulation networks, however, still presents problems. Our study was focused on determining differentially-expressed miRNAs, their target genes and transcription factors (TFs) which exert profound influence on the pathogenesis of NB. Here we constructed three regulatory networks: differentially-expressed, related and global. We compared and analyzed the differences between the three networks to distinguish key pathways and significant nodes. Certain pathways demonstrated specific features. The differentially-expressed network consists of already identified differentially-expressed genes, miRNAs and their host genes. With this network, we can clearly see how pathways of differentially expressed genes, differentially expressed miRNAs and TFs affect on the progression of NB. MYCN, for example, which is a mutated gene of NB, is targeted by hsa-miR-29a and hsa-miR-34a, and regulates another eight differentially-expressed miRNAs that target genes VEGFA, BCL2, REL2 and so on. Further related genes and miRNAs were obtained to construct the related network and it was observed that a miRNA and its target gene exhibit special features. Hsa-miR-34a, for example, targets gene MYC, which regulates hsa-miR-34a in turn. This forms a self-adaption association. TFs like MYC and PTEN having six types of adjacent nodes and other classes of TFs investigated really can help to demonstrate that TFs affect pathways through expressions of significant miRNAs involved in the pathogenesis of NB. The present study providing comprehensive data partially reveals the mechanism of NB and should facilitate future studies to gain more significant and related data results for NB.

A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time Computation Complexity

  • Kwak, Dong-Yong;Ko, Nam-Seok;Kim, Bong-Tae;Park, Hong-Shik
    • ETRI Journal
    • /
    • 제25권6호
    • /
    • pp.475-488
    • /
    • 2003
  • In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.

  • PDF

진화연산과 신경망이론을 이용한 전력계통의 최적환경 및 경제운용 (Optimal Environmental and Economic Operation using Evolutionary Computation and Neural Networks)

  • 이상봉;김규호;유석구
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권12호
    • /
    • pp.1498-1506
    • /
    • 1999
  • In this paper, a hybridization of Evolutionary Strategy (ES) and a Two-Phase Neural Network(TPNN) is applied to the optimal environmental and economic operation. As the evolutionary computation, ES is to search for the global optimum based on natural selection and genetics but it shows a defect of reducing the convergence rate in the latter part of search, and often does not search the exact solution. Also, neural network theory as a local search technique can be used to search a more exact solution. But it also has the defect that a solution frequently sticks to the local region. So, new algorithm is presented as hybrid methods by combining merits of two methods. The hybrid algorithm has been tested on Emission Constrained Economic Dispatch (ECED) problem and Weighted Emission Economic Dispatch (WEED) problem for optimal environmental and economic operation. The result indicated that the hybrid approach can outperform the other computational efficiency and accuracy.

  • PDF