• 한국군사과학기술학회지
• /
• 제13권2호
• /
• pp.218-226
• /
• 2010

The tactical data-link is useful to exchanging automatic information and controling command in combat environment. This is a essential factor of interoperability in the future combat situation of network centric warfare. In a aspect of a weapon system development, Modeling & Simulation can save expense. HLA RTI is a standard communication protocol in M&S. So, we suggest that Link Simulator connect tactical data-link through RTI. This simulator has the interoperability between M&S and tactical data-link, the reusability through adabing M&S framework, and the wide usability by automatic engagement function.

• Journal of Information Processing Systems
• /
• 제13권4호
• /
• pp.914-927
• /
• 2017

Weighted network link prediction is a challenge issue in complex network analysis. Unsupervised methods based on local structure are widely used to handle the predictive task. However, the results are still far from satisfied as major literatures neglect two important points: common neighbors produce different influence on potential links; weighted values associated with links in local structure are also different. In this paper, we adapt an effective link prediction model-local naive Bayes model into a weighted scenario to address this issue. Correspondingly, we propose a weighted local naive Bayes (WLNB) probabilistic link prediction framework. The main contribution here is that a weighted cluster coefficient has been incorporated, allowing our model to inference the weighted contribution in the predicting stage. In addition, WLNB can extensively be applied to several classic similarity metrics. We evaluate WLNB on different kinds of real-world weighted datasets. Experimental results show that our proposed approach performs better (by AUC and Prec) than several alternative methods for link prediction in weighted complex networks.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• 제어로봇시스템학회논문지
• /
• 제2권3호
• /
• pp.209-219
• /
• 1996

Fieldbus provides a real-time data communication among field devices in the process control and manufacturing automation systems. In this paper, a Petri Net model of the 1993 draft of IEC/ISA fieldbus which is proposed as an international standard of fieldbus network is developed. Based on the Petri Net model, discrete-event simulation model of IEC/ISA fieldbus network is developed. This paper evaluates the network induced delay in the data link layer of IEC/ISA fieldbus using the simulation model. In addition, an integrated discrete-event/continuous-time simulation model of fieldbus system and distributed control system is developed. This paper investigates the real-time data processing capability of IEC/ISA fieldbus and the effect of network-induced delay to the performance of control system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2801-2816
• /
• 2016

Owing to their low scalability, weak support on big data, insufficient data collaborative analysis and inadequate situational awareness, the traditional methods fail to meet the needs of the security data analysis. This paper proposes visualization methods to fuse the multi-source security data and grasp the network situation. Firstly, data sources are classified at their collection positions, with the objects of security data taken from three different layers. Secondly, the Heatmap is adopted to show host status; the Treemap is used to visualize Netflow logs; and the radial Node-link diagram is employed to express IPS logs. Finally, the Labeled Treemap is invented to make a fusion at data-level and the Time-series features are extracted to fuse data at feature-level. The comparative analyses with the prize-winning works prove this method enjoying substantial advantages for network analysts to facilitate data feature fusion, better understand network security situation with a unified, convenient and accurate mode.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.96-96
• /
• 2000

Today, Internet is an everyone's tool for information searching and communication. Furthermore, with the wireless Internet, we can get connected while moving. The Internet, especially wireless Internet could be an excellent data Link for DGPS because of its interactive two-way communication capability and well-constructed network infra. The user with his own mobile communication device doesn't necessarily get equipped with the other specific data link for DGPS This paper will show that how the Internet based DGPS system could be constructed on the computer network in real time, Its performance is demonstrated by the field experiments. Comparing to the DGPS system with the conventional data Links, Like beacon and FM DARC, the Internet based DGPS could provide us a convenient and cost effect DGPS system.

• Journal of Information Technology Applications and Management
• /
• 제23권2호
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• 한국군사과학기술학회지
• /
• 제13권3호
• /
• pp.397-404
• /
• 2010

Recently, there is on-going research about tactical data link system based on the legacy radio. Tactical data link based on legacy radio is operated mostly in narrow bandwidth under 25khz. Communicating traffics in nodes participated at network need to be minimized for distributing tactical data in narrow bandwidth. In addition, the data distributing structure is necessary for distributing tactical informations such as a situation awareness and so on to war fighters. However, conventional server-client system wastes a lot of time to obtain information for war fighters as user uses pull system to gather necessary information by seeking it one by one. Especially, the fighter pilot is supposed to dedicate into a situation awareness and fight mission in every seconds but seeking information of a user terminal while aircraft maneuvering affects as obstacle to concentrate engaging hostiles. therefore, push technology, the tactical data distributing system, is necessary for war fighters to receive fixed tactical data automatically without putting attention to it. This paper propose the UMPC tactical data link push framework. the UMPC tactical data link is a tactical data link system based on the legacy radio. Proposed push framework is verified by composing experiment environment and testing.

• 전자공학회논문지S
• /
• 제35S권10호
• /
• pp.42-51
• /
• 1998

본 논문은 CL (ConnectionLess) 가입자와 CL 서버간, CL 서버간, 그리고 종단간 CL가입자간 궤한 루프와 CL서버의 헤더 변환 테이블을 이용하여CL 중첩망의 폭주 제어 방안을 제안한다. ITU-T(International Telecommunication Union-Telecommunication)에 의하여 정의된 CBDS(Connectionless Broadhand Data Service)을 위한 CL 중첩망은 프레임을 라우팅해 주는 CL 서버와 CL 가입자와 CL서버 또는 CL 서버를 연결해주는 링크들로 구성된다. 이와 같은 CL 중첩망에서, 두 종류의 폭주, 즉. CL 링크 폭주와 CL 서버폭주가 일어날 수 있다. 본 논문에서 두 종류의 폭주를 해결할 수 있는 방안을 제시한다. 링크-바이-링크 방법[18]은 CL가입자와 CL서버간 또는 CL 서버간 ATM 계층의 ABR(Available Bit Rate) 궤환 루프와 CL 서버의 헤더 변환 테이블을 이용한다. 그러나 이 방법은 출력 가상 채널의 폭주 발생시 링크를 통해 전송되는 모든 트래픽에 영향을 주게 되어 폭주에 관여하지 않은 트래픽에게도 영향을 주어 이 트래픽이 출력되는 출력 가상 채널의 링크 이용도가 떨어지게 된다. 이와 같은 단점을 보완하기 위하여 본 논문에서 제한한 하이브리드 방법은 링크-바이-링크 방법의 ABR 궤환 루프, CL 계층의 종단의 CL 가입자간 궤환 루프, 그리고 헤더 변환 테이블을 이용한 폭주 상태표를 이용한다. 이 방안은 링크-바이-링크 루프와 헤더 변환 테이블을 이용하여 폭주에 즉시 대처하고, 다음에 종단간 루프를 이용하여 실제 폭주에 관여한 CL 가입자의 전송속도를 조절하는 것이다.

• 정보처리학회논문지C
• /
• 제10C권7호
• /
• pp.923-928
• /
• 2003

본 논문은 그리드 네트워크의 패킷 지연시간단축을 위한 병목 링크 대역폭 측정 알고리즘을 제안하고자 한다. 병목 링크 대역폭 측정방법으로 packet pair 알고리즘과 Paced Probes가 있으나 이들은 pacer 패킷으로 cross traffic의 영향을 줄이면서 Paced probe 패킷들이 링크를 지날 때 발생하는 시간 차이를 이용하여 병목 링크 대역폭을 구한다. 그러나 경로상의 병목 링크 대역폭을 측정할 뿐이지 병목현상이 발생한 지점은 알 수 없는 문제점이 있다. 이를 hop-by-hop 측정에 기반한 병목 대역폭 측정을 제시하여 그리드 네트워크에서 전체적인 패킷 지연 개선을 이룰 수 있다. hop-by-hop의 병목 대역폭을 측정하기 위해 paced probe 패킷에 타임스탬프 옵션을 이용하며 병목현상 해소를 통하여 패킷 전송 지연의 단축을 시뮬레이션을 통해 알 수 있다. 본 논문에서 제시한 알고리즘으로 병목 링크의 대역폭과 위치를 파악하여 그리드 ETP나 실시간 QoS를 보장하는 데이터 전송에 기여할 것으로 기대된다.