114 research outputs found

    Architecture for Cooperative Prefetching in P2P Video-on- Demand System

    Full text link
    Most P2P VoD schemes focused on service architectures and overlays optimization without considering segments rarity and the performance of prefetching strategies. As a result, they cannot better support VCRoriented service in heterogeneous environment having clients using free VCR controls. Despite the remarkable popularity in VoD systems, there exist no prior work that studies the performance gap between different prefetching strategies. In this paper, we analyze and understand the performance of different prefetching strategies. Our analytical characterization brings us not only a better understanding of several fundamental tradeoffs in prefetching strategies, but also important insights on the design of P2P VoD system. On the basis of this analysis, we finally proposed a cooperative prefetching strategy called "cooching". In this strategy, the requested segments in VCR interactivities are prefetched into session beforehand using the information collected through gossips. We evaluate our strategy through extensive simulations. The results indicate that the proposed strategy outperforms the existing prefetching mechanisms.Comment: 13 Pages, IJCN

    Quality of Service based Retrieval Strategy for Distributed Video on Demand on Multiple Servers

    Get PDF
    The recent advances and development of inexpensive computers and high speed networking technology have enabled the Video on Demand (VoD) application to connect to shared-computing servers, replacing the traditional computing environments where each application was having its own dedicated computing hardware. The VoD application enables the viewer to select, from a list of video files, his favorite video file and watch its reproduction at will. Early video on demand applications were based on single video server where video streams are initiated from a single server, then with the increase in the number of the clients who became interested in VoD services, the focus became on Distributed VoD architectures (DVoD) where the context of distribution may be distributed system components, distributed streaming servers, distributed media content etc.The VoD server must handle several issues in order to be able to present a successful service. It has to receive the clients’ requests and analyze them, calculate the necessary resources for each request, and decide whether a request can be admitted or not. Once the request is admitted, the server must schedule the request, retrieve the required video data and send the video data in a timely manner so that the client does not suffer data starvation in his buffer during the video reproduction. So, the overall objective of a VoD service provider is to provide a better Quality of Service (QoS). Some issues related to QoS are-efficient use of bandwidth, providing better throughput etc.One of the important issues is to retrieve the video data from the servers in minimum time and to start the playback of the video at client side with a minimum waiting time. The overall time elapsed in retrieving the video data and starting the playback is known as access time. The thesis presents an efficient retrieval strategy for a distributed VoD environment where the basic objective is to minimize the access time by maintaining the presentation continuity at the client side. We have neglected some of the network parameters which may affect the access time, by assuming a high speed network between the servers and the client. The performance of the strategy has been analyzed and is compared with the referred PAR (Play After Retrieval) strategy. Further, the strategy is also analyzed under availability condition which is a more realistic approach

    Distributed multimedia systems

    Get PDF
    A distributed multimedia system (DMS) is an integrated communication, computing, and information system that enables the processing, management, delivery, and presentation of synchronized multimedia information with quality-of-service guarantees. Multimedia information may include discrete media data, such as text, data, and images, and continuous media data, such as video and audio. Such a system enhances human communications by exploiting both visual and aural senses and provides the ultimate flexibility in work and entertainment, allowing one to collaborate with remote participants, view movies on demand, access on-line digital libraries from the desktop, and so forth. In this paper, we present a technical survey of a DMS. We give an overview of distributed multimedia systems, examine the fundamental concept of digital media, identify the applications, and survey the important enabling technologies.published_or_final_versio

    Performance analysis of a caching algorithm for a catch-up television service

    Get PDF
    The catch-up TV (CUTV) service allows users to watch video content that was previously broadcast live on TV channels and later placed on an on-line video store. Upon a request from a user to watch a recently missed episode of his/her favourite TV series, the content is streamed from the video server to the customer's receiver device. This requires that an individual flow is set up for the duration of the video, and since it is hard to impossible to employ multicast streaming for this purpose (as users seldomly issue a request for the same episode at the same time), these flows are unicast. In this paper, we demonstrate that with the growing popularity of the CUTV service, the number of simultaneously running unicast flows on the aggregation parts of the network threaten to lead to an unwieldy increase in required bandwidth. Anticipating this problem and trying to alleviate it, the network operators deploy caches in strategic places in the network. We investigate the performance of such a caching strategy and the impact of its size and the cache update logic. We first analyse and model the evolution of video popularity over time based on traces we collected during 10 months. Through simulations we compare the performance of the traditional least-recently used and least-frequently used caching algorithms to our own algorithm. We also compare their performance with a "perfect" caching algorithm, which knows and hence does not have to estimate the video request rates. In the experimental data, we see that the video parameters from the popularity evolution law can be clustered. Therefore, we investigate theoretical models that can capture these clusters and we study the impact of clustering on the caching performance. Finally, some considerations on the optimal cache placement are presented

    ATOM : a distributed system for video retrieval via ATM networks

    Get PDF
    The convergence of high speed networks, powerful personal computer processors and improved storage technology has led to the development of video-on-demand services to the desktop that provide interactive controls and deliver Client-selected video information on a Client-specified schedule. This dissertation presents the design of a video-on-demand system for Asynchronous Transfer Mode (ATM) networks, incorporating an optimised topology for the nodes in the system and an architecture for Quality of Service (QoS). The system is called ATOM which stands for Asynchronous Transfer Mode Objects. Real-time video playback over a network consumes large bandwidth and requires strict bounds on delay and error in order to satisfy the visual and auditory needs of the user. Streamed video is a fundamentally different type of traffic to conventional IP (Internet Protocol) data since files are viewed in real-time, not downloaded and then viewed. This streaming data must arrive at the Client decoder when needed or it loses its interactive value. Characteristics of multimedia data are investigated including the use of compression to reduce the excessive bit rates and storage requirements of digital video. The suitability of MPEG-1 for video-on-demand is presented. Having considered the bandwidth, delay and error requirements of real-time video, the next step in designing the system is to evaluate current models of video-on-demand. The distributed nature of four such models is considered, focusing on how Clients discover Servers and locate videos. This evaluation eliminates a centralized approach in which Servers have no logical or physical connection to any other Servers in the network and also introduces the concept of a selection strategy to find alternative Servers when Servers are fully loaded. During this investigation, it becomes clear that another entity (called a Broker) could provide a central repository for Server information. Clients have logical access to all videos on every Server simply by connecting to a Broker. The ATOM Model for distributed video-on-demand is then presented by way of a diagram of the topology showing the interconnection of Servers, Brokers and Clients; a description of each node in the system; a list of the connectivity rules; a description of the protocol; a description of the Server selection strategy and the protocol if a Broker fails. A sample network is provided with an example of video selection and design issues are raised and solved including how nodes discover each other, a justification for using a mesh topology for the Broker connections, how Connection Admission Control (CAC) is achieved, how customer billing is achieved and how information security is maintained. A calculation of the number of Servers and Brokers required to service a particular number of Clients is presented. The advantages of ATOM are described. The underlying distributed connectivity is abstracted away from the Client. Redundant Server/Broker connections are eliminated and the total number of connections in the system are minimized by the rule stating that Clients and Servers may only connect to one Broker at a time. This reduces the total number of Switched Virtual Circuits (SVCs) which are a performance hindrance in ATM. ATOM can be easily scaled by adding more Servers which increases the total system capacity in terms of storage and bandwidth. In order to transport video satisfactorily, a guaranteed end-to-end Quality of Service architecture must be in place. The design methodology for such an architecture is investigated starting with a review of current QoS architectures in the literature which highlights important definitions including a flow, a service contract and flow management. A flow is a single media source which traverses resource modules between Server and Client. The concept of a flow is important because it enables the identification of the areas requiring consideration when designing a QoS architecture. It is shown that ATOM adheres to the principles motivating the design of a QoS architecture, namely the Integration, Separation and Transparency principles. The issue of mapping human requirements to network QoS parameters is investigated and the action of a QoS framework is introduced, including several possible causes of QoS degradation. The design of the ATOM Quality of Service Architecture (AQOSA) is then presented. AQOSA consists of 11 modules which interact to provide end-to-end QoS guarantees for each stream. Several important results arise from the design. It is shown that intelligent choice of stored videos in respect of peak bandwidth can improve overall system capacity. The concept of disk striping over a disk array is introduced and a Data Placement Strategy is designed which eliminates disk hot spots (i.e. Overuse of some disks whilst others lie idle.) A novel parameter (the B-P Ratio) is presented which can be used by the Server to predict future bursts from each video stream. The use of Traffic Shaping to decrease the load on the network from each stream is presented. Having investigated four algorithms for rewind and fast-forward in the literature, a rewind and fast-forward algorithm is presented. The method produces a significant decrease in bandwidth, and the resultant stream is very constant, reducing the chance that the stream will add to network congestion. The C++ classes of the Server, Broker and Client are described emphasizing the interaction between classes. The use of ATOM in the Virtual Private Network and the multimedia teaching laboratory is considered. Conclusions and recommendations for future work are presented. It is concluded that digital video applications require high bandwidth, low error, low delay networks; a video-on-demand system to support large Client volumes must be distributed, not centralized; control and operation (transport) must be separated; the number of ATM Switched Virtual Circuits (SVCs) must be minimized; the increased connections caused by the Broker mesh is justified by the distributed information gain; a Quality of Service solution must address end-to-end issues. It is recommended that a web front-end for Brokers be developed; the system be tested in a wide area A TM network; the Broker protocol be tested by forcing failure of a Broker and that a proprietary file format for disk striping be implemented

    Channel Allocation for Smooth Video Delivery over Cognitive Radio Networks

    Get PDF
    Video applications normally demand stringent quality-of-service (QoS) for the high quality and smooth video playback at the receiver. Since the network is usually shared by multiple applications with diverse QoS requirements, QoS provisioning is an important and difficult task for the efficient and smooth video delivery. In the context of cognitive radio (CR) networks, as the secondary or unlicensed users share a pool of bandwidth that is temporarily being unused by the primary or licensed users, there is an inevitable interference between the licensed primary users and the unlicensed CR devices. As a result, efficient and smooth video delivery becomes even more challenging as the channel spectrum is not only a precious resource, but also much more dynamic and intermittently available to secondary users. In this thesis, we focus on the provision of guaranteed QoS to video streaming subscribers in CR network. In video streaming applications, a playout buffer is typically deployed at the receiver to deal with the impact of the network dynamics. With different buffer storage, users can have different tolerance to the network dynamics. We exploit this feature for channel allocation in CR network. To this end, we model the channel availability as an on-off process which is stochastically known. Based on the bandwidth capacity and the specific buffer storage of users, we intelligently allocate the channels to maximize the overall network throughput while providing users with the smooth video playback, which is formulated as an optimization framework. Given the channel conditions and the video packet storage in the playout buffer, we propose a centralized scheme for provisioning the superior video service to users. Simulation results demonstrate that by exploiting the playout buffer of users, the proposed channel allocation scheme is robust against intense network dynamics and provides users with the elongated smooth video playback

    On design of a scalable video data placement strategy for supporting a load balancing video-on-demand storage server.

    Get PDF
    by Kelvin Kwok-wai Law.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 66-68).Abstract --- p.iAcknowledgments --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Background --- p.1Chapter 1.2 --- Motivation --- p.2Chapter 1.3 --- Scope --- p.3Chapter 1.4 --- Dissertation Outline --- p.4Chapter 2 --- Background and Related Researches --- p.6Chapter 2.1 --- Interactive Services --- p.6Chapter 2.2 --- VOD Architecture --- p.7Chapter 2.3 --- Video Compression --- p.10Chapter 2.3.1 --- DCT Based Compression --- p.11Chapter 2.3.2 --- Subband Video Compression --- p.12Chapter 2.4 --- Related Research --- p.14Chapter 3 --- Multiple Resolutions Video File System --- p.16Chapter 3.1 --- Physical Disk Storage System --- p.16Chapter 3.2 --- Multi-resolution Video Data Placement Scheme --- p.17Chapter 3.3 --- Example of our Video Block Assignment Algorithm --- p.23Chapter 3.4 --- An Assignment Algorithm for Homogeneous Video Files --- p.26Chapter 4 --- Disk Scheduling and Admission Control --- p.33Chapter 4.1 --- Disk Scheduling Algorithm --- p.33Chapter 4.2 --- Admission Control --- p.40Chapter 5 --- Load Balancing of the Disk System --- p.43Chapter 6 --- Buffer Management --- p.49Chapter 6.1 --- Buffer Organization --- p.49Chapter 6.2 --- Buffer Requirement For Different Video Playback Mode --- p.51Chapter 7 --- Conclusions --- p.63Bibliography --- p.6

    WIC midwintermeeting on IP-television (IP-TV):proceedings of a one-day workshop, Eindhoven, January 19, 2007

    Get PDF

    Potential markets for advanced satellite communications

    Get PDF
    This report identifies trends in the volume and type of traffic offered to the U.S. domestic communications infrastructure and extrapolates these trends through the year 2011. To describe how telecommunications service providers are adapting to the identified trends, this report assesses the status, plans, and capacity of the domestic communications infrastructure. Cable, satellite, and radio components of the infrastructure are examined separately. The report also assesses the following major applications making use of the infrastructure: (1) Broadband services, including Broadband Integrated Services Digital Network (BISDN), Switched Multimegabit Data Service (SMDS), and frame relay; (2) mobile services, including voice, location, and paging; (3) Very Small Aperture Terminals (VSAT), including mesh VSAT; and (4) Direct Broadcast Satellite (DBS) for audio and video. The report associates satellite implementation of specific applications with market segments appropriate to their features and capabilities. The volume and dollar value of these market segments are estimated. For the satellite applications able to address the needs of significant market segments, the report also examines the potential of each satellite-based application to capture business from alternative technologies
    corecore