7,509 research outputs found

    Cooperative Caching for Multimedia Streaming in Overlay Networks

    Get PDF
    Traditional data caching, such as web caching, only focuses on how to boost the hit rate of requested objects in caches, and therefore, how to reduce the initial delay for object retrieval. However, for multimedia objects, not only reducing the delay of object retrieval, but also provisioning reasonably stable network bandwidth to clients, while the fetching of the cached objects goes on, is important as well. In this paper, we propose our cooperative caching scheme for a multimedia delivery scenario, supporting a large number of peers over peer-to-peer overlay networks. In order to facilitate multimedia streaming and downloading service from servers, our caching scheme (1) determines the appropriate availability of cached stream segments in a cache community, (2) determines the appropriate peer for cache replacement, and (3) performs bandwidth-aware and availability-aware cache replacement. By doing so, it achieves (1) small delay of stream retrieval, (2) stable bandwidth provisioning during retrieval session, and (3) load balancing of clients' requests among peers

    INTENT BASED LOAD-BALANCING FOR VOICE OVER INTERNET PROTOCOL (VOIP) ELEMENTS

    Get PDF
    Presented herein is an intelligent call distribution/load balancing solution that performs distribution based on the type of call. The solution determines the type of call based on various factors and uses reinforced learning algorithms to select the element best suited for that type of call based on call-success-ratio for a particular call type (e.g., audio/video/fax/ etc.). This eliminates call failures, call delays and improves customer satisfaction. This solution can be extended to various other details of the call like dual tone multiple frequency (DTMF), codec, payload type, etc

    Performance analysis of server selection schemes for Video on Demand servers

    Get PDF
    Web Services have gained considerable attention over the last few years. This is due to increase in use of the Internet which results in increased web traffic. Web servers find applications in E-commerce and Video-on-Demand(VoD) systems which have resulted in speedy growth of the web traffic. Therefore the concept of load balancer aimed to distribute the tasks to different Web Servers to reduce response times was introduced. Each request was assigned a Web Server decided by the load balancer in such a way that tasks were uniformly distributed among the available servers. Server selection algorithms are aimed to meet the QoS for interactive VoD.This thesis attempts to analyze the performance of FCFS, Randomized, Genetic algorithms and Heuristics algorithms for selecting server to meet the VoD requirement . Performance of these algorithms have been simulated with parameters like makespan and average resource utilization for different server models. This thesis presents an efficient heuristic called Ga-max-min for distributing the load among different servers. Heuristics like min-min and max-min are also applied to heterogeneous server farms and the result is compared with the proposed heuristic for VoD Servers. Ga-max-min was found to provide lower makespan and higher resource utilization than the genetic algorithm.Extensive simulations have been carried out by the simulator designed using MATLAB R2010a

    BIBS: A Lecture Webcasting System

    Get PDF
    The Berkeley Internet Broadcasting System (BIBS) is a lecture webcasting system developed and operated by the Berkeley Multimedia Research Center. The system offers live remote viewing and on-demand replay of course lectures using streaming audio and video over the Internet. During the Fall 2000 semester 14 classes were webcast, including several large lower division classes, with a total enrollment of over 4,000 students. Lectures were played over 15,000 times per month during the semester. The primary use of the webcasts is to study for examinations. Students report they watch BIBS lectures because they did not understand material presented in lecture, because they wanted to review what the instructor said about selected topics, because they missed a lecture, and/or because they had difficulty understanding the speaker (e.g., non-native English speakers). Analysis of various survey data suggests that more than 50% of the students enrolled in some large classes view lectures and that as many as 75% of the lectures are played by members of the Berkeley community. Faculty attitudes vary about the virtues of lecture webcasting. Some question the use of this technology while others believe it is a valuable aid to education. Further study is required to accurately assess the pedagogical impact that lecture webcasts have on student learning

    Media streams allocation and load patterns for a WebRTC cloud architecture

    Get PDF
    Web Real-Time Communication (WebRTC) is seeing a rapid rise in adoption footprint. This standard provides an audio/video platform-agnostic communications framework for the Web build-in right in the browser. The complex technology stack of a full implementation of the standard is vast and includes elements of various computational disciplines like: content delivery, audio/video processing, media transport and quality of experience control, for both P2P and Cloud relayed communications. To the best of our knowledge, no previous study examines the impact of Cloud back-end load and media quality at production scale for a media stream processing application, as well as load mitigation for Cloud media Selective Forwarding Units. The contribution of this work is the analysis and exploitation of server workload (predictable session size, strong periodical load patterns) and media bit rate patterns that are derived from real user traffic (toward our test environment), over an extended period of time. Additionally, a simple and effective load balancing scheme is discussed to fairly distribute big sessions over multiple servers by exploiting the discovered patterns of stable session sizes and server load predictability. A Cloud simulation environment was built to compare the performance of the algorithm with other load allocation policies. This work is a basis for more advanced resource allocation algorithms and media Service Level Objectives (SLO) spanning multiple Cloud entities.Peer ReviewedPostprint (author's final draft
    corecore