• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.1-10
• /
• 1995

The allocation of files is essential to the efficiency and effectiveness of a distributed system that must meet geographically dispersed data processing demands. In this paper, we address an optimization model that generates optimal file migration policies in distributed database systems. The proposed model is a more generalized model that includes system's capacity constraints - computing sites' storage capacity and communication networks' capacity - which have not taken into consideration in previous researches. Using this model, we can establish initial file allocation, file reallocation and file migration polices that minimize a system operating cost under system's capacity constraints at an initial system design or reorganization point The proposed model not only can be adopted by small-sized systems but also provides a foundation for effective and simple heuristics for adaptive file migration in large systems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.775-776
• /
• 2011

차량이 IGW(Internet Gateway)를 통해 외부 인터넷 망과 통신하는 V2I(Vehicle-to-Infrastructure) 환경에서는 IGW가 DHCP 서버로서의 역할을 수행함으로써 차량에게 IP 주소를 부여해준다. 이 경우 차량이 새로운 IGW의 커버리지 영역으로 이동하게 되면 이 IGW로부터 새로운 IP 주소를 부여받아야 하며, 이 경우 주소 할당을 받는데 수 초의 시간이 소요되어 서비스 단절이 발생한다. 본 논문에서는 V2I 환경에서 차량에게 IP 주소를 신속하게 할당해주기 위한 주소 선할당(pre-allocation) 방법을 제안한다. 주소 선할당 방법은 차량이 후행 차량들을 위해 IGW에게 IP 주소를 미리 요청하고 이렇게 획득한 주소를 후행 차량에게 할당해줌으로써 IP 주소 획득에 소요되는 시간을 줄여준다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.1-11
• /
• 2003

Fragmentation is the main performance bottleneck of large, multi-user multicomputer system. This paper presents an L-Shaped Submesh Allocation(LSSA) strategy, which lifts the restriction on the rectangular shape formed by allocated processors in order to address the problem of fragmentation. LSSA can manipulate the shape of the required submesh to fit into the fragmented mesh system. Thus, LSSA accommodates incoming jobs faster than other strategies and results in the reduction of job response time. Extensive simulations show that LSSA performs more efficiently than other strategies in terms of the external fragmentation, the job response time and the system utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.736-745
• /
• 2003

Resource allocation methods are proposed to address the problem of how flexibly allocate limited wireless resource to high bandwidth demanded realtime class with certain QoS guarantees in CDMA/TDD systems. In this method, A reserved access scheme is used for allocating the resource to realtime and non-realtime class respectively. We also propose a slot allocation algorithm for the CDMA/TDD system, which can prevent the performance degradation due to the interlink interference in each cell. Our framework is able to guarantee QoS continuity of realtime class and carry the maximum number of non-realtime subscriber. System performance of proposed method is evaluated by considering transmission delay, channel utilization and data loss, assuming a practical multi-cell environment and a multimedia service model. Our simulation results demonstrate the significant performance improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.1984-2002
• /
• 2020

With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1514-1531
• /
• 2014

Femtocell provides better coverage and higher spectrum efficiency in areas rarely covered by macrocells. However, serious two-tier interference emerging from randomly deploying femtocells may create dead zones where the service is unavailable for macro-users. In this paper, we present adopting cognitive radio spectrum overlay to avoid intra-tier interference and incorporating spectrum underlay and overlay to coordinate cross-tier interference. It is a novel centralized control strategy appropriate for both uplink and downlink transmission. We introduce the application of proper spectrum sharing strategy plus optimal power allocation to address the issue of OFDM-based femtocells interference-limited downlink transmission, along with, a low-complexity suboptimal solution proposed. Simulation results illustrate the proposed optimal scheme achieves the highest transmission rate on successfully avoiding two-tier interference, and outperforms the traditional spectrum underlay or spectrum overlay, via maximizing the opportunity to transmit. Moreover, the strength of our proposed schemes is further demonstrated by comparison with previous classic power allocation methods, in terms of transmission rate, computational complexity and signal peak-to-average power ratio.

• Asian Journal of Innovation and Policy
• /
• v.9 no.2
• /
• pp.223-239
• /
• 2020

It is important for urban planners and policy makers to understand complex, diverse urban demands and social structure, but this is not easy due to lack of data that represents the dynamics of residents at micro-geographical level. This paper explores how to create population data at at a micro-level by allocating population data to building. It attempted to allocate population data stored in a grid layer (100 meters by 100 meters) into a building footprint layer that represents the appearance of physical buildings. For the allocation, this paper describes a systemic approach that classifies grid cells into five prototypical patterns based on the composition of residential building types in a grid cell. This approach enhances allocation accuracy by accommodating heterogeneity of urban space rather than relying on the assumption of uniform spatial homogeneity of populations within an aerial unit. Unlike the methods that disaggregate population data to the parcel, this approach is more applicable to Asian cities where large multifamily residential parcels are common. However, it should be noted that this paper does not demonstrate the validity of the allocated population since there is a lack of the actual data available to be compared with the current estimated population. In the case of water and electricity, the data is already attached to an individual address, and hence, it can be considered to the purpose of the validation for the allocation. By doing so, it will be possible to identify innovative methods that create a population distribution dataset representing the comprehensive and dynamic nature of the population at the micro geographical level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.888-897
• /
• 2007

In this paper, we propose an uplink dynamic resource allocation algorithm to increase sector throughput and fairness among users in 802.16e OFDMA TDD system. In uplink, we address the difference between uplink and downlink channel state information in 802.16e OFDMA TDD system. The simulation results show that not only an increment of 10% of sector throughput but higher level of fairness is achieved by round-robin using the FLR and the rate / margin adaptive inner closed-loop power control algorithm. The FLR algorithm determines the number of sub-channels to be allocated to the user according to the user's position. Also, we get 31.8% more sector throughput compared with the round-robin using FLR by FASA algorithm using uplink channel state information. User selection, sub-channel allocation, power allocation algorithms and simulation methodology are mentioned in Part I.