• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.2
• /
• pp.86-94
• /
• 2014

Optical packet switching (OPS) is being considered as one of the switching technologies for a future optical internet. For contention resolution in an optical packet switching (OPS) system, the wavelength dimension is generally used in combination with a fiber delay line (FDL) buffer. In this article, we propose a method to reduce the number of tunable wavelength converters (TWCs) by sharing TWCs for a cost-effective design of an asynchronous OPS system with a shared or an output FDL buffer. Asynchronous and variable-length packets are considered in the OPS system design. To investigate the number of TWCs needed for the OPS system, an algorithm is proposed, which searches for an available TWC and an unused internal wavelength, as well as an outgoing channel. This algorithm is applied to an OPS system with a shared or an output FDL buffer. Also, the number of internal wavelengths (i.e., the conversion range of the TWC) needed for an asynchronous OPS system is presented for cost reduction of the OPS system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.289-291
• /
• 2003

IP멀티캐스트가 현재 보편적 서비스로 사용되지 못하는 한계로 인하여 그 대안으로 응용 계층 멀티캐스트 기법들이 제안되고 있다. 기존의 응용 계층 멀티캐스트의 성능 분석 기준으로 네트워크 자원의 효율적 사용면을 고려하여 스트레스, 스트레치와 전송 트리 관리 비용등이 사용되었다. 그러나, 응용 계층 멀티캐스트는 데이터의 전송이 참가자인 종단 시스템에 의해 이루어지고, 종단 시스템은 범용 장비로서 데이터 전달에 최적화된 성능을 갖지 못한다. 따라서, 데이터 전달을 위해 종단 시스템에서의 처리 지연이 발생하고 이로 인한 종단간 데이터 전송 지연에 영향을 끼치게 된다. 본 논문에서는 종단 시스템에서의 데이터 전달을 위한 전달 지연 시간을 모델링 하고, 대표적 다대다 응용 계층 멀티캐스트 기법인 End­system Multicast와 NICE에 대하여 종단 시스템에서 발생하는 처리 지연 시간이 전체 참가자간의 데이터 전송 지연 시간에 미치는 영향을 분석한 결과를 기술한다.

• The Optical Journal
• /
• s.119
• /
• pp.50-51
• /
• 2009

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.791-798
• /
• 2020

The share of advanced technology in modern weapon systems are gradually increasing, and life cycle of components are shortened due to the rapid speed of technological development. On the other hand, the weapon systems have a characteristic that takes a long time in the requirement stage of weapon to the operation and maintenance stage. Due to inevitably, obsolescence of the main components for parts occurs in the acquisition phase. The obsolescence parts could cause delays in mass production schedules, and further adversely affects operational availability due to poor supply of repair parts during in the maintenance phase. However, business managers are obliged to maximize the performance while minimizing the cost of the total life cycle of the design, production, and operation stages. It is necessary to establish and implement an appropriate components and parts of life cycle management plan. In this research, we analyzed the effectiveness of parts obsolescence management through cost avoidance and total life cycle cost that can be reduced through proper parts obsolescence management.

• Proceedings of the Safety Management and Science Conference
• /
• 2005.05a
• /
• pp.499-502
• /
• 2005

기업의 이익을 최대화하기 위해서는 고객의 만족이 최대화 되어져야 한다. 고객의 만족도를 알 수 있는 부분은 크게 고객의 비용(가격), 고객의 시간(납기), 고객의 요구사항(품질)으로 나눌 수 있다. 본 논문에서는 그 중 시간에 초점을 맞추어 비용으로 환산하여 기업의 입장에서 최소의 비용을 만족하는 최적의 발주량을 산출하여 보고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.694-696
• /
• 2004

무선 네트워크를 통해 인터넷에 접속하는 사용자들이 늘어나면서 이동 호스트들에게 무선 서비스를 제공하는 HA(home agent)나 FA(foreign agent)의 부하 또한 증가하고 있다. 특히 지역적 등록방법(regional registration)에서처럼 하나의 GFA(gateway foreien agent)가 도메인내의 모든 이동 호스트들을 담당할 경우 부하의 집중으로 인해 혼잡이나 지연 등의 문제가 발생하게 된다. 이러한 문제를 해결하기 위해 이 논문에서는 모든 FA들이 GFA의 기능을 가지는 분산된 네트워크 환경을 제안하고 이러한 환경에서 signaling 비용을 미리 계산하여 비용이 적은 쪽으로 위치등록을 수행함으로써 전체 signaling 비용을 줄이는 새로운 위치 관리 방법을 제안한다. 그리고 제안하는 방법이 효율적임을 증명하기 위해 signaling 비용 계산을 위한 비용함수를 제시하고 성능 평가를 통해 제안하는 방법이 유저의 이동 특성과 네트워크 환경에 따라 전체 signaling 비용을 줄이는 것을 보여준다.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.121-128
• /
• 2006

In Mobile IPv6, a handover latency is an important issue. To reduce the handover latency, mipshop working group in IETF has studied the fast handover(FMIPv6) which creates and verifies a new care-of address(NCoA) in advance before a layer 2 handover resulting in reduced handover latency. Even in FMIPv6, the NCoA must be registered in a home agent(HA). This registration still creates a significant amount of delay. To reduce registration latency, we propose a tentative and early binding update(TEBU) scheme that the NCoA is registered in the HA in advance during the layer 2 handover based on FMIPv6. We use cost analysis for the performance evaluation. As a result, we found that the TEBU scheme guarantees lower handover latency than FMIPv6 as much as approximately 21%.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2005.11a
• /
• pp.25-31
• /
• 2005

The decommissioning cost estimation is the very essential procedure to establish the decommissioning plans for Nuclear Research Facilities. The cost estimation must be made in accordance with activity phase and facility installations. This paper shows how to configuring the cost items and identifying the effecting cost factors. In the end, these methods will be utilized as a tool and technique to develop the methodology of cost estimation and calculation program.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.70-77
• /
• 2012

Dial-a-ride is the most widely available transit service for disabled persons or seniors in the United States and Europe. This paper studies a static dial-a-ride problem considering multiple depots, heterogeneous vehicles, and soft time windows. In this paper, we apply a heuristic based on clustering first-routing second(HCR) to a real-world large dial-a-ride problem from Maryland Transit Administration(MTA). MTA's real operation is compared with the results of developed heuristic for 24 cases. The objective function of the proposed model is to minimize the total cost composed of the service provider's cost and the customers' inconvenience cost. For the comparison, the objective function values of HCR do not include waiting cost, delay cost, and excess ride cost. The objective function values from HCR are better than those from MTA's operation for all cases. This result shows that our heuristic method can make the real operation better and more efficient.