• Title/Summary/Keyword: Policy Delay

Search Result 309, Processing Time 0.027 seconds

A SAN Optimization Scheme for High-Performance Storage System (고성능 저장장치를 위한 SAN최적화기법)

  • Lee, In-Seon
    • Journal of Digital Convergence
    • /
    • v.12 no.1
    • /
    • pp.379-388
    • /
    • 2014
  • We noted that substituting hard disk with high-performance storage device on SAN did not immediately result in getting high performance. Investigating the reason behind this leaded us to propose optimization schemes for high-performance storage system. We first got rid of the latency in the I/O process which is unsuitable for the high-performance storage device, added parallelism on the storage server, and applied temporal merge to Superhigh speed network protocol for improving the performance with small random I/O. The proposed scheme was implemented on the SAN with high-performance storage device and we verified that there were about 30% reduction on the I/O delay latency and 200% improvement on the storage bandwidth.

Operating System level Dynamic Power Management for Robot (로봇을 위한 운영체제 수준의 동적 전력 관리)

  • Choi Seungmin;Chae Sooik
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.5 s.335
    • /
    • pp.63-72
    • /
    • 2005
  • This paper describes a new approach for the operating system level power management to reduce the energy consumed in the IO devices in a robot platform, which provides various functions such as navigation, multimedia application, and wireless communication. The policy proposed in the paper, which was named the Energy-Aware Job Schedule (EAJS), rearranges the jobs scattered so that the idle periods of the devices are clustered into a time period and the devices are shut down during their idle period. The EAJS selects a schedule that consumes the minimum energyamong the schedules that satisfy the buffer and time constraints. Note that the burst job execution needs a larger memory buffer and causes a longer time delay from generating the job request until to finishing it. A prototype of the EAJS is implemented on the Linux kernel that manages the robot system. The experiment results show that a maximum $44\%$ power saving on a DSP and a wireless LAN card can be obtained with the EAJS.

Efficient Cache Architecture for Transactional Memory (트랜잭셔널 메모리를 위한 효율적인 캐시 구조)

  • Choi, Dong-Min;Kim, Seung-Hun;Ro, Won-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.4
    • /
    • pp.1-8
    • /
    • 2011
  • Traditional transactional memory systems are no longer able to guarantee the performance of diverse applications with overflowed transactions since there is the drawback that tracking the data for logging is difficult. Especially, this mechanism has a disadvantage of increasing communication delay for sustaining the state which is required to detect the conflict on the overflowed transactions from the first level cache in the transactional memory systems. To address this point, we have focused on the cache architecture of the systems to reduce the overhead caused by overflows and cache misses. In this paper, we present Supportive Cache which reduces additional overhead during transactions. Supportive Cache performs a parallel look-up with L1 private cache and uses the same replacement policy as L1 private cache. We evaluate the performance of the proposed design by comparing LogTM-SE with and without Supportive Cache. The simulation results show that our system improves the performance by 37% on average, compared to the original LogTM-SE which uses the same hardware resource.

Asynchronous and Adaptive Massage Passing Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 비동기 적응형 메시지 전달 기법)

  • Jeong, Jong-Kyun;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.3
    • /
    • pp.196-201
    • /
    • 2013
  • In this paper, we propose an asynchronous and adaptive message passing scheme based on S-MAC for handling with the problem on energy efficiency in wireless sensor networks. The proposed scheme consists of a policy that differentiate transmission errors caused by packet collision or radio interference from congestion errors caused by buffer overflow and a method that adaptively controls the size of a fragment according to the variance of traffic loads. Especially, it presents a method that highly reduce the energy consumption by keeping the size of fragment not being excessively smaller than the one that may result in rapid increment of the total transfer time. Finally, with the simulation results we show that network throughput and delay are improved by using the proposed message passing scheme.

PR-MAC Protocol based on Priority in Underwater Acoustic Sensor Networks (수중 음파 센서 네트워크에서 우선순위 기반의 PR-MAC 포로토콜)

  • Cho, Hui-Jin;NamGung, Jung-Il;Yun, Nam-Yeol;Park, Soo-Hyun;Ryuh, Young-Sun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.2
    • /
    • pp.258-268
    • /
    • 2011
  • Underwater acoustic sensor networks can be used disaster prevention and environmental monitoring systems in underwater environments. Because, the underwater environment is different from the ground, the long propagation delay, low transfer rates and limited bandwidth characteristics should be considered. In this, paper will propose the MAC protocol that allocates time slot into each node according to priority policy through the period of contention-free slot reservation in underwater acoustic sensor networks in order to avoid collision and minimize energy consumption waste. We perform mathematical analysis to evaluate the performance of the proposed protocol with regard to the collision probability, the energy consumption by collision, throughput and channel utilization. We compare the proposed protocol with the conventional protocol, and the performance results show that the proposed protocol outperforms the conventional protocol.

A Study on an ETCS Demand Forecasting Model of Toll Roads in Changwon City (유료도로 ETCS 이용수요 예측모형에 관한 연구 (창원시를 중심으로))

  • Kim, Kyung-Whan;Ha, Man-Bok;Jeon, Yeon-Hoo;Lee, Ik-Su
    • International Journal of Highway Engineering
    • /
    • v.9 no.1 s.31
    • /
    • pp.17-27
    • /
    • 2007
  • Since early 1990s, several developed countries have applied the Electronic Toll Collection System (ETCS) to toll roads in order to solve traffic congestion and delay problems at toll plazas. For the successful operation of the ETCS, it is important to correctly forecast the ETCS using rate. In this study, it was conceived to develop a sophisticated demand forecasting model of the ETCS for toll roads in Changwon City The Binary Logit and neural network models were tested for the model considering 11 explaining variables. The best results in prediction accuracy and goodness-of-fit were obtained on the neural network model. However, because of the difficulty in predicting the 11 variables and its fitness in wide range, the Binary Logit model which considers three policy variables only is recommended as the model to forecast the ETCS using rate.

  • PDF

Multi-layer Network Virtualization for QoS Provisioning in Tactical Networks (전술망의 서비스 품질 보장을 위한 다계층 네트워크 가상화 기법)

  • Kim, Yohan;An, Namwon;Park, Juman;Park, Chan Yi;Lim, Hyuk
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.4
    • /
    • pp.497-507
    • /
    • 2018
  • Tactical networks are evolving into an All-IP based network for network centric warfare(NCW). Owing to the flexibility of IP based network, various military data applications including real-time and multi-media services are being integrated in tactical networks. Because each application has diverse Quality-of-service(QoS) requirements, it is crucial to develop a QoS provisioning method for guaranteeing QoS requirements efficiently. Conventionally, differentiated services(DiffServ) have been used to provide a different level of QoS for traffic flows. However, DiffServ is not designed to guarantee a specific requirement of QoS such as delay, loss, and bandwidth. Therefore, it is not suitable for military applications with a tight bound of QoS requirements. In this paper, we propose a multi-layer network virtualization scheme that allocates traffic flows having different QoS requirements to multiple virtual networks, which are constructed to support different QoS policies such as virtual network functions(VNFs), routing, queueing/active queue management(AQM), and physical layer policy. The experiment results indicate that the proposed scheme achieves lower delays and losses through multiple virtual networks having differentiated QoS policies in comparison with conventional networks.

Standardization of Maintenance and Failure of Transfer Crane (Transfer Crane의 고장 및 정비 표준화)

  • Yun Won-Young;Lee You-Hyoun;Ha Young-Ju;Kim Gui-Rae;Son Bum-Shin
    • Journal of Navigation and Port Research
    • /
    • v.30 no.6 s.112
    • /
    • pp.525-531
    • /
    • 2006
  • In the port, the yard crane is very important. If a container crane or a transfer crane is broken down, it costs a lot because of the delay of work during the period of repair or reorder. But, we don't have enough spare parts because of the high cost. It is necessary to maintain high reliability of the crane through effective preventive maintenance and failure analysis. In this paper, we analyse the function and failure mechanism of the transfer crane which is a main equipment in the yard Also, we standardize failures and maintenance works using the historical data of failure and maintenance. This study which is a basic work for effective equipment operation and maintenance will support reliability engineers to decide the optimal design of the next generation equipment and operational policy of equipment.

Estimating the Optimal Buffer Size on Mobile Devices for Increasing the Quality of Video Streaming Services (동영상 재생 품질 향상을 위한 최적 버퍼 수준 결정)

  • Park, Hyun Min
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.3
    • /
    • pp.34-40
    • /
    • 2018
  • In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

Streaming Service Scheduling Scheme in Mobile Networks (모바일환경에서 실시간 데이타서비스를 위한 스케줄링 정책)

  • Min Seung-Hyun;Kim Myung-Jun;Bang Kee-Chun
    • Journal of Digital Contents Society
    • /
    • v.3 no.1
    • /
    • pp.47-57
    • /
    • 2002
  • Recently, wireless networks have been pursuing multimedia data service as voice, data, image, video and various form of data according to development of information communication technology. It guarantees cell delivery delay of real time data in efficient real time multimedia data transfer. Also, it minimizes cell loss rate of non-real time multimedia data. In the wireless ATM, there are based on Asynchronous Transfer Mode(ATM). It implies that there are various service with difficult transmission rates and qualities in the wireless communication network. As a result, it is important to find out the ways to guarantee the Quality of Service(QoS) for each kind of traffic in wireless network. In this thesis, we propose an improved TCRM scheduling algorithms for transmission real-time multimedia data service in wireless ATM Networks. We appear real time multimedia scheduling policy that apply each different method to uplink and downlik to wireless ATM network. It can guarantee QoS requirements for each real time data and non-real time data. It also deals the fairness problem for sharing the scarce wireless resources. We solve fault of TCRM as inefficient problem of non-real data by using arbitrary transmission speed and RB(Reservation Buffer) through VC(Virtual Control) and BS(Base Station).

  • PDF