• Title/Summary/Keyword: Policy server

Search Result 354, Processing Time 0.025 seconds

Design and Implementation of Fault Tolerant parallel server with double striping (이중 스트라이핑을 이용한 Fault Tolerant 병렬서버의 설계와 구현)

  • 이민홍;김경훈;김서균;남지승
    • Proceedings of the IEEK Conference
    • /
    • 2002.06c
    • /
    • pp.75-78
    • /
    • 2002
  • In this paper, we present the design and implementation of a Fault Tolerant VOD system. The system uses the double striping policy that a original file is sequentially striped to multiple streaming server with constant data block size and the data block of one streaming server is re-striped to the other streaming server. When a fault occurs in one streaming server, automatically the other streaming server will service.

  • PDF

The Threshold Policy in the M/M/2 Queue with Server Vacation (휴가가 존재하는 M/M/2 대기 시스템의 한계치를 이용한 제어정책)

  • 이효성
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.2
    • /
    • pp.1-10
    • /
    • 1995
  • In this study, a threshold policy is considered for the M/M/2 queueing system with server vacations. The probability generating function for the number of customers present in the system is derived using an embedded Markov chain approach. Then, assuming a linear cost structure, an efficient procedure to find an optimal threshold policy is presented. The Laplace-Stieltjes transofrm for th waiting time of an arbitrary customer under a "FIFO" discipline is also derived.o derived.

  • PDF

On The Performance of A Suboptimal Assignment Policy in N-Queue m-Server System

  • Ko Soon-Ju
    • Journal of the military operations research society of Korea
    • /
    • v.17 no.1
    • /
    • pp.43-60
    • /
    • 1991
  • Consider N queues without arrivals and with m identical servers. All jobs are independent and service requirements of jobs in a queue are i.i.d. random variables. At any time only one server may be assigned to a queue and switching between queues are allowed. A unit cost is imposed per job per unit time. The objective is to minimized the expected total cost. An flow approximation model is considered and an upperbound for the percentage error of best nonswitching policies to an optimal policy is found. It is shown that the best nonswitching policy is not worse than $11\%$ of an optimal policy For the stochastic model, we consider the case in which the service requirements of all jobs are i.i.d. with an exponential distribution. A longest first policy is shown to be optimal and a worst case analysis shows that the nonswitching policy which starts with the longest queues is not worse than $11\%$ of the optimal policy.

  • PDF

Design and Evaluation of an Adaptive Reservation-Based Piggybacking Algorithm for Video Servers (비디오 서버를 위한 적응적 예악기반 피기백킹 알고리즘의 설계 및 평가)

  • Bae, In-Han;Lee, Gyeong-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2S
    • /
    • pp.656-665
    • /
    • 2000
  • A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests. Several approaches: batching, bridging, piggybacking are used ot reduce the I/O demand on the video server through sharing. Piggybacking is the policy for altering display rates of requests in progress fro the same object, for the purpose of merging their corresponding I/O streams into a single stream, which can serve the entire group of merged requests. In this paper, we propose a new policy called an adaptive reservation-based piggybacking that dynamically reserves the I/O stream capacity of video server for popular videos according to video server loads to immediately schedule the requests for popular videos. The performance of the proposed policy is evaluated through simulations, and is compared with that of simple piggybacking. As the result, we know that the adaptive reservation-based piggybacking provides better service probability, average waiting time and percentages saving in frames than simple piggybacking.

  • PDF

A Multi Upper Bound Access Control Model with Inheritance Attributes

  • Kim, Seok-Woo
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.162-166
    • /
    • 1997
  • A message server have two basic functionalities, a server role for processing the processing the user environment as well as an entity role for transferring message to other entity in message system environment. The user who is going to send and receive his important information really wants to keep his own security requests. To satisfy this requirement, message server must be enforced by two seperated security policies- one for message processing security policy under department's computer working environment, the other for send/receive security policy under message system's communication path environment. Proposed access control model gurantees the user's security request by combining constrained server access control and message system access control with multi upper bound properties which come from inheritance attributes of originating user security contexts.

  • PDF

A Frame Skipping Transfer Policy for Server based on Clients Dynamic Buffer Control Signal (클라이언트의 동적 버퍼 제어 신호에 의한 서버의 프레임 생략 전송 정책)

  • Jeong, Hong-Seup;Park, Kyoo-Seok
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.677-684
    • /
    • 2003
  • Most policies of VOD services are mainly studied about server system, and make no touch on clients buffer stabilization which is the basis of guaranteeing playback quality and playing without cut off. In this paper, we proposed a skipping frame transfer policy that can sending dynamic buffer control signal to server in accordance with clients buffer state of starvation or overrun, and server transfers a skipped frame to client after receive the control signal. And through a simulation, we show the suggested policy is more efficiency on playback quality by buffer stabilization which is by preventing loss and miss for receiving frame due to grow worse client buffer state.

Design and Evaluation of a Reservation-Based Hybrid Disk Bandwidth Reduction Policy for Video Servers (비디오 서버를 위한 예약기반 하이브리드 디스크 대역폭 절감 정책의 설계 및 평가)

  • Oh, Sun-Jin;Lee, Kyung-Sook;Bae, Ihn-Han
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.523-532
    • /
    • 2001
  • A Critical issue in the performance of a video-on-demand system is the required I/O bandwidth of the Video server in order to satisfy clients requests, and it is the crucial resource that may cause delay increasingly. Several approaches such as batching and piggybacking are used to reduce the I/O demand on the video server through sharing. Bathing approach is to make single I/O request for storage server by grouping the requests for the same object. Piggybacking is th policy for altering display rates of requests in progress for the same object to merge their corresponding I/O streams into a single stream, and serve it as a group of merged requests. In this paper, we propose a reservation-based hybrid disk bandwidth reduction policy that dynamically reserves the I/O stream capacity of a video server for popular videos according to the loads of video server in order to schedule the requests for popular videos immediately. The performance of the proposed policy is evaluated through simulations, and is compared with that of bathing and piggybacking. As a result, we know that the reservation-based hybrid disk bandwidth reduction policy provides better probability of service, average waithing time and percentage of saving in frames than batching and piggybacking policy.

  • PDF

Waiting Time and Sojourn Time Analysis of Discrete-time Geo/G/1 Queues under DT-policy (DT-정책 하에서 운영되는 이산시간 Geo/G/1 시스템의 대기시간과 체재시간 분석)

  • Se Won Lee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.29 no.2
    • /
    • pp.69-80
    • /
    • 2024
  • In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.

A Study on the Service Control Policy of M/M/2/K Queueing System with Two Types of Customers (두 종류의 고객이 도착하는 M/M/2/K Queueing System에서의 Server 조정정책에 관한 연주)

  • 유인선;문기석
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.6 no.8
    • /
    • pp.93-103
    • /
    • 1983
  • In this paper, we study an optimal service policy of the M/M/2/K queueing system with two types of customers. The incurred costs consist of waiting cost, service cost and incurred costs consist of waiting cost, service cut and changeover cost. The changeover cost occurs when a server who assigned to serve a particular type of customers reassigned to the other types of customers. Two servers serve two types of customers who arrive to the two separate queues. The two types of customers differ in respect of their arrival rate, service rate, waiting cost, and service cost. The servers require a policy, for determining when they should change their service type, which minimizes the long run expected total cost. The policy is obtained by a Markov decision process model that consists of a finite number of states and actions. In order to find the optimal service policy, we define states and actions of the system, compute onestep transition probabilities, and apply to the successive approximations algorithm.

  • PDF

A Design Problem of a System Working at Both Primary Service and Secondary Service (주서비스와 보조서비스를 갖는 시스템 설계)

  • Kim, Sung-Chul
    • Korean Management Science Review
    • /
    • v.28 no.3
    • /
    • pp.15-29
    • /
    • 2011
  • In this paper, we consider a system working at both primary service and secondary service. A server can switch between the primary service and the secondary service or it can be assigned to secondary service as a dedicated server. A service policy is characterized by the number of servers dedicated to the secondary service and a rule for switching the remaining servers between two services. The primary service system is modelled as a Markovian queueing system and the throughput is a function of the number of servers, buffer capacity, and service policy. And the secondary service system has a service level requirement strategically determined to perform the service assigned. There is a revenue obtained from throughput and costs due to servers and buffers. We study the problem of simultaneously determining the optimal total number of servers, buffers, and service policy to maximize profit of the system subject to both an expected customer waiting time constraint of the primary service and a service level constraint of the secondary service and develop an algorithm which can be successfully applied with the small number of computations.