[Nrg-l] NRG Presentation: Feb/2/2009
best at cs.bu.edu
Wed Jan 28 14:57:00 EST 2009
Apologies, my response below was meant to be to a different message. Blame it on outlook :( i.e., Mon 4pm works for me...
From: Azer Bestavros <best at cs.bu.edu>
Sent: Wednesday, January 28, 2009 2:37 PM
To: Jorge Londono <jmlon at cs.bu.edu>; nrg-l at cs.bu.edu
Subject: Re: [Nrg-l] NRG Presentation: Feb/2/2009
AARRGH! It turns out it is Gabe's proposal defense at 11 and I am his second reader....
Shanghua: What other times work for you either at BU or MS?
From: Jorge Londono <jmlon at cs.bu.edu>
Sent: Wednesday, January 28, 2009 1:15 PM
To: nrg-l at cs.bu.edu
Subject: [Nrg-l] NRG Presentation: Feb/2/2009
After reviewing the time availability, we concluded the best time for this semester is Mondays from 4:00pm - 5:30pm, back to our traditional schedule.
To get us started this semester I will be making the following presentation next Monday:
A Two-Tiered On-Line Server-Side Bandwidth Reservation Framework for the Real-Time Delivery of Multiple Video Streams
Jorge M. Londoño and Azer Bestavros
The advent of virtualization and cloud computing technologies necessitates the development of effective mechanisms for the estimation and reservation of resources needed by content providers to deliver large numbers of video-on-demand (VOD) streams through the cloud. Unfortunately, capacity planning for the QoS-constrained delivery of a large number of VOD streams is inherently difficult as VBR encoding schemes exhibit significant bandwidth variability. In this paper, we present a novel resource management scheme to make such allocation decisions using a mixture of per-stream reservations and an aggregate reservation, shared across all streams to accommodate peak demands. The shared reservation provides capacity slack that enables statistical multiplexing of peak rates, while assuring analytically bounded frame-drop probabilities, which can be adjusted by trading off buffer space (and consequently delay) and
bandwidth. Our two-tiered bandwidth allocation scheme enables the delivery of any set of streams with less bandwidth (or equivalently with higher link utilization) than state-of-the-art deterministic smoothing approaches. The algorithm underlying our proposed framework uses three per-stream parameters and is linear in the number of servers, making it particularly well suited for use in an on-line setting. We present results from extensive trace-driven simulations, which confirm the efficiency of our scheme especially for small buffer sizes and delay bounds, and which underscore the significant realizable bandwidth savings, typically yielding losses that are an order of magnitude or more below our analytically derived bounds.
Link to the paper:
Hope to see you there,
More information about the Nrg-l