• 제어로봇시스템학회논문지
• /
• 제6권11호
• /
• pp.943-954
• /
• 2000

Fieldbus is the lowest level industrial network in the communication hierarchy of factory automation and distributed process control systems. Data generated from field devices are largely divided into three categories : time-critical, periodic and time-available data. Because these data share one fieldbus medium, it needs a method that allocates these data to the bandwidth-limited fieldbus medium. This paper introduces an implementation method of bandwidth allocation scheme on PROFIBUS. In order to implement bandwidth allocation scheme on PROFIBUS, the following functions need to be supplemented on the FDL(Fieldbus Datalink Layer) protocol: (i) separation of medium bandwidth into periodic and non-periodic intervals, (ii) synchronization of node timers over a local link. In order to examine the validity of bandwidth allocation scheme on PROFIBUS, this paper develops an experimental model of a network system. The results obtained from the experimental model show that the bandwidth allocation scheme satisfies the performance requirement of time-critical, periodic and time-available data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4661-4676
• /
• 2014

In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intra-authentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

• Spatial Information Research
• /
• 제18권4호
• /
• pp.89-98
• /
• 2010

최근들어 대표적인 위치기반 서비스인 내비게이션은 기존 차량 중심의 서비스에서 보행자 중심의 서비스로 그 대상이 확대되고 있다. 이에 따라 최근에 보행자 내비게이션 관련하여 다양한 연구가 진행되고 있다 하지만, 내비게이션에서 가장 중요한 경로 서비스에 있어 대부분의 경우 차량 내비게이션에서 널리 활용되고 있는 노드/링크 네트워크 모델을 그대로 활용함으로써 한계점을 드러내고 있다. 그 이유로는 보행자는 차량과 달리 이동 공간이 도로로 한정되어 있지 않으며, 회전 규제, 방향 등에 제약을 받지 않고 보행이 가능한 공간에서 자유롭게 이동하는 등 보행 관련 특성들을 제대로 반영하지 못하기 때문이다. 특히, 공원, 광장 등의 오픈 페이스(open space)는 보행자기 많이 활용하는 공간임에도 불구하고 이에 대한 대안을 제공하지 못하고 있다. 따라서 본 연구에서는 게임 및 로보틱스 분야에서 객체의 이동을 계획하는 모션 플래닝(motion-planning) 기법을 응용하여 보행자 내비게이션 서비스에 적합한 경로 생성 기법을 제시하고, 그 활용 가능성을 테스트하였다.

• Kyungpook Mathematical Journal
• /
• 제56권4호
• /
• pp.1191-1205
• /
• 2016

The emergence of various Internet worms, including the stand-alone Code Red worm that caused a distributed denial of service (DDoS), has prompted many studies on their propagation speed to minimize potential damages. Many studies, however, assume the same probabilities for initially infected nodes to infect each node during their propagation, which do not reflect accurate Internet worm propagation modelling. Thus, this paper analyzes how Internet worm propagation speed varies according to the number of vulnerable hosts directly connected to infected hosts as well as the link costs between infected and vulnerable hosts. A mathematical model based on centrality theory is proposed to analyze and simulate the effects of degree centrality values and closeness centrality values representing the connectivity of nodes in a large-scale network environment on Internet worm propagation speed.

• 한국통신학회논문지
• /
• 제19권7호
• /
• pp.1335-1345
• /
• 1994

대용량 교환시스템인 TDX-10의 내부통신망의 성능을 분석하였다. 내부통신망의 시뮬레이션은 SLAM II의 이산사건모델을 이용하여 개발하였다. 시뮬레이션의 결과로 각 노드에서의 최대버퍼길이와 평균대기시간 그리고 D버스의 이용율을 구하였다. 또한 링크속도를 고려한 내부통신망의 최대호처리용량을 구하였다.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.

• 한국통신학회논문지
• /
• 제33권2B호
• /
• pp.69-75
• /
• 2008

We propose new routing scheme, Cooperative Diversity-based Routing (CDR)which utilize the cooperative space diversity for power saving and for performance enhancement of wireless ad-hoc networks. The end-to-end performance of the proposed routing, CDR, is analyzed based on the Haenggi's link model. The improved performance is compared with Multi-hop Relay Routing (MRR) by analytical methods. When the required outage probability is $1{\times}10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 21.5 dB in average, by using our proposed CDR compared to MRR.

• 한국시뮬레이션학회논문지
• /
• 제3권1호
• /
• pp.115-124
• /
• 1994

In this paper, we have developed a performance analysis tool for communication networks called COMNAS. COMNAS analyses the performance of wide area networks such as Korea Educational Network and Korea Research Environment Open Network which include local area networks such as Ethernet and Token Ring. COMNAS consists of model constructor, simulation implementor, output analyzer and user interface. Attributes of communication networks for modeling either have default values or are entered by user as object units, and implementation of simulation is automatically proceeded by user interface. Ouput results obtained by COMNAS are the status of node, link and entire network such as mean message transmission delay, throughput, utilization, and so on, and they can be selectively obtained upon the request of the user.

• 한국인터넷방송통신학회논문지
• /
• 제12권6호
• /
• pp.257-264
• /
• 2012

본 논문에서는 링크 안정성 기반 방향성 안내 라우팅 프로토콜(RSDGR)을 제안한다. 본 논문에서 제안한 알고리즘의 주요한 특징 및 기여도는 다음과 같다. 첫째, 노드들의 이동성 정보를 이용하여 두 노드 간 링크 안정성과 멀티 홉 간의 루트 안정성을 정량적으로 계산하고, 소스노드와 목적지 노드 사이에서 가장 안정된 경로를 설정한다. 둘째, 소스노드와 목적지 노드 사이의 경로 안정성에 따라서 경로형성을 위한 방향성 안내 영역을 동적으로 설정하여 최적화한다. 셋째, 두 노드 간 링크 안정성과 멀티 홉 간의 경로 안정성을 정량적으로 계산하기 위한 이론적인 모델을 제시한다. 제안된 라우팅 프로토콜의 성능평가는 OPNET(Optimized Network Engineering Tool)을 이용한 시뮬레이션과 이론적인 분석을 통하여 이루어졌다. 성능평가 결과 경로 안정성에 따른 PDR은 시뮬레이션과 이론적인 분석에서 서로 비슷한 양상을 보였다. 또한 모바일 노드들의 이동속도가 빠를수록, 소스노드의 방향성 안내 영역의 크기는 작을수록 경로 안정성과 그에 따른 PDR은 감소하는 반면 Delay와 Control 오버헤드는 증가함을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3701-3727
• /
• 2016

Recently Service Function Chaining (SFC) is promising to innovate the network service mode in modern networks. However, a feasible implementation of SFC is still difficult due to the need to achieve functional equivalence with traditional modes without sacrificing performance or increasing network complexity. In this paper, we present a configurable network service chaining (CNSC) mechanism to provide services for network traffics in a flexible and optimal way. Firstly, we formulate the problem of network service chaining and design an effective service chain construction framework based on integrating software-defined networking (SDN) with network functions virtualization (NFV). Then, we model the service path computation problem as an integer liner optimization problem and propose an algorithm named SPCM to cooperatively combine service function instances with a network utility maximum policy. In the procedure of SPCM, we achieve the service node mapping by defining a service capacity matrix for substrate nodes, and work out the optimal link mapping policies with segment routing. Finally, the simulation results indicate that the average request acceptance ratio and resources utilization ratio can reach above 85% and 75% by our SPCM algorithm, respectively. Upon the prototype system, it is demonstrated that CNSC outperforms other approaches and can provide flexible and scalable network services.