Distributed Schedule Management in the Tiger Video Fileserver

02/2004; DOI: 10.1145/268998.266692
Source: CiteSeer

ABSTRACT Tiger is a scalable, fault-tolerant video file server constructed from a collection of computers connected by a switched network. All content files are striped across all of the computers and disks in a Tiger system. In order to prevent conflicts for a particular resource between two viewers, Tiger schedules viewers so that they do not require access to the same resource at the same time. In the abstract, there is a single, global schedule that describes all of the viewers in the system. In practice, the schedule is distributed among all of the computers in the system, each of which has a possibly partially inconsistent view of a subset of the schedule. By using such a relaxed consistency model for the schedule, Tiger achieves scalability and fault tolerance while still providing the consistent, coordinated service required by viewers.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Due to the economic cost and good scalability, cluster-based server architecture is used for VOD services. This server consists of a front-end node and multiple backend nodes. In this server architecture, backend nodes are added simply to support large-scale on-demand clients. However, as the number of backend nodes increases, the possibility of backend node failure also increases. A backend node fault not only degrades the quality of serviced streaming media but also decreases the number of streams supported in the VOD server. For successful VOD service, even if a backend node enters a fault state, the streaming service in progress should be re-continued after a short recovery time. As the recovery strategy, when legacy RAID methods are applied to cluster-based VOD servers, the excessive internal network traffic between the backend nodes causes performance degradation. In addition, the backend nodes demonstrate inefficient CPU utilization for the recovery process. In this paper, to address these problems, a new fault recovery strategy is proposed based on the pipeline computing concept. The proposed method not only distributes the network traffic generated from the recovery operations but also makes efficient use of the CPU time available in the backend nodes. Based on these advantages, even if the cluster-based server has a backend node that fails, the proposed method provides more QoS streams compared to the existing recovery method. In addition, since the proposed method needs a very short recovery time, the streaming services in progress are sustained without degradation of media quality.
    International Journal of Parallel Programming 01/2009; 37:175-194. · 0.40 Impact Factor
  • The Kips Transactions:partc. 01/2009;
  • [Show abstract] [Hide abstract]
    ABSTRACT: We report on the design, implementation of a non equal scheme in streaming media data storage. According to the characteristics of the streaming media and considering the human beings usage, our scheme combines n-way mirroring and erasure-coding together to storage streaming media data. It is make good tradeoffs between system fault tolerance and sufficient quality of service streams. The system has the optimal storage efficiency and the remarkably fault-tolerant capability. At last the design of the non-equal streaming media data cluster storage system is introduced in detail, and an intensive performance evaluation study on it is performed.


1 Download
Available from