• Title/Summary/Keyword: delay space

Search Result 637, Processing Time 0.032 seconds

Design of a Request Pattern based Video Proxy Server Management Technique for an Internet Streaming Service (인터넷 스트리밍 서비스를 위한 요청 기반 비디오 프록시 서버 관리 기법의 설계)

  • Lee, Jun-Pyo;Cho, Chul-Young;Lee, Jong-Soon;Kim, Tae-Yeong;Kwon, Cheol-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.6
    • /
    • pp.57-64
    • /
    • 2010
  • Due to the limited storage space in video proxy server, it is often required to replace the old video data which is not serviced for long time with the newly requested video. This replacement causes the service delay and increase of network traffic. To circumvent this problem, we propose the an efficient replacement scheme in a video proxy server. In addition, we present a video data management technique for decreasing the number of replacement in video proxy server. For this purpose, we employ a memory in video proxy server. If the video segment which is loaded in memory is requested once again by a different user, this segment is resided in memory. The video in the memory is stored in the video proxy server depending on the consuming pattern by users. The simulation results show that the proposed algorithm performs better than other algorithms in terms of packet hit rate and number of packet replacement.

A Geographic Distributed Hash Table for Virtual Geographic Routing in MANET (MANET에서 가상 위치 기반 라우팅을 위한 지역 분산 해쉬 테이블 적용 방법)

  • Ko, Seok-Kap;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.58-65
    • /
    • 2008
  • This paper presents a new geographic distributed hash table (GDHT) for MANETs or Mesh networks, where virtual geographic protocol is used. In previous wort GDHT is applied to a network scenario based on two dimensional Cartesian coordinate system. Further, logical data space is supposed to be uniformly distributed. However, mobile node distribution in a network using virtual geographic routing is not matched to data distribution in GDHT. Therefore, if we apply previous GDHT to a virtual geographic routing network, lots of DHT data are probably located at boundary nodes of the network or specific nodes, resulting in long average-delay to discover resource (or service). Additionally, in BVR(Beacon Vector Routing) or LCR(Logical Coordinate Routing), because there is correlation between coordinate elements, we cannot use normal hash function. For this reason, we propose to use "geographic hash function" for GDHT that matches data distribution to node distribution and considers correlation between coordinate elements. We also show that the proposed scheme improves resource discovery efficiently.

Post-traumatic stress and related factors among safety managers in Korea National Parks (국립공원 안전관리전담자들의 외상 후 스트레스 실태 및 관련요인)

  • Kim, Hyung-Wook;Han, Mi-Ah
    • The Korean Journal of Emergency Medical Services
    • /
    • v.20 no.2
    • /
    • pp.37-49
    • /
    • 2016
  • Purpose: This study investigated the current status of post-traumatic stress and related factors among safety managers in Korea National Parks. Methods: The study subjects were 109 safety managers working in Korea National Parks. General characteristics, job-related characteristics, experience of traumatic events and post-traumatic stress were collected by self-reported questionnaires through the mail. The associated factors with post-traumatic stress was analyzed by t-test, ANOVA and multiple linear regression. Results: Overall score of post-traumatic stress was $10.32{\pm}11.37$ and 12.8% was the high-risk group of post-traumatic stress disorder. In simple analysis, score of post-traumatic stress was associated with drinking frequency, disease history, duration of career, delay of rescue, provided the break, rest space and the number of experiences of traumatic events. Finally, the score of post-traumatic stress was significantly higher in subjects who experienced 3 (B=9.141, SE=3.538) or more than 4 (B=11.367, SE=3.063) traumatic events compared to subjects without experience of traumatic event. Conclusion: The score of post-traumatic stress was $10.32{\pm}11.37$ and 12.8% was the high-risk group among safety managers in Korea National Parks. Post-traumatic stress was associated with the experience of traumatic events. Management of safety managers after mobilization or experience of traumatic events will be helpful to decrease of post-traumatic stress.

A Scalable Content-Sharing Architecture for High-quality TV Programs (확장 가능한 실시간 고화질 TV 컨텐츠 공유 아키텍처)

  • Chung, Sungwook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2651-2657
    • /
    • 2014
  • It can be organized with PVRs and FC-AL for a high-quality TV content-sharing architecture. It is, however, not easy to configure a large community network with the FC-AL since it has a 7-bit address space with supporting up to 127 users. We, therefore, propose a novel scalable FC-AL multiple-loop architecture using shared disks, which does not need to use expensive and load-concentrated switches. In this article, our suggested architecture shows a superb startup delay, such as less than 20msec. In addition, it demonstrates outstanding scalability, such that the number of accomodable users increases almost linearly according to adding loops. Lastly, it reveals exceptional time-shifting hours, that is, which supports more than 140 hours with 1000 users.

Searching for an Intra-block Remarshalling Plan for Multiple Transfer Cranes (복수 트랜스퍼 크레인을 활용하는 블록 내 재정돈 계획 탐색)

  • Oh Myung-Seob;Kang Jae-Ho;Ryu Kwang-Ryel;Kim Kap-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.7
    • /
    • pp.624-635
    • /
    • 2006
  • This paper applies simulated annealing algorithm to the problem of generating a plan for intra-block remarshalling with multiple transfer cranes. Intra-block remarshalling refers to the task of rearranging containers scattered around within a block into certain designated target areas of the block so that they can be efficiently loaded onto a ship. In generating a remarshalling plan, the predetermined container loading sequence should be considered carefully to avoid re-handlings that may delay the loading operations. In addition, the required time for the remarshalling operation itself should be minimized. A candidate solution in our search space specifies target locations of the containers to be rearranged. A candidate solution is evaluated by deriving a container moving plan and estimating the time needed to execute the plan using two cranes with minimum interference. Simulation experiments have shown that our method can generate efficient remarshalling plans in various situations.

Design of a Virtual Machine based on the Lua interpreter for the On-Board Control Procedure Execution Environment (탑재운영절차서 실행환경을 위한 Lua 인터프리터 기반의 가상머신 설계)

  • Kang, Sooyeon;Koo, Cheolhea;Ju, Gwanghyeok;Park, Sihyeong;Kim, Hyungshin
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.4
    • /
    • pp.127-133
    • /
    • 2014
  • In this paper, we present the design, functions and performance analysis of the virtual machine (VM) based on the Lua interpreter for On-Board Control Procedure Execution Environment (OEE). The development of the OEE has been required in order to operate the lunar explorer mission autonomously which is planned by Korea Aerospace Research Institute (KARI) autonomously. The concept of On-Board Control Procedure (OBCP) is already being applied to the deep space missions with a long propagation delay and a limited data transmission capacity since it ensure he autonomy of the mission without the ground intervention. The interpreter is the execution engine in the VM and it interpreters high-level programming codes line by line and executes the VM instructions. So the execution speed is very more slower than that of natively compiled codes. In order to overcome it, we design and implement OEE using register-based Lua interpreter for execution engine in OEE. We present experimental results on a range of additional hardware configurations such as usages of cache and floating point unit. We expect those to utilized to the OBCP scheduling policy and the system with Lua interpreter.

A Data Centric Storage based on Adaptive Local Trajectory for Sensor Networks (센서네트워크를 위한 적응적 지역 트라젝토리 기반의 데이터 저장소 기법)

  • Lim, Hwa-Jung;Lee, Joa-Hyoung;Yang, Dong-Il;Tscha, Yeong-Hwan;Lee, Heon-Guil
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.19-30
    • /
    • 2008
  • Sensor nodes are used as a storage space in the data centric storage method for sensor networks. Sensor nodes save the data to the node which is computed by hash table and users also access to the node to get the data by using hash table. One of the problems which the data centric storage method has is that queries from many users who are interested in the popular data could be concentrated to one node. In this case, responses for queries could be delayed and the energy of heavy loaded node could be dissipated fast. This would lead to reduction of network life time. In this paper, ALT, Data Centric Storage based on Adaptive Local Trajectory, is proposed as scalable data centric storage method for sensor network. ALT constructs trajectory around the storage node. The scope of trajectory is increased or decreased based on the query frequency. ALT distributes the query processing loads to several nodes so that delay of response is reduced and energy dissipation is also distributed.

A Case Study of Minimizing Construction Time in Long and Large Twin Tube Tunnel (대단면 장대터널 공기단축 사례연구)

  • No Sang-Lim;Noh Seung-Hwan;Lee Sang-Pil;Kim Moon-Ho;Seo Jung-Woo
    • Tunnel and Underground Space
    • /
    • v.15 no.3 s.56
    • /
    • pp.177-184
    • /
    • 2005
  • The Sapaesan tunnel, the longest twin tube tunnel (4km) in Korea with 4 lanes each, is under construction with two years of delayed schedule because of the strong opposition from environmental bodies. Therefore, maximizing the construction efficiency was needed in tunnel project to compensate for time delay. This study includes improvements in the construction of the Sapaesan tunnel such as increasing excavation length and changing excavation sequence. In this paper the system for predicting tunnel face ahead is also introduced. Bulk-Emulsion explosive and Cylinder-Cut method were adopted in tunnel blasting to increase the excavation length. Optimum tunnel excavation step was designed to make up delayed time. Tunnel foe mapping, TSP survey and geological prediction system using computerized jumbo-drill were performed fnr safe construction of long and large twin tube tunnel.

Propulsion System Design and Optimization for Ground Based Interceptor using Genetic Algorithm

  • Qasim, Zeeshan;Dong, Yunfeng;Nisar, Khurram
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.330-339
    • /
    • 2008
  • Ground-based interceptors(GBI) comprise a major element of the strategic defense against hostile targets like Intercontinental Ballistic Missiles(ICBM) and reentry vehicles(RV) dispersed from them. An optimum design of the subsystems is required to increase the performance and reliability of these GBI. Propulsion subsystem design and optimization is the motivation for this effort. This paper describes an effort in which an entire GBI missile system, including a multi-stage solid rocket booster, is considered simultaneously in a Genetic Algorithm(GA) performance optimization process. Single goal, constrained optimization is performed. For specified payload and miss distance, time of flight, the most important component in the optimization process is the booster, for its takeoff weight, time of flight, or a combination of the two. The GBI is assumed to be a multistage missile that uses target location data provided by two ground based RF radar sensors and two low earth orbit(LEO) IR sensors. 3Dimensional model is developed for a multistage target with a boost phase acceleration profile that depends on total mass, propellant mass and the specific impulse in the gravity field. The monostatic radar cross section (RCS) data of a three stage ICBM is used. For preliminary design, GBI is assumed to have a fixed initial position from the target launch point and zero launch delay. GBI carries the Kill Vehicle(KV) to an optimal position in space to allow it to complete the intercept. The objective is to design and optimize the propulsion system for the GBI that will fulfill mission requirements and objectives. The KV weight and volume requirements are specified in the problem definition before the optimization is computed. We have considered only continuous design variables, while considering discrete variables as input. Though the number of stages should also be one of the design variables, however, in this paper it is fixed as three. The elite solution from GA is passed on to(Sequential Quadratic Programming) SQP as near optimal guess. The SQP then performs local convergence to identify the minimum mass of the GBI. The performance of the three staged GBI is validated using a ballistic missile intercept scenario modeled in Matlab/SIMULINK.

  • PDF

An Efficient Management Model of Security Policy in the Unified Threat Management System (통합 보안 시스템에서의 효율적인 보안 정책 관리 모델)

  • Joo, Heon-Sik;Kim, Jong-Wan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.9
    • /
    • pp.99-107
    • /
    • 2010
  • This paper showed that the integrated system to fortify security was much more efficient than the respective system through the analysis of problems from Firewall and IPS system in the existing security systems. The results of problem analysis revealed that there were the delay of processing time and lack of efficiency in the existing security systems. Accordingly, their performance was evaluated by using the separated Firewall, IPS system, and the integrated system. The result of evaluation shows that the integrated security system this paper suggested is five times faster than the existing one in terms of processing speed of response. This paper demonstrated the excellence of the proposed security system is also more than fivefold in session handling per second and six times process speeding in the CPU processing performance. In addition, several security policies are applied, and it provided a fact that it gave an excellent performance when it comes to protecting from harmful traffic attacks. In conclusion, this paper emphasized that fortifying the integrated security system was more efficient than fortifying the existing one considering in various respects such as cost, management, time, space and so on.