Difference between revisions of "Private:progress-tabrizi"
From NMSL
| Line 1: | Line 1: | ||
= Spring 2011 (RA) = | = Spring 2011 (RA) = | ||
| + | |||
| + | === Feb 15 === | ||
| + | * Prepared camera ready version of networking 2011 conference and submitted it. The submitted version has 12 pages. | ||
| + | |||
| + | * Preparing the complete results for extension of MoViD paper and combining it with MoViD work. | ||
=== Feb 8 === | === Feb 8 === | ||
Revision as of 16:24, 17 February 2011
Spring 2011 (RA)
Feb 15
- Prepared camera ready version of networking 2011 conference and submitted it. The submitted version has 12 pages.
- Preparing the complete results for extension of MoViD paper and combining it with MoViD work.
Feb 8
- Working on getting results from our work on using idle times of bandwidth. I prepared 15 video streams for the experiments. For now, I assumed 10 are prerecorded and 5 are live. Results show that using slack times for sending data in advance results in significant improvement (even without dropping quality layers). I have added one figure showing the results compared to SMS (it is added to the previous report). I am working on adding other results (energy saving, quality, min/max dropped frames)
- Worked on camera ready version of Networking 11. In sec. 2, I added information about SMS compared to our algorithm and also about our MoViD paper and its relation to our work. In sec. 4.1 I added explanation about having fixed buffer capacity for all receivers and also added some clarifications on the key idea of our algorithm. Also corrected the typos on different sections of the paper.
Feb 1
- Working on analysis of results of ADT algorithm, based on the aggregate of average bit rate, aggregate of instantaneous bit rate, and average buffer level of receivers.
- Formulated to solution for using slack times in MoViD paper. Now working on the evaluation of the solution.
Jan 25
- Working on the extension of MoViD paper.
- Current report can be accessed here:
Jan 18
- Updated the algorithm and the proof of correctness and having no underflow instances
- Change to the algorithm is not significant, but makes it stronger and also helps us prove the correctness
- Some of the results need to be updated again based on the latest changes
- Current report could be accessed from here: nsl/students/tabrizi/reports/doc_tr/manuscript.pdf
Jan 11
- Preparing the updated results for the paper, also adding the proofs
Jan 4
- Working on theoretical proofs for ADT algorithm
Fall 2010 (RA)
Designing and implementing algorithm for video streaming results submitted to Neworking11
Extending the work for scalable video: implementation is done - needs more experiments and evaluation
Summer 2010 (RA)
Designing and implementing algorithm for scalable video streaming
submitted: MoViD10
