• 한국경영과학회지
• /
• 제15권1호
• /
• pp.23-35
• /
• 1990

A mathematical model for a dynamic capacitate facility location problem is formulated by a mixed integer problem. The objective of the model is to minimize total discounted costs that include fixed charges and distributed costs. The Cross Decomposition method of Van Roy is extended and applied to solve the dynamic capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework. It successively solves a transportation problem and a dynamic uncapacitated facility location problem as two subproblems. Computational results are compared with those of general mixed integer programming.

• International Journal of Contents
• /
• 제14권1호
• /
• pp.28-33
• /
• 2018

In this paper, we design and implement a distributed, moving objects management system for processing locations and sensor data from smart black boxes. The proposed system is designed and implemented based on Apache Kafka, Apache Spark & Spark Streaming, Hbase, HDFS. Apache Kafka is used to collect the data from smart black boxes and queries from users. Received location data from smart black boxes and queries from users becomes input of Apache Spark Streaming. Apache Spark Streaming preprocesses the input data for indexing. Recent location data and indexes are stored in-memory managed by Apache Spark. Old data and indexes are flushed into HBase later. We perform experiments to show the throughput of the index manager. Finally, we describe the implementation detail in Scala function level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3771-3788
• /
• 2015

This paper studies the distributed energy efficient resource management in the Internet of Things (IoT). Wireless communication networks support the IoT without limitation of distance and location, which significantly impels its development. We study the communication channel and energy management in the wireless communication network supported IoT to improve the ability of connection, communication, share and collaboration, by using the game theory and distributed learning algorithm. First, we formulate an energy efficient neighbor collaborative game model and prove that the proposed game is an exact potential game. Second, we design a distributed energy efficient channel selection learning algorithm to obtain the global optimum in a distributed manner. We prove that the proposed algorithm will asymptotically converge to the global optimum with geometric speed. Finally, we make the simulations to verify the theoretic analysis and the performance of proposed algorithm.

• 한국경영과학회지
• /
• 제27권3호
• /
• pp.59-74
• /
• 2002

This study investigates two basic operations of mobility management of PCNs (Personal Communication Networks), i.e., the location update and the paging of the mobile terminal. From the realistic consideration that a user either moves through several cells consecutively or stays in a cell with long time, we model the mobility pattern by introducing two types of CRT (Cell Residence Time). Mobility patterns of the mobile terminal are classified Into various ways by using the ratios of two types of CRT. Cost analysis is performed for distance-based and movement-based location update schemes combined with blanket polling paging and selective paging scheme. It is demonstrated that in a certain condition of mobility pattern and call arrival pattern, 2-state CRT model produces different optimal threshold and so, is more effective than IID ( Independently-Identically-Distributed) CRT model. An analytical model for the new CRT model is compact and easily extendable to the other location update schemes.

• 대한안전경영과학회지
• /
• 제1권1호
• /
• pp.145-157
• /
• 1999

In this paper, a research on the structure and the network configuration of the location register(LR), which database of new locations and service informations of subscribers according to the movement of subscribers in personal communication system(PCS). since the traditional PCS manages all the databases with the location informations as a centralized type. The service informations of the subscribers are centrally controlled by the HLR. So there have been the heavy signal traffic and the call setup delay. In order to relieve such problem, the proposed types of the configurations are the distributed type of PCS scheme and the hierarchical PCS scheme. In the distributed scheme, each PCS has its own LR and in the hierarchical PCS scheme, several LR are grouped to from a layer so that overall structure is a tree style.

• 한국물환경학회지
• /
• 제24권2호
• /
• pp.180-184
• /
• 2008

A distributed hydrologic model of an urban drainage area on Bugok drainage area in Oncheon stream was developed and combined with a optimization method to determine the optimal location and number of best management practices (BMPs) for storm water runoff reduction. This model is based on the SCS-CN method and integrated with a distributed hydrologic network model of the drainage area using system of 4,211 hydrologic response units (HRUs). Optimal location is found by locating HRU combination that leads to a maximum reduction in peak flow at the drainage outlet in this model. The results of this study indicate the optimal locations and numbers of BMPs, however, for more exact application of this model, project cost and SCS-CN reduction rate of structural facilities such infiltration trench and pervious pavement will have to be considered.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권10호
• /
• pp.1217-1224
• /
• 1999

이동 호스트들의 위치 정보를 관리하는 것은 이동 컴퓨터 시스템에서 중요한 문제이다. 이동 호스트가 이동할 때 위치 수정과 위치 탐색간에는 상반관계가 존재한다. 본 논문에서는 위치 서버를 이용한 간단한 quorum 기반 분산 동적 위치 관리 방법을 제안한다. 이 방법에서는 이동 호스트들의 위치 정보가 모든 위치 레지스터가 아닌 위치 레지스터들의 부분집합에서 효율적으로 관리되기 때문에 위치 수정 비용과 위치 탐색 비용이 감소된다. 그리고 위치 레지스터들의 부분집합은 동적으로 변하고, 각 위치 서버의 부하는 이동 호스트에 대한 질의율을 고려하므로 균등해진다. 제안된 알고리즘의 성능은 위치 수정비용과 위치 탐색비용의 전체비용으로 평가되었고, Prakash의 알고리즘과 비교되었다.Abstract Managing location information of mobile hosts is an important issue in mobile computing systems. There is a trade-off between location update and search, when a mobile host moves. This paper proposes a simple quorum-based distributed dynamic location management method using location registers. The cost of location updates and searches is reduced by our method because the location information of mobile hosts is managed efficiently in a subset of location registers instead of in all location registers. In our method, the subset of location registers is dynamically changed, and the load of each location register is balanced by considering query rate for mobile hosts. The performance of proposed algorithm is evaluated in terms of the total cost of a location update and a location search, and is compared with Prakash's algorithm.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.33-45
• /
• 1998

The typical characteristic of PDM(Product Data Management) System seperates the databases to store the meta data and applications. Therefore, meta data contains the information for the location of file, user profiles, relationships between the files, and process. PDM utilizes these information efficiently and does file management, configuration management, and process management. In this view, the integration strategy of PDM is to merge data and process. In the view of architecture, the interface between data and application and the actions of each application execute seamlessly. This architecture is viewed as integrated data and process among enterprises and implemented with client/server technology in distributed process environment that interfaced with open object-oriented technology which is developed with business object in the object-oriented infrastructure. In this paper, we studied the definition, function, and scope of PDM and researched the core technologies to implement the PDM integration environment. We also researched the PDM utilization in distributed enterprise environment and implementation of PDM integration environment with this technical background.

• 한국공간정보시스템학회 논문지
• /
• 제10권4호
• /
• pp.11-19
• /
• 2008

최근 모바일 기기 및 무선 통신의 발달로 인하여 다양한 위치 기반 서비스에 대한 연구가 증대되고 있으며, 이러한 위치 기반 서비스의 대표적 질의인 k-최근접 질의를 효율적으로 처리하기 위한 연구가 활발히 수행되어 왔다. 기존 연구들은 질의 처리 성능의 향상을 위해, 공간 네트워크 상의 POI와 노드 사이의 거리를 미리 계산하는 pre-computation 기법을 사용한다. 그러나 이러한 pre-computation 기법들은 검색 대상이 되는 POI의 변경을 효과적으로 처리하지 못하는 단점을 갖는다. 본 논문에서는 기존 pre-computation 기법들의 단점을 극복하고, 대용량 이동객체의 위치정보를 효율적으로 관리하기 위하여 S-GRID를 이용한 분산 그리드 기법을 제안한다. 아울러 제안하는 분산 그리드 기법을 위한 k-최근접 질의 처리 알고리즘을 제시한다. 마지막으로, S-GRID 및 분산 그리드 기법의 k-최근접 질의처리 알고리즘의 성능 평가를 통해, 제안하는 기법의 우수성을 입증한다.

• 한국통신학회논문지
• /
• 제22권7호
• /
• pp.1437-1447
• /
• 1997

This paper proposes a cluster-based PCS(Personal Communication Services) network architecture to support increased signaling and control traffic. The procedures are presented to serve the mjobility management and the efficient procesing of the call-control functional using distributed servers. Especially when call-setups are made within a cluster, this distributed servers. Especially when call-setup time and the amount of control traffic of H-HLS (High level Home Location Server) in the network as L-HLS(Low lever Home Location Server) serves the call on behalf of H-HLS. Performance and reliability of the architecture have been also cairried out.