• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5673-5691
• /
• 2019

Information centric mobile network can significantly improve the data retrieving efficiency by caching contents at mobile edge. However, the cache pollution attack can affect the data obtaining process severely by requiring unpopular contents deliberately. To tackle the problem, we design an algorithm of mitigating cache pollution attacks in information centric mobile network. Particularly, the content popularity distribution statistic is proposed to detect abnormal behavior. Then a probabilistic caching strategy based on abnormal behavior is applied to dynamically maintain the steady-state distribution for content visiting probability and achieve the purpose of defense. The experimental results show that the proposed scheme can achieve higher request hit ratio and smaller latency for false locality content pollution attack than the CacheShield approach and the baseline approach where no mitigation approach is applied.

• The KIPS Transactions:PartC
• /
• v.8C no.4
• /
• pp.415-420
• /
• 2001

VLSI 기술의 빠른 발전으로 디지털 시스템의 동작주파수가 높아짐에 따라 고속 통신시스템 의 하드웨어 설계 시 신호 무결성을 고려한 설계가 필수적이다. 디지털시스템에서의 잡음원 은 전송선에서의 전원장치, 접지 바운스, 실장 재료 등에 관련된다. 본 연구에서는 고속네트 워크/통신시스템의 기가비트 연결 설계기술에 필요한 요소들을 언급하였고, 실제 설계 신호 불연속에 영향을 미치는 커넥터의 누화 및 전송선의 표피 효과, 유전손실 등을 고려한 백플 레인보드를 시뮬레이션 하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.640-643
• /
• 2004

As the size of a network increases, the network complexity and maintenance cost is high. In literatures, many cost factors of multistage interconnection networks were intensively investigated. However, in some parts, these types of cost definition are not satisfactory enough since they don't relate the cost measure to technology closely and also fail to incorporate exact tradeoffs in designing the network. In this paper, we propose some cost effective measures which combine the cost factors with performance-related reliability measures, and compare several networks for a guidance to select a certain case depending on the principal concerns for use.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.60-74
• /
• 2023

Integration of the machine learning (ML) technique in all-optical networks can enhance the effectiveness of resource utilization, quality of service assurances, and scalability in optical networks. All-optical multistage interconnection networks (MINs) are implicitly designed to withstand the increasing highvolume traffic demands at data centers. However, the contention resolution mechanism in MINs becomes a bottleneck in handling such data traffic. In this paper, a select list of ML algorithms replaces the traditional electronic signal processing methods used to resolve contention in MIN. The suitability of these algorithms in improving the performance of the entire network is assessed in terms of injection rate, average latency, and latency distribution. Our findings showed that the ML module is recommended for improving the performance of the network. The improved performance and traffic grooming capabilities of the module are also validated by using a hardware testbed.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.6
• /
• pp.853-858
• /
• 2019

One of the methods which can enhance the efficiency of railroad network is construction of interconnection branch line for several route to share one railway. In Korea, this method already has been implemented or excuted as project level. This study suggests a network design model and a solution algorithm to choice most proper site to construction it and determine the priority of branch lines which can be considered in planning level, not project level. The model is a non-linear optimization program which minimize total cost-construction cost, operating cost and passengers' travel cost. The decision variables are a binary variable to explain whether construction or not and its direction and a integer variable of the frequencies of travel routes. The solution algorithm-problem solution and route choice and also the result of implementation for example network are suggested. This result can be more advanced after application in real network and calibration of parameters.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.113-120
• /
• 2010

Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.191-196
• /
• 2002

It is one of the important measures in the area of algorithm design that any interconnection network should be embedded into another interconnection network for the practical use of algorithm. A HCN(n, n), HFN(n, n) graph also has such a good properties of a hypercube and has a lower network cost than a hypercube. In this paper, we propose a method to embed between hypercube $Q_2n$ and HCN(n, n), HFN(n, n) graph. We show that hypercube $Q_2n$ can be embedded into an HCN(n, n) and KFN(n, n) with dilation 3, and average dilation is smaller than 2. Also, we has a result that the embedding cost, a HCN(n, n) and KFN(n, n) can be embedded into a hypercube, is O(n)

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.6
• /
• pp.1-9
• /
• 2000

This paper presents a Cluster Oriented Multistage Interconnection Network called COMR. COMR can be constructed suitable for the parallel application with localized communication by providing the shortcut path inside the processor-memory cluster which has frequent data communication. We evaluate the performance of COMR with respect to probability of acceptance, bandwidth, cost-effectiveness and average distance under varying degrees of localized communication. According to the result of analysis for performance evaluation, COMR shows higher performance than the regular MINs of the same network size in the highly localized communication. In the worst case, the diameter of an N$\times$N COMR is only n+1 which has only one stage more as compared the MIN with the same network size. Therefore COMR can be used as an attractive interconnection network for parallel applications with not only the localized communication distribution but also the uniform distribution in shared-memory multiprocessor system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.68-74
• /
• 2006

The MANET(Mobile Ad Hoc Network) is an independent network that is oranized by only Mobile Hosts. MANET guarantees the mobility of the node and does not need a backbone network or a base station. Recently, there is a strong demand to connect MANET to the Internet. For the interconnection between MANET and Internet, Mobile hosts of MANET must have global IP address. The well known scheme of the address configuration for MANET is SAA(Stateless Address Autoconfiguration). SAA configurated IP address by node itself. The advantage of SAA is not requiring any server for address configuration. However the SAA has problems of unstable and inefficient interconnection on the AD Hoc Network. To solve this problem we propose a method that assigns an IPv6 Global address to the node through the Internet Gateway. The format of assigned IPv6 address is also defined. The simulation result demonstrates that the proposed method can support the host for fast getting of global IPv6 Address and Mobile IPv6 efficiently.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1227-1237
• /
• 2008

In this paper, we analyze topological properties and embedding of Folded Hyper-Star network to further improve the network cost of Hypercube, a major interconnection network. Folded Hyper-Star network has a recursive expansion and maximal fault tolerance. The result of embedding is that Folded Hypercube $FQ_n$ and $n{\times}n$ Torus can be embedded into Folded Hyper-Star FHS(2n,n) with dilation 2. Also, we show Folded Hyper-Star FHS(2n,n) can be embedded into Folded Hypercube $FQ_{2n-1}$ with dilation 1.