• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.629-636
• /
• 2001

Network is changed from voice-based network into multimedia-based network by development of communication technology and multimedia service. We need a large bandwidth for multimedia service. The optical fiber is a more suitable medium than existing copper-based cable for large bandwidth. But, it is so expensive than copper-based cable. So, Minimizing total cost becomes a more important concept. In order to construct a minimum cost network, we have to consider existing conduits in network. On the other hand, optical fiber network allows that larger amount of traffic can be transmitted than copper-based network does. However, a failure of a node or link can make a serious damage to the network service. Thus, we have to get multiple paths to support continuous service even if a loss of failure occurs in some point of the network. The network survivability problem is to design the network that can provide reliable service to customers anytime with minimum total cost. In an existing solution of the network survivability problem with conduits, a conduit is considered only one time. But, the conduit is reusable if the network satisfies the required survivability. Proposed algorithm can more effectively considered already existed conduit. Network survivability and edge cost is predetermined. The proposed algorithm finds the best solution by conduit sharing within the limits of network survivability. According to the simulation result, the proposed method can decrease 7% of total cost than an existing method by effective conduits adaption.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.117-123
• /
• 2009

There are two types of survivability. We find the characteristics of them for networks. And using the dual homing, we analysis the routing cost and link cost. Also we propose the cost-efficient heuristic design method of network topology in order to use survivability. By design samples, we analysis the cost efficiency and show that the new design method can be used to design network topology for survivability easily.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.361-367
• /
• 2003

Ad-hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the aid of any establish infrastructure and this network can provide an extremely flexible method for establishing communications for fire, safety, rescue operations, battle field or other fields requiring rapidly deployable communications with survivable, efficient dynamic networking. Recently new expended mechanism is proposed as Ad-hoc relay system, so guarantee of QoS for multimedia applications is needed more and more. In this paper, we propose ARM based QoS Distribution Monitoring Mechanism to provide Quality of Service guarantees to multimedia application with MANET.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.88-93
• /
• 2009

It is important for communication networks to possess the capability to overcome failures and provide survivable services. We address modeling and analysis of performability affected by both performance and availability of system components for a token ring network under failure and repair conditions. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, hierarchical SRN modeling techniques are used to overcome state largeness problem. The upper level model is used to compute availability and the lower level model captures the performance. And Normalized Throughput Loss (NTL) is obtained for the composite ring network for each node failures occurrence as a performability measure. One of the key contributions of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performability analysis for a token ring network under SRN reward concepts.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.493-496
• /
• 2000

We study the problem of designing at minimum cost a two-connected network topology such that the shortest cycle to which each edge belongs does not exceed a given maximum number of hops. This problem is considered as part of network planning and arises in the design of backbone networks. We propose a genetic algorithm approach that uses a solution representation, in which the connectivity and ring constraints can be easily encoded. We also propose a crossover operator that ensures a generated solution is feasible. By doing so, the checking of constraints is avoided and no repair mechanism is required. We carry out experimental evaluations to investigate the solution representation issues and GA operators for the network design problem.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.3
• /
• pp.132-139
• /
• 2002

The implementation of passive optical network in the access network will result in design of the network that have characteristics of broadband, long distance transmission, transparency. Particularly, optical technologies of WDM and WGR have made a new access network of WDM-PON. This paper proposes the algorithm that determines structural elements of a survivable optical access network, and simulates the cost of various scheme of proposed network architectures. Our results show that multistage star is the most cost effective scheme than the other architectures and show that network architecture designed by proposed algorithm provides survivability with single link and 1st node failure.

• Convergence Security Journal
• /
• v.3 no.3
• /
• pp.25-33
• /
• 2003

With the radical improvement of wire and wireless communication technologies, home network which interconnects various home appliances is approaching ripening stage. Digitalization of the home environment will break down the boundaries of information, communications and broadcasting, and enable us to realize many breakthroughs on the home front and connect to our home. In order to enable users to access securely to their home network, we first construct secure home network model which can authorize users using their permission policy. In this paper, we examine various security technique used in home network and propose home network security scheme which can service constantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1807-1814
• /
• 1999

This paper considers connectivity-related reliability measures for a class of fault-tolerant shuffle exchange networks to characterize the degrading features over time in the presence of faulty switching elements. The mean number of connected input/output pairs, the mean number of survivable input are considered as connectivity measures. The measures for the unique-path shuffle exchange network(SEN) and its two fault-tolerant variants, extra-stage SEN(SEN+) and INDRA network are derived analytically, and then are compared with numerical experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1442-1445
• /
• 2010

오늘날 통신기술의 급속한 발달에 따라 자동화 및 무인화 서비스를 제공하는 지능형 선박에 대한 연구, 개발이 활발이 진행 되고 있다. 이에 선박 내 각 장비들의 기능이 고도화 됨으로써, 선박네트워크 환경에서 이들 장비를 효율적으로 제어할 수 있는 연구가 필요한 실정이다. 지능형 선박의 백본 네트워크는 네트워크 구축 환경의 제약과 자동화 및 무인화 특징을 가진다는 점에서, 선박의 사고로 인한 네트워크의 결손이 큰 재해를 가져올 수 있으므로 고수준의 생존성이 요구된다. 따라서 본 논문에서는 고생존 선박 통신망을 고려하여 네트워크 통신 장비들이 이중화 경로를 통해 서로 연결된 이중화 네트워크 토폴로지를 최소의 비용으로 설계하였다. 설계한 이중화 네트워크 토폴로지를 이론적 분석 및 ILP(Integer Linear Programming)를 통해 실험한 결과, 네트워크 생존성에 우수한 성능을 나타내는 것을 확인할 수 있었다.