• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.265-275
• /
• 2002

A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.10
• /
• pp.1999-2007
• /
• 2007

This article describes advanced clover algorithm for effective loading and unloading of containers using stackers position data in a yard. The job scheduling must rely on job assign of stackers and position data processing to dynamically allocate stackers, and maintain multiple job processing, all based on task requirements. A stacker tracking using GPS and GIS is an essential capability and is used as yard loading and unloading process improvement for yard management. After estimating position of stackers in a yard the raper describes advanced clover algorithm and other techniques for monitoring loading and unloading of individual containers as well as combinatorial stacker load balancing problems such as estimating load of each stackers. Results from simulations and experimental implementations have demonstrated that the suggested approaches are efficient in stacker management.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.226-228
• /
• 1998

PBMA_DP 프로토콜은 우선순위에 따른 수락 확률을 변화시켜준다. 수락 확률수치는 요구슬롯(R-slot)의 개수에 영향을 받는다. 따라서 부하가 많아지면 R-slot의 개수를 줄이고, 부하가 적어지면R-slot의 개수를 늘려 성능의 향상을 꾀할 수 있다. 따라서 본 논문에서는 동적으로 R-slot의 개수를 바꾸어주는 알고리즘 두 가지를 제안한다. R-slot위치는 고정시키고 개수만 변화시키는 방식과 R-slot 위치를 변화시키면서 개수도 변화시키는 방식이다. 또한 단말의 개수를 예측하는 방법에 대해 간단히 설명한다. 위의 두 방식에 대한 모의 실험을 시행하여 성능분석을 행한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.4
• /
• pp.30-44
• /
• 2003

In the microcell-or picocell-based system the frequent movements of mobiles bring about excessive traffics into the networks. A mobile location estimation mechanism can facilitate both efficient resource allocation and better QoS provisioning through handoff optimization. Existing location estimation schemes consider only LOS model and have poor performance in presence of multi-path and shadowing. In this paper we study novel schemes which can increase estimation accuracy by considering NLOS environment and other multiple decision parameters than the received signal strength.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.607-609
• /
• 2001

셀룰러 기반의 이동 컴퓨팅환경에서는 이동 호스트(MH)의 위치와 상태관리를 위하여 디폴트 서버기법이 널리 사용되는데, 이동 호스트로 전송되는 데이터는 먼저 디폴트 서버에 문의하여 해당 삠 가 위치하는 로컬 서버로 전송된다. 디폴트 서버기법에 기반을 둔 SDN(single Default Notification)기법에서는 클라이언트가 MH 와의 연결요청을 하면 쿼리 서버를 통해 해당 디폴트 서버에 MH의 위치 및 상태를 문의한 후 통신이 이루어진다. 그러나 쿼리횟수가 많고 디폴트 서버와의 거리가 멀거나 기지국외 수가 많을 경우 디폴트 서버와의 통신 오버헤드가 커지며, 디폴트 서버에 결함이 발생할 경우 해당 MH 와의 연결이 불가능해진다. 디폴트 서버를 여러 개로 중복 시킬 경우 위와 같은 문제점을 경감시키고 디폴트 서버와의 통신 비용을 줄일 수 있다. 본 논문에서는 통신 환경에 따른 디폴트 서버의 최적의 중복 개수와 중복 위치를 구하는 방법을 제시하였고, 시뮬레이션을 통하여 수학적 방법이 유용함을 보였다.

• Review of KIISC
• /
• v.15 no.4
• /
• pp.61-71
• /
• 2005

현재 인터넷에서 사용되고 있는 IP주소는 호스트 위치와 신원을 동시에 식별할 수 있도록 설계되어 있다. 이러한 설계 패러다임은 호스트가 고정된 위치에서 하나의 IP주소를 갖는 기존의 인터넷 환경에 적응적이다. 하지만 차세대 인터넷에서는 호스트 이동성, 멀티호밍, 보안등이 중요한 핵심서비스로 부각되고 있다. 이러한 환경에서는 위치를 나타내는 IP주소가 동적으로 변경되고, 하나의 호스트에 두개 이상의 IP주소가 할당되고, 호스트 보안의 강화를 요구하는 새로운 환경이다. 따라서 현재의 IP주소가 호스트 위치와 신원을 동시에 나타내는 설계 패러다임으로는 새로운 차세대 인터넷 환경을 원활하게 지원할 수 없다. 본 논문에서는 차세대 인터넷 환경에서 부각되고 있는 호스트 이동성(Mobility), 멀티호밍(Multi-Homing), 보안등의 서비스를 원활하게 지원할 수 있는 하나의 새로운 기술로 HIP(Host Identity Protocol)을 소개하였다. HIP은 2004년 IETF hip WG가 결성되어 현재 표준화가 진행 중인 차세대 인터넷 기술이다. 기본 아이디어는 호스트 신원과 위치정보를 분리하여 차세대 인터넷 환경에 적응적인 프로토콜을 새롭게 재구성한 것이다.

• Journal of Navigation and Port Research
• /
• v.38 no.2
• /
• pp.155-162
• /
• 2014

In container terminals, stacking yard is the place where import and export containers are temporarily stored before being loaded onto or after being discharged from a ship. Since all the containers go through the stacking yard in their logistic flow, the productivity of the terminal critically depends on efficient operation of stacking yard, which again depends on how well the stacking locations of the incoming containers are determined. However, a good location for stacking an incoming container later can turn out to be a bad one when that container is to be fetched out of the stacking yard, especially if some rehandling is required. This means that good locations for the containers are changing over time. Therefore, in most container terminals, the so-called remarshaling is done to move the containers from bad location to good locations. Although there are many previous works on remarshaling, they all assume that the remarshaling can be done separately from the main jobs when the cranes are idle for rather a long period of time. However, in reality, cranes are hardly available for a period long enough for remarshaling. This paper proposes a crane dispatching strategy that allows remarshaling jobs to be mixed together with the main jobs whenever an opportunity is detected. Experimental results by simulation reveals that the proposed method effectively contributes to the improvement of terminal productivity.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.243-243
• /
• 2006

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2008

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose sized and call-site tracing-based shared memory allocator, shortly SCSTallocator. SCSTallocator places each data object requested from the different call-sites into the separate shared pages, and at the same time places each data object that has different size into different shared pages. Consequently data objects that have the different call-site and different object size prohibited from being allocated to the same shared page. Our observations show that our SCSTallocator outperforms the existing dynamic shared memory allocators. By combining the two existing allocation technique, we can reduce a considerable amount of false sharing misses.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.221-233
• /
• 2002

In this paper, we present integer programming models and algorithms for the Capacitated Facility Location-Allocation Problem (CFLP). The models and algorithms can be used for the design of logistics networks and for the location of telecommunication facilities. We are given a set of candidate facility installation sites, one type of facility for each candidate site with its capacity and installation cost, a set of customers with their demand requirement, and flow cost for one unit of demand flow from each customer to each candidate site. (CFLP) is to determine the number of facilities for each candidate site and the set of customers which are connected to each site with minimum cost, while satisfying the demand requirement of each customer and constraints imposed on the allocation of customers to facilities. We present two integer programming models for (CFLP), and devise a branch-and-cut algorithm and a branch-and-price algorithm for the problem.