• Title/Summary/Keyword: Data Allocation

Search Result 1,400, Processing Time 0.05 seconds

Reliability Allocation Model for KTX-II High Speed Train (KTX-II 고속 차량을 위한 신뢰도 할당 모델)

  • Lee, Kang-Won;Chung, In-Soo
    • Proceedings of the KSR Conference
    • /
    • 2007.05a
    • /
    • pp.45-57
    • /
    • 2007
  • During the design phase of a system, which requires high reliability and safety such as aircraft, high speed train and nuclear power plant, reliability engineer must set up the target system reliability. To meet a reliability goal for the system, reliability allocation should be done gradually from the system to its element. For this end, first of all, we need to construct functional block diagram based on the design output and PWBS(Project Work Breakdown System). Another important input data for reliability allocation is the relationship between the cost and the reliability. In this study we investigate various reliability allocation models, which can be applicable to aircraft, vehicle, and power plant, and etc. And we suggest a proper reliability allocation model which can be effectively applicable to KTX-II high speed train to achieve the target system reliability.

  • PDF

Bandwidth Allocation Scheme for Real-Time Communication on MS/TP Protocol (MS/TP 프로토콜에서 실시간 통신을 위한 대역폭 할당 기법)

  • Song, Won-Seok;Hong, Seung Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.11
    • /
    • pp.660-668
    • /
    • 2005
  • Digital communication networks have become a core technology in advanced building automation systems. BACnet (Building Automation and Control networks) is a standard data communication protocol designed specifically for building automation and control systems. BACnet adopts Master-Slave/Token-Passing (MS/TP) protocol as one of its field level networks. Tn this study, we introduce a method of implementing bandwidth allocation scheme in the MS/TP protocol. The bandwidth allocation scheme improves the capability of real-time communication of the original MS/TP protocol. The bandwidth allocation scheme introduced in this paper can be easily implemented in the existing MS/TP protocol with a slight modification. In this study, we examined the validity of bandwidth allocation scheme using simulation models. The results from the simulation experiment show that the proposed scheme satisfies the requirements of real-time communication.

Communication Resource Allocation Strategy of Internet of Vehicles Based on MEC

  • Ma, Zhiqiang
    • Journal of Information Processing Systems
    • /
    • v.18 no.3
    • /
    • pp.389-401
    • /
    • 2022
  • The business of Internet of Vehicles (IoV) is growing rapidly, and the large amount of data exchange has caused problems of large mobile network communication delay and large energy loss. A strategy for resource allocation of IoV communication based on mobile edge computing (MEC) is thus proposed. First, a model of the cloud-side collaborative cache and resource allocation system for the IoV is designed. Vehicles can offload tasks to MEC servers or neighboring vehicles for communication. Then, the communication model and the calculation model of IoV system are comprehensively analyzed. The optimization objective of minimizing delay and energy consumption is constructed. Finally, the on-board computing task is coded, and the optimization problem is transformed into a knapsack problem. The optimal resource allocation strategy is obtained through genetic algorithm. The simulation results based on the MATLAB platform show that: The proposed strategy offloads tasks to the MEC server or neighboring vehicles, making full use of system resources. In different situations, the energy consumption does not exceed 300 J and 180 J, with an average delay of 210 ms, effectively reducing system overhead and improving response speed.

Optimal Var allocation in System planning by Stochastic Linear Programming(II) (확률선형 계획법에 의한 최적 Var 배분 계뵉에 관한 연구(II))

  • Song, Kil-Yeong;Lee, Hee-Yoeng
    • Proceedings of the KIEE Conference
    • /
    • 1989.11a
    • /
    • pp.191-193
    • /
    • 1989
  • This paper presents a optimal Var allocation algorithm for minimizing power loss and improving voltage profile in a given system. In this paper, nodal input data is considered as Gaussian distribution with their mean value and their variance. A stochastic Linear Programming technique based on chance constrained method is applied to solve the probabilistic constraint. The test result in IEEE-14 Bus model system showes that the voltage distribution of load buses is improved and the power loss is more reduced than before Var allocation.

  • PDF

Performance and comparison resource management policies with channel De-Allocation in GPRS Network (GPRS에서 채널 de-allocation 이용시 자원관리 정책 평가 비교)

  • 송윤경;박동선
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.61-64
    • /
    • 2003
  • GPRS is designed for transmitting packet data and supposed to take its radio resource form the pool of channels unused by GSM voice services. In this paper, The GPRS and GSM circuit switched services share the same radio resource. Whenever a channel is not used by circuit switched services, it may be utilized by GPRS. In this paper, the main aim is performance and comparison resource management policies with channel de-allocation in GPRS network. Three resource management policies is voice priority, R-reservation, dynamic reservation.

  • PDF

Fuzzy Techniques in Optimal Bit Allocation

  • Kong, Seong-Gon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1313-1316
    • /
    • 1993
  • This paper presents a fuzzy system that estimates the optimal bit allocation matrices for the spatially active subimage classes of adaptive transform image coding in noisy channels. Transform image coding is good for image data compression but it requires a transmission error protection scheme to maintain the performance since the channel noise degrades its performance. The fuzzy system provides a simple way of estimating the bit allocation matrices from the optimal bit map computed by the method of minimizing the mean square error between the transform coefficients of the original and the reconstructed images.

  • PDF

HFAT: Log-Based FAT File System Using Dynamic Allocation Method

  • Kim, Nam Ho;Yu, Yun Seop
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.4
    • /
    • pp.405-410
    • /
    • 2012
  • Several attempts have been made to add journaling capability to a traditional file allocation table (FAT) file system. However, they encountered issues such as excessive system load or instability of the journaling data itself. If journaling data is saved as a file format, it can be corrupted by a user application. However, if journaling data is saved in a fixed area such as a reserved area, the storage can be physically corrupted because of excessive system load. To solve this problem, a new method that dynamically allocates journaling data is introduced. In this method, the journaling data is not saved as a file format. Using a reserved area and reserved FAT status entry of the FAT file system specification, the journaling data can be dynamically allocated and cannot be accessed by user applications. The experimental results show that this method is more stable and scalable than other log-based FAT file systems. HFAT was tested with more than 12,000 power failures and was stable.

An Index Allocation Method for the Broadcast Data in Mobile Environments with Multiple Wireless Channels (멀티무선채널을 갖는 모바일 환경에서 브로드캐스트 데이타를 위한 인덱스 할당 방법)

  • 이병규;정성원;이승중
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.37-52
    • /
    • 2004
  • Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile units over a single or multiple channels. Since the mobile units have limited battery power, the minimization of the access time for the broadcast data is an important problem. There have been many research efforts that focus on the improvement if the broadcast techniques by providing indexes on the broadcast data. In this paper, we studied an efficient index allocation method for the broadcast data over multiple physical channels, which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques either require the equal size of index and data or have a performance degradation problem when the number of given physical channels is not enough. These two problems will result in the increased average access time for the broadcast data. To cope with these problems, we propose an efficient tree- structured index allocation method for the broadcast data with different access frequencies over multiple physical channels. Our method minimizes the average access time for the broadcast data by broadcasting the hot data and their indexes more often than the less hot data and their indexes. We present an in-0e0th experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decrease the average access time for the broadcast data over existing methods.

Spatial Operation Allocation Scheme over Common Query Regions for Distributed Spatial Data Stream Processing (분산 공간 데이터 스트림 처리에서 질의 영역의 겹침을 고려한 공간 연산 배치 기법)

  • Chung, Weon-Il
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.6
    • /
    • pp.2713-2719
    • /
    • 2012
  • According to increasing of various location-based services, distributed data stream processing techniques have been widely studied to provide high scalability and availability. In previous researches, in order to balance the load of distributed nodes, the geographic characteristics of spatial data stream are not considered. For this reason, distributed operations for adjacent spatial regions increases the overall system load. We propose a operation allocation scheme considering the characteristics of spatial operations to effectively processing spatial data stream in distributed computing environments. The proposed method presents the efficient share maximizing approach that preferentially distributes spatial operations sharing the common query regions to the same node in order to separate the adjacent spatial operations on overlapped regions.

Joint User Association and Resource Allocation of Device-to-Device Communication in Small Cell Networks

  • Gong, Wenrong;Wang, Xiaoxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.1-19
    • /
    • 2015
  • With the recent popularity of smart terminals, the demand for high-data-rate transmission is growing rapidly, which brings a new challenge for the traditional cellular networks. Both device-to-device (D2D) communication and small cells are effective to improve the transmission efficiency of local communication. In this paper, we apply D2D communication into a small cell network system (SNets) and study about the optimization problem of resource allocation for D2D communication. The optimization problem includes system scheduling and resource allocation, which is exponentially complex and the optimal solution is infeasible to achieve. Therefore, in this paper, the optimization problem is decomposed into several smaller problems and a hierarchical scheme is proposed to obtain the solution. The proposed hierarchical scheme consists of three steps: D2D communication groups formation, the estimation of sub-channels needed by each D2D communication group and specific resource allocation. From numerical simulation results, we find that the proposed resource allocation scheme is effective in improving the spectral efficiency and reducing the outage probability of D2D communication.