• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2414-2428
• /
• 2018

In order to solve the problem that the current network security situation assessment methods just focus on the attack behaviors, this paper proposes a kind of network security situation assessment method based on Markov Decision Process and Game theory. The method takes the Markov Game model as the core, and uses the 4 levels data fusion to realize the evaluation of the network security situation. In this process, the Nash equilibrium point of the game is used to determine the impact on the network security. Experiments show that the results of this method are basically consistent with the expert evaluation data. As the method takes full account of the interaction between the attackers and defenders, it is closer to reality, and can accurately assess network security situation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1529-1532
• /
• 2004

A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.485-500
• /
• 2018

As the size of the system and network environment grows and the network structure and the system configuration change frequently, network administrators have difficulty managing the status manually and identifying real-time changes. In this paper, we suggest a system that scans dynamic network information in real time, scores vulnerability of network devices, generates all potential attack paths, and visualizes them using attack graph. We implemented the proposed algorithm based attack graph; and we demonstrated that it can be applicable in MTD concept based defense system by simulating on dynamic virtual network environment with SDN.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.2
• /
• pp.169-186
• /
• 2008

Social Network has been known as friendship basis human relation service in online network. But a broad sense of Social Network can be explained as a mechanism which makes web evolve to information-ecosystem by human relation and network data which has been generated by the mass of people's cooperation and interchange. Social Network has been expanding their domain from friendship basis relation service to broad social relationship focus of matter of concern. It has been applied to diverse domain. Library community begins to take an interest in Social Network concept to apply user's interchange for information. This paper considers the concept of Social network and it's appliance to a library service. For the more, suggest basic element for vitalizing library user's Social network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1241-1244
• /
• 2003

Diffserv Network의 혼잡 상태에서도 최소 전송속도를 보장하는 AF(Assured Forwarding)은 AF1부터 AF4에 이르기까지 다양한 Class 형태로 존재한다. Core Router나 Edge Router에서 패킷을 Drop 해야 한다면, 처음으로 DE(Default Forwarding) 방식의 패킷이 Drop되고, 피 다음으로 AE4, AF3, AF2, AF1의 등급을 가진 패킷들이 Drop 된다. 이러한 AF 패킷의 전송에서 A Network는 AF1, AE2, AF3, AF4의 순서로 패킷의 우선 순위를 두고, B Network는 그 반대인 AF4, AF3, AF2, AF1의 순서로 패킷의 우선 순위를 둔다면, A Network에서 최고의 품질을 제공받는 AF1 패킷이 B Network로 넘어가면서 가장 낮은 우선 순위의 서비스 품질을 제공받게 되어, B Network에서 패킷 드롭의 상황이 발생하게 되어 가장 먼저 드롭이 일어나게 된다. 이러한 결과는 반대로 B Network에서 A Network로 패킷을 보내는 과정에서도 발생한다. 본 논문은 이러한 AF Class의 패킷을 다른 정책을 가지는 네트워크로 전송할 때 AF 패킷 등급의 손실을 최소화하는 방안을 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2783-2804
• /
• 2021

In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2711-2733
• /
• 2018

Minimizing power consumption in bandwidth limited optical traffic grooming networks is presented as a two-objective optimization problem. Since the main objective is to route a connection, the network throughput is maximized first, and then the minimum power consumption solution is found for this maximized throughput. Both transparent IP over WDM (Tp-IPoWDM) and translucent IP over WDM (Tl-IPoWDM) network may be applied to examine such bi-objective algorithms. Simulations show that the bi-objective algorithms are more energy-efficient than the single objective algorithms where only the throughput is optimized. For a Tp-IPoWDM network, both link based ILP (LB-ILP) and path based ILP (PB-ILP) methods are formulated and solved. Simulation results show that PB-ILP can save more power than LB-ILP because PB-ILP has more path selections when lightpath lengths are limited. For a Tl-IPoWDM network, only PB-ILP is formulated and we show that the Tl-IPoWDM network consumes less energy than the Tp-IPoWDM network, especially under a sparse network topology. For both kinds of networks, it is shown that network energy efficiency can be improved by over-provisioning wavelengths, which gives the network more path choices.

• Management & Information Systems Review
• /
• v.2
• /
• pp.335-354
• /
• 1998

In this study I construct CAN(Controller Area Network) for automobiles similar to LAN(Local Area Network) and build communication modules in the major part of an automobile to link several sub-systems. Since each station replaces the communication function of sub-systems and has various types of sensor, actuator, controller, and switch, every information about automobile's status is obtained from the network. The manufactured system showed a superior capability. The following is the contents of study. 1. The definition of communication packet through the analysis of CAN protocol. 2. The Design of modules using micro-controller 80C196CA. 3. The Network configuration.

• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.69-81
• /
• 2013

Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identification algorithm and also present numerical results that compare the critical points of the network and H-hop sub-network illustrating how effectively sub-network information can detect the network-wide critical points. Then, we propose two localized topological control resilient schemes that can be applied to both global and local H-hop sub-network critical points to improve the network connectivity and the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions show that our proposed resilient schemes increase the probability of the network being connected in variety of link and node failure conditions.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.67-70
• /
• 2006

A distributed healthcare monitoring system prototype for clinical and trauma patients was developed, using wireless sensor network node. The proposed system aimed to measure various vital physiological health parameters like ECG and body temperature of patients and elderly persons, and transfer his/her health status wirelessly in Ad-hoc network to remote base station which was connected to doctor's PDA/PC or to a hospital's main Server using wireless sensor node. The system also aims to save the cost of healthcare facility for patients and the operating power of the system because sensor network is deployed widely and the distance from sensor to base station was shorter than in general centralized system. The wireless data communication will follow IEEE 802.15.4 frequency communication with ad-hoc routing thus enabling every motes attached to patients, to form a wireless data network to send data to base-station, providing mobility and convenience to the users in home environment.