• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1416-1427
• /
• 2012

This paper proposes a design technique of a survivable ship backbone network, which describes a near optimal configuration scheme of physical and logical topologies of which the survivable ship backbone network consists. We first analyze and present an efficient architecture of a survivable ship backbone network consisting of redundant links and ship devices with dual communication interfaces. Then, we present an integer linear programming-based configuration scheme of a physical topology with regard to the proposed ship backbone network architecture. Finally, we present a metaheuristic-based configuration scheme of a logical topology, underlying the physical topology.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.809-816
• /
• 2005

MANET(mobile ad hoc network) cn be one of the access networks of BcN(broadband convergence network), and an user node requires address auto-configuration protocol for mu14i-hop environment. Some address auto-configuration protocols are proposed for independent MANET, but they don't consider BcN-accessable MANET environment. In this paper, new address auto-configuration protocol for wireless nodes is proposed. With this proposal, they ran configure their global addresses automatically in hybrid MANETs as BcN access networks. The autoconfiguration protocol modifies IPv6 NDP(neighbor discovery protocol) messages to deliver global prefix information to all wireless nodes, and avoids message boradcasting to minimize network overhead.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.1-6
• /
• 2010

Simulation analysis may be the essential means to either evaluate performance of systems or optimize system parameters for new design. Including many variations for design and implementation, MANET (Mobile Ad-hoc NETwork) is one target area of such an analysis. Since every node, however, included in the network has mobility, one MANET could be overlapped or merged with another one which use a different transport protocol. In order to communicate among nodes in this case, the new merged network should configure paths and addresses in advance. Configuring paths and addresses generates much overheads which ultimately cause delay in communicating data. Performance analysis is required to improve the data transport performance by minimizing overheads. This paper proposes a sound address auto-configuration method which is based on an on-demand manner and then presents modeling and performance analysis of the method. NS-2 simulation results verify that the proposed method can not only alleviate overheads, which are inevitably generated for address auto-configuration processes, and but also decentralize them in time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1545-1549
• /
• 2005

According as computer is supplied in a lot of homes and offices and Internet use increases, various service based on the Internet. Including wireless PDA in the future, many devices such as Internet telephone, TV, refrigerator and oven will be connected on the Internet and Internet address exhaustion will be raised to serious problem gradually. Today, the IPv4 address exhaustion problem has been solved partially using NAT (Network Address Translation) however, the transition to next Generation Internet will be accelerated because of advantages such as mobility, security service, QoS, and abundant IP addresses. In IPv6, all hosts are designed to create and set their address automatically without manager's intervention using Neighbor Discovery Protocol. But, when an IPv6 host sets its address automatically, there are serious security vulnerabilities. In this paper, we analysis security vulnerabilities in auto-configuration and provide security requirements for secure auto-configuration.

• Journal of the Korean Society for Railway
• /
• v.9 no.3 s.34
• /
• pp.313-318
• /
• 2006

In this paper, we propose an efficient Care of Address (CoA) configuration scheme for network mobility support in the railroad environment. Mobile routers in a train visit each access router in the fixed order. Such regular movement characteristic of a train enables a current subnet access router to inform the next subnet access router of the mobile routers' interface identifiers before the mobile routers move to the next subnet access router. So, the next subnet access router can make care of addresses for the mobile routers in advance. The numerical results show that the proposed scheme outperforms the stateless scheme with respect to CoA configuration time.

• Journal of Information Technology Applications and Management
• /
• v.14 no.2
• /
• pp.11-26
• /
• 2007

In this paper we suggest a context-driven configuration model of virtual businesses to form a business network model consisting of role-based, interaction-centered business partners. The model makes use of the subcontext concept which explicitly represents actors and interactions in virtual business (VB) context. We separate actors who have capacities on tasks in a specific kind of role and actor subcontext which models requirements in specific interaction subcontext. Three kinds of actors are defined in virtual service chains, service user, service provider, and external service supporter. Interaction subcontext models a service exchange process between two actor subcontexts with consideration of context dependencies like task and quality dependencies. Each subcontext may be modeled in the form of a situation network which consists of a finite set of situation nodes and transitions. A specific situation is given in a corresponding context network of actors and interactions. It is illustrated with a simple example.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.472-482
• /
• 2013

This paper proposes a wireless LAN topology configuration method for enhancing indoor location-awareness and improving network performance simultaneously. We first develop four objective functions that yield objective goals significant to the optimal design of a wireless LAN topology in terms of location-awareness accuracy and network performance factors. Then, we develop metaheuristic algorithms such as simulated annealing, tabu search, and genetic algorithm that examine the proposed objective functions and generate a near-optimal solution for a given objective function. Finally, four objective functions and metaheuristic algorithms developed in this paper are exploited to evaluate and measure the performance of the proposed wireless LAN topology configuration method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.407-410
• /
• 1998

Configuration is a set of building block processes, a series of selection and combining parts or components which composes a whole thing. A whole thing could be such a configurable object as manufacturing product, network system, financial portfolio, system development plan, project team, etc. Configuration problem could happen during any phase of product life cycle: design, production, sales, installation, and maintenance. Configuration has long been one of cost and time consuming work, because only high salaried technical experts on product and components can do configuration. Rework for error adjustments of configurations at later process causes far much cost and time, so accurate configuration is required. Under the on-line electronic commerce environment, configuration problem solving becomes more important, because component-based sales should be done automatically on the merchant web site. Automated product search, order placement, order fulfillment and payment make that manual configuration is no longer feasible. Automated configuration means that all the constraints among components should be checked and confirmed by configuration engine automatically. In addition, technical constraints and customer preferences like price range and a specific function required should be considered. This paper gives an brief overview of configuration problems: characteristics, representation paradigms, and solving algorithms and introduce CRSP(Constraint and Rule Satisfaction Problem) method. CRSP method adopts both constraint and rule for configuration domain knowledge representation. A survey and analysis on web sites adopting configuration functions are provided. Future directions of configuration for EC is discussed in the three aspects: methodology itself, companies adopting configuration function, and electronic commerce industry.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.59-65
• /
• 2015

To build a flexible network than traditional transport network, the carrier ethernet technology is emerging in network industry recently and MPLS-TP technologies are being applied as a major standard technology for the carrier ethernet. However, network management technologies required to handle equipment installed in MPLS-TP network are not clear. This paper propose an efficient method to build a management network automatically without any additional configuration when network equipments are installed in MPLS-TP network. The proposed scheme reduce cost required for both equipment installation and network maintenance by minimizing configuration procedures of connecting management system with network. We evaluated the effectiveness of the proposed scheme by applying the scheme to a real MPLS-TP equipment.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.100-109
• /
• 2005

A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.