• Title/Summary/Keyword: network storage

Search Result 1,076, Processing Time 0.024 seconds

Analysis and Design of Profiling Adaptor for XML based Energy Storage System (XML 기반의 에너지 저장용 프로파일 어댑터 분석 및 설계)

  • Woo, Yongje;Park, Jaehong;Kang, Mingoo;Kwon, Kiwon
    • Journal of Internet Computing and Services
    • /
    • v.16 no.5
    • /
    • pp.29-38
    • /
    • 2015
  • The Energy Storage System stores electricity for later use. This system can store electricity from legacy electric power systems or renewable energy systems into a battery device when demand is low. When there is high electricity demand, it uses the electricity previously stored and enables efficient energy usage and stable operation of the electric power system. It increases the energy usage efficiency, stabilizes the power supply system, and increases the utilization of renewable energy. The recent increase in the global interest for efficient energy consumption has increased the need for an energy storage system that can satisfy both the consumers' demand for stable power supply and the suppliers' demand for power demand normalization. In general, an energy storage system consists of a Power Conditioning System, a Battery Management System, a battery cell and peripheral devices. The specifications of the subsystems that form the energy storage system are manufacturer dependent. Since the core component interfaces are not standardized, there are difficulties in forming and operating the energy storage system. In this paper, the design of the profile structure for energy storage system and realization of private profiling system for energy storage system is presented. The profiling system accommodates diverse component settings that are manufacturer dependent and information needed for effective operation. The settings and operation information of various PCSs, BMSs, battery cells, and other peripheral device are analyzed to define profile specification and structure. A profile adapter software that can be applied to energy storage system is designed and implemented. The profiles for energy storage system generated by the profile authoring tool consist of a settings profile and operation profile. Setting profile consists of configuration information for energy device what composes energy saving system. To be more specific, setting profile has three parts of category as information for electric control module, sub system, and interface for communication between electric devices. Operation profile includes information in relation to the method in which controls Energy Storage system. The profiles are based on standard XML specification to accommodate future extensions. The profile system has been verified by applying it to an energy storage system and testing charge and discharge operations.

Index based on Constraint Network for Spatio-Temporal Aggregation of Trajectory in Spatial Data Warehouse

  • Li Jing Jing;Lee Dong-Wook;You Byeong-Seob;Oh Young-Hwan;Bae Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1529-1541
    • /
    • 2006
  • Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

  • PDF

Validation of 3D discrete fracture network model focusing on areal sampling methods-a case study on the powerhouse cavern of Rudbar Lorestan pumped storage power plant, Iran

  • Bandpey, Abbas Kamali;Shahriar, Kourush;Sharifzadeh, Mostafa;Marefvand, Parviz
    • Geomechanics and Engineering
    • /
    • v.16 no.1
    • /
    • pp.21-34
    • /
    • 2018
  • Discontinuities considerably affect the mechanical and hydraulic properties of rock mass. These properties of the rock mass are influenced by the geometry of the discontinuities to a great extent. This paper aims to render an account of the geometrical parameters of several discontinuity sets related to the surrounding rock mass of Rudbar Lorestan Pumped Storage Power Plant powerhouse cavern making use of the linear and areal (circular and rectangular) sampling methods. Taking into consideration quite a large quantity of scanline and the window samplings used in this research, it was realized that the areal sampling methods are more time consuming and cost-effective than the linear methods. Having corrected the biases of the geometrical properties of the discontinuities, density (areal and volumetric) as well as the linear, areal and volumetric intensity accompanied by the other properties related to four sets of discontinuities were computed. There is an acceptable difference among the mean trace lengths measured using two linear and areal methods for the two joint sets. A 3D discrete fracture network generation code (3DFAM) has been developed to model the fracture network based on the mapped data. The code has been validated on the basis of numerous geometrical characteristics computed by use of the linear, areal sampling methods and volumetric method. Results of the linear sampling method have significant variations. So, the areal and volumetric methods are more efficient than the linear method and they are more appropriate for validation of 3D DFN (Discrete Fracture Network) codes.

Security Association and Testbed Implementation for Separated Business and Organizational Networks (업무망/기관망의 보안 연결 방안 연구 및 테스트베드 구축)

  • Park, Se-Chul;Jang, In-Sik;Lee, Jae-Yong;Kim, Byung-Chul;Lee, Myung-Sin;Hyun, Dae-Hwan;Chung, Dae-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.12
    • /
    • pp.42-53
    • /
    • 2011
  • As IT industry using networks have been developed explosively, online operations that were conducted in offline are increasing rapidly, and even relationship with other people made online. As online crimes are increasing accordingly, building security networks is getting very important. As a result, network separation between business and organization network has been performed recently, but this causes network user inconvenience and efficiency reduction. In this paper, we propose reassociation methods for already separated networks for many public organizations. We implement two reassociation methods using NAT device and shared storage and show their experimental results.

Textural Properties and Structures of Wheat and Maize Starch-Gum Mixed Gels During Storage

  • Song, Ji-Young;Kim, Young-Chang;Shin, Mal-Shick
    • Food Science and Biotechnology
    • /
    • v.17 no.1
    • /
    • pp.20-25
    • /
    • 2008
  • Effects of commercial and lab-generated gellan gums on the textural properties, structure, and aging of wheat and maize starch gels were investigated using a rapid visco-analyzer (RVA), rheometer, scanning electron microscope (SEM), and X-ray diffractometer. Gellan and guar gums increased the peak and final viscosities, but xanthan gum and gum arabic reduced them. The maize starch had higher breakdown viscosity than the wheat starch, regardless of the type of gum. The hardness of all starch gels increased during storage, but their cohesiveness and springiness decreased. The degree of the gel hardness showed higher in maize starch than in wheat starch and the effect of gum addition had a difference with gum type. The wheat starch-guar and -gellan gum mixed gels showed higher elasticity and cohesiveness after storage. The starch-gellan gum mixed gels had dense and stable network structures, and were well maintained even after 7 days of storage. Most of the gums had anti-aging effect on X-ray diffraction pattern of starch gels.

The Mapping Method by Equation for Adding Disks for Striping System (스트라이핑 시스템에서 디스크 추가를 위한 계산에 의한 매핑 방법)

  • 박유현;김창수;강동재;김영호;신범주
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.1
    • /
    • pp.15-27
    • /
    • 2003
  • Recently, the volume of data is increasing rapidly in server for multimedia service, according to development of multimedia application environment. In recent research for storage technology the technology like of the SAN(Storage Area Network) advantages in scalibility of storage devices, and can read data from multiple disk arrays through RAID 0, 5. The RAID 0 and 5 translate to logical address to physical address using equation, but in case of adding disks at the system with equation -based mapping, the problem that we must rearrange the whole data in the previous disks happens. We use the mapping table to solve this problem in recent, but we can not load the whole mapping table in main memory because it occupies too large space. Therefore the extra I/Os are demanded to evaluate real physical address of data, so total performance of the system is degraded. In this paper, we propose the mapping method that supports the scalibility in RAID 0 or 5 system. The proposing method applies small metadata, so- called SZIT and simple equation, so it is possible that we make translate logical address to physical address rapidly and it is scalable in disk extending simultaneously Our suggesting method, if we add disks to the striping system for expanding of storage capacity, has an advantage of never stop service. So, SZlT-based mapping method can do online-disk-expanding in real-time service.

  • PDF

GDCS : Energy Efficient Grid based Data Centric Storage for Sensor Networks (GDCS : 센서네트워크를 위한 에너지 효율적인 그리드 기반 데이터 중심 저장 시스템)

  • Shin, Jae-Ryong;Yoo, Jae-Soo;Song, Seok-Il
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.98-105
    • /
    • 2009
  • In this paper, new data centric storage that is dynamically adapted to the change of work load is proposed. The proposed data centric storage distributes the load of hot spot area by using multilevel grid technique. Also, the proposed method is able to use existing routing protocol such as GPSR (Greedy Perimeter Stateless Routing) with small changes. Through simulation the proposed method enhances the lifetime of sensor networks over one of the state-of-the-art data centric storages. We implement the proposed method based on a operating system for sensor networks, and evaluate the performance through running based on a simulation tool.

The Streaming Method using Multiple Description Coding for cluster-based server with shared-nothing storage (비 공유 저장장치를 가지는 클러스터 기반 서버에서 다중 디스크립션 코딩을 이용한 스트리밍 방법)

  • Bak Yu-Hyeon;Kim Hag-Young;Kim Myung-Joon;Kim Kyong-Sok
    • The KIPS Transactions:PartA
    • /
    • v.13A no.3 s.100
    • /
    • pp.211-222
    • /
    • 2006
  • The cluster system with shared-nothing storage cannot escape from the problem of skewed request toward specific contents. This paper, therefore, suggests streaming method using MDC (Multiple Description Coding) instead of using single original content; this method is able to cope with skewed request in shared-nothing storage server as well as to continue to provide services in case of the system failure. Also, the system can support adaptive streaming service according to user player type, network status, the load of server, and client.

Controller Backup and Replication for Reliable Multi-domain SDN

  • Mao, Junli;Chen, Lishui;Li, Jiacong;Ge, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.12
    • /
    • pp.4725-4747
    • /
    • 2020
  • Software defined networking (SDN) is considered to be one of the most promising paradigms in the future. To solve the scalability and performance problem that a single and centralized controller suffers from, the distributed multi-controller architecture is adopted, thus forms multi-domain SDN. In a multi-domain SDN network, it is of great importance to ensure a reliable control plane. In this paper, we focus on the reliability problem of multi-domain SDN against controller failure from perspectives of backup controller deployment and controller replication. We firstly propose a placement algorithm for backup controllers, which considers both the reliability and the cost factors. Then a controller replication mechanism based on shared data storage is proposed to solve the inconsistency between the active and standby controllers. We also propose a shared data storage layout method that considers both reliability and performance. Besides, a fault recovery and repair process is designed based on the controller backup and shared data storage mechanism. Simulations show that our approach can recover and repair controller failure. Evaluation results also show that the proposed backup controller placement approach is more effective than other methods.

Popularity-Based Adaptive Content Delivery Scheme with In-Network Caching

  • Kim, Jeong Yun;Lee, Gyu Myoung;Choi, Jun Kyun
    • ETRI Journal
    • /
    • v.36 no.5
    • /
    • pp.819-828
    • /
    • 2014
  • To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in-network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content's popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in-network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme.