• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.835-843
• /
• 2006

Multicast can send one copy of each packet to each member of the multicast group. Network resource is utilized effectively, consequently, it is suitable for one-to-many environments. reliability and flow control, however, are not supported basically, it is not suitable or transmission of multimedia data which have a time restriction. In this paper, we present a network model and a multicast retransmission scheme The proposed scheme remove ack-explosion from sender through local recovery and performs local retransmission when time restriction is satisfied on receiver by considering the state of receiver's buffer. Mathematical analysis and simulation are conducted to prove performance of the proposed scheme. The results are shown that the proposed scheme consumes a lower network bandwidth than the existing network model and guarantees QoS of receivers.

• Industrial Engineering and Management Systems
• /
• v.13 no.4
• /
• pp.383-397
• /
• 2014

Reverse logistics network design issues have been popularly discussed in recent years. However, few papers in the past literature have been dedicated to incentive effect on return quantity of used products. The purpose of this study is to formulate a dynamic nonlinear programming model of reverse logistics network design with the aim of managing the used products allocation by coordinating the collection centers and recovery facilities to warrant economic efficiency. In the optimization model, a fuzzy approach is applied to interpret the relationship between the rate of return and the suggested incentives. Due to funding constraints in setting up the collection centers, this work considers these centers as multi-capacity levels, which can be opened or closed at different periods. In view of the fact that the problem is known as NP-hard, we propose a heuristic method based on tabu search procedure to solve the presented model. Finally, several dominance properties of optimal solutions are demonstrated in comparison with the results of a state-of-the-art commercial solver.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1259-1264
• /
• 1990

During the past two decades, a lot of researches have been done on the synthesis of grassroot heat exchanger networks(HEN). However, few have been dedicated to retrofit of existing heat exchanger networks, which usually use more amount of utilities (i.e. steam and/or cooling water) than the minimum requirements. This excess gives motivation of trades-off between energy saving and rearranging investment. In this paper, an algorithmic-evolutionary synthesis procedure for retrofitting heat exchanger networks is proposed. It consists of two stages. First, after the amount of maximum energy recovery(MER) is computed, a grass-root network featuring minimum number of units(MNU) is synthesized. In this stage, a systematic procedure of synthesizing MNU networks is presented. It is based upon the concept of pinch, from which networks are synthesized in a logical way by the heuristics verified by the pinch technology. In the second stage, since an initial feasible network is synthesized based on the pre-analysis result of MER and must-matches, an assignment problem between new and existing units is solved to minimize total required additional areas. After the existing units are assigned, the network can be improved by switching some units. For this purpose, an improvement problem is formulated and solved to utilize the areas of existing units as much as possible. An example is used to demonstrate the effectiveness of the proposed method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.239-243
• /
• 2011

In wireless ad-hoc network, the detection of link breakage and re-establishing the route path causes lots of network overhead and results in communication delay. In the LBN method, the node causing a link breakage actively sends a message to neighbors so that they can instantly start re-establishing process of new path. In this paper we describe the result of network simulation we performed using NS2 to show the effectiveness of LBN method.

• Industrial Engineering and Management Systems
• /
• v.12 no.2
• /
• pp.74-84
• /
• 2013

Modern companies have been facing devastating impacts from unexpected events such as demand uncertainties, natural disasters, and terrorist attacks due to the increasing global supply chain complexity. This paper proposes a multi stage logistic network model under disruption risk. To formulate the problem practically, we consider the effect of continuity rate, which is defined as a percentage of ability of the facility to provide backup allocation to customers in the abnormal situation and affect the investments and operational costs. Then we vary the fixed charge for opening facilities and the operational cost according to the continuity rate. The operational level of the company decreases below the normal condition when disruption occurs. The backup source after the disrup-tion is recovered not only as soon as possible, but also as much as possible. This is a concept of the business continuity plan to reduce the recovery time objective such a continuity rate will affect the investments and op-erational costs. Through numerical experiments, we have shown the proposed idea is capable of designing a resilient logistic network available for business continuity management/plan.

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

Mobile Ad hoc network에서 이동 노드들의 안정적이고 신뢰성이 높은 데이터 전송을 하기 위해서 multipath routing을 통하여 소스 목적지 노드간에 다중 경로를 구하고 기존의 라우팅 방법과 비교해 본다. 또한 다중 경로를 활용하는 방법과 경로구간의 링크 다운 시에 보다 빠른 복원을 할 수 있는 방법을 제시하고자 한다. 모바일 노드들의 이동성과 낮은 대역폭으로 인한 데이터 손실을 줄이는 방법으로 데이터 트래픽을 다중경로에 분산시키는 Traffic Load Balancing 방법과 데이터 전송 중에 발생하는 링크 다운 시에 새로운 경로를 찾는 메커니즘이 아닌 중간 경로에서 기존에 유효한 경로를 이용하는 Local recovery 방법을 소개하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.175-177
• /
• 2000

인터넷에서의 보안 사고가 급증하게 되면서 여러 가지 보안 도구들이 소개되고 있으나, 보안상 완벽한 효과를 기대하기 어렵고 침입에 의한 자료 손실이 발생하였을 경우를 위한 대책은 전무한 상태이다. 본 논문은 보안관리 통합시스템의 에이전트들 간에 주기적인 백업을 수행하게 함으로써 침입자의 부정행위에 의한 자료 손실을 신뢰적으로 복구할 수 있는 메커니즘을 제시한다.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.560-563
• /
• 2007

결함 내성은 신뢰도 있는 이동 컴퓨팅 환경을 구축하기 위한 중요한 요소 중 하나이며, 이동 컴퓨팅 환경을 위한 많은 결함 내성 기법들이 제안 되어졌다. 그러나 대부분의 제안된 기법들은 기지국의 지원과 같은 고정된 네트워크 구조를 기반으로 하는 이동 컴퓨팅 환경을 그 대상으로 한다. 이에 본 논문에서는 기존에 제안된 기법들을 고정된 네트워크 구조를 가지지 않는 이동 애드-혹 네트워크 환경에 적용 시킬 경우 발생 가능한 문제점들을 논의하고, 새로운 네트워크 환경인 애드-혹 네트워크 환경에 적합한 결함 내성 기법들에 관해 논의한다.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.389-405
• /
• 2001

In these days, we have increasing demands on the real-time services, especially for the multimedia data transmission in both of wired and wireless environments and thus efficient and stable ways of transmitting realtime data are needs. Although RTP is widely used for internet-based realtime applications, it cannot avoid packet losses, due to the use of UDP stack and its underlying layers. In the case of mobile computing applications, the packet losses are more frequent and consecutive because of the limited bandwidth. In this paper, we first statistically analyze the characteristics of packet losses in the wired and wireless communications, based on Gilbert model, and a new packet recovery scheme for realtime data transmission is presented. To reflect the transmission characteristics of the present network environment, our scheme makes the sender to dynamically adjust the amount of redundant information, using the current packet loss characteristic parameters reported by the receiver. Additionally, we use relatively large and discontinuous offset values, which enables us to recover from both of the random and consecutive packet losses. Due to these characteristics, our scheme is suitable for the mobile computing environment where packet loss rates are relatively high and varies rapidly in a wide range. Since our scheme is based on the analytic model form statistics, it can also be used for other network environments. We have implemented the scheme with Mobile IP and RTP/RTCP protocols to experimentally verify its efficiency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.421-428
• /
• 2006

In this paper, the way of remote installation and back-up of 3-tier structure is introduced for efficient utilizing the cluster system resources distributed at several places. Recently, cluster system is constructed as the system of over hundreds nodes under complex network system mixed with public networks and private networks. Therefore, the as installation method suitable for the large scale cluster system and the remote recovery of failure nodes are important. However the previous researches which are based on 2-tier architecture may not provide the efficient cluster installation and image back-up method when the network of cluster system is composed of several private networks and public networks. In this paper, RISE (Remote Installation Service and Environment) based on the 3-tier architecture is proposed to solve this problem. In our approach, the managing node's role is divided into the global master node (GRISE) and the local master node (LRISE) to provide the efficient initial system deployment and remote failure recovery of distributed cluster system under the various network systems. Also, LRISE's availability is ensured under the complex network environments by adopting the auto-synchronization mechanism between GRISE and LRISE. In this work, a 64-node cluster system with gigabit network system is utilized for the experiment. From the experimental result, the system image with 1.86GB data can be obtained in 5 minutes and 53 seconds and the image-based installation of 64-node system can be carried out in 17 minutes and 53 seconds.