Is Dynamic Multi-Rate Worth the Effort?

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Multicast congestion control on many-to- many videoconferencing Xuan Zhang Network Research Center Tsinghua University, China.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
1 of 56 Idle Sense: An Optimal Access Method for High Throughput and Fairness in Rate Diverse Wireless LANs Martin HeusseFranck Rosseau Romaric GuillierAndrzej.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
1 End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey.
Performance Improvement of TCP in Wireless Cellular Network Based on Acknowledgement Control Osaka University Masahiro Miyoshi, Masashi Sugano, Masayuki.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Chapter 3: CPU Scheduling
A Comparison of Layering and Stream Replication Video Multicast Schemes Taehyun Kim and Mostafa H. Ammar.
1 Network-supported Rate Control Mechanism for Multicast Streaming Media Kiyohide NAKAUCHI, Hiroyuki MORIKAWA, and Tomonori AOYAMA, School of Engineering,
Adaptive Video Streaming Over Internet Using Dynamic Video Transcoding By Lam Ling Shun, Felix.
ADCN MURI Tools for the Analysis and Design of Complex Multi-Scale Networks Review September 9, 2009 Protocols for Wireless Networks Libin Jiang, Jiwoong.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
CS :: Fall 2003 Layered Coding and Networking Ketan Mayer-Patel.
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.
Chapter 6: CPU Scheduling
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Mutual Exclusion in Wireless Sensor and Actor Networks IEEE SECON 2006 Ramanuja Vedantham, Zhenyun Zhuang and Raghupathy Sivakumar Presented.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
A Comparison of Layering and Stream Replication Video Multicast Schemes Taehyun Kim and Mostafa H. Ammar Networking and Telecommunications Group Georgia.
Incentive-Oriented Downlink Scheduling for Wireless Networks with Real-Time and Non-Real-Time Flows I-Hong Hou, Jing Zhu, and Rath Vannithamby.
1 Flow and Congestion Control for Reliable Multicast Communication In Wide-Area Networks Supratik Bhattacharyya Department of Computer Science University.
Paper # – 2009 A Comparison of Heterogeneous Video Multicast schemes: Layered encoding or Stream Replication Authors: Taehyun Kim and Mostafa H.
An End-to-End Adaptation Protocol for Layered Video Multicast Using Optimal Rate Allocation Jiangchuan Liu, Member, IEEE, Bo Li, Senior Member, IEEE, and.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Copyright © Lopamudra Roychoudhuri
Flow and Congestion Control for Reliable Multicast Communication In Wide-Area Networks Supratik Bhattacharyya Department of Computer Science University.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Network Coding and Reliable Communications Group Modeling Network Coded TCP Throughput: A Simple Model and its Validation MinJi Kim*, Muriel Médard*, João.
Hongjie Zhu,Chao Zhang,Jianhua Lu Designing of Fountain Codes with Short Code-Length International Workshop on Signal Design and Its Applications in Communications,
Real-time Transport for Assured Forwarding: An Architecture for both Unicast and Multicast Applications By Ashraf Matrawy and Ioannis Lambadaris From Carleton.
An End-to-End Adaptation Protocol for Layered Video Multicast Using Optimal Rate Allocation Jiangchuan Liu, Member, IEEE, Bo Li, Senior Member, IEEE, and.
Puzzle You have 2 glass marbles Building with 100 floors
Solutions to Support Mobility in SDN-Based Dense Wireless Networks
CPU SCHEDULING.
UbiCrawler: a scalable fully distributed Web crawler
Topics in Distributed Wireless Medium Access Control
Rate Adaptations.
CPU Scheduling Algorithms
CIS, University of Delaware
Analyzing Security and Energy Tradeoffs in Autonomic Capacity Management Wei Wu.
System Control based Renewable Energy Resources in Smart Grid Consumer
Drum: A Rhythmic Approach to Interactive Analytics on Large Data
A Rate-Adaptive MAC Protocol for Multi-Hop Wireless Networks
Chapter 6: CPU Scheduling
CPU Scheduling G.Anuradha
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
ECE 599: Multimedia Networking Thinh Nguyen
Scheduling Algorithms in Broad-Band Wireless Networks
Chapter 6: CPU Scheduling
CCI support of TDD stations
Low-Latency Adaptive Streaming Over TCP
Taehyun Kim and Mostafa H. Ammar
Chapter 6: CPU Scheduling
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
CPU Scheduling: Basic Concepts
Module 5: CPU Scheduling
Chrysostomos Koutsimanis and G´abor Fodor
Presentation transcript:

Is Dynamic Multi-Rate Worth the Effort? Matthew Peace 04.14.04 Wireless Information Networking Group

Problem With the progression toward continuous media distribution, end systems are expected to be cooperative in determining/adapting transmission rates In a multi-rate multicast, several desirable fairness properties can be achieved

Problem A static multi-rate system may only be able to support coarse grained adaptation Using a dynamic multi-rate system might be more reasonable

Purpose of Paper To find the possible benefit of a dynamic multi-rate multicast solution with respect to inter-receiver fairness Does this gain compensate for higher implementation costs associated with a coding scheme and dynamic partitioning?

Inter-Receiver Fairness “satisfaction” of a receiver given by ui utility function, which is a function of gj (its actual rate) and theoretical fair allocation ri Optimality occurs when gj = ri

Receiver Utility Function

Inter-Receiver Fairness Goal in this system is to maximize collective satisfaction of receivers of a multicast session (sum of the utility values) Uj = Utility for set of receivers Gj is maximized when the worst receiver’s gj = ri

Inter-Receiver Fairness Where lj is the the data rate of the jth layer L = number of layers (groups) in a session N = number of receivers in a session Ri = the ith receiver ri = the theoretical fair allocation for Ri Gj = the set of receivers subscribed to layers 1 to j nj = the number of receivers in Gj gj = the cumulative data rate in Gj

Inter-Receiver Fairness US = the session Utility (sum over layers)

Protocol Issues Optimal Rate Estimation Receivers determine when to send feedback Optimal rate derived from an equation modeling long term TCP throughput Measure the Lost Rate Event Measure the Round Trip Time

Protocol Issues (Cont.) Feedback Suppression Receiver is allowed to send feedback only if it’s utility degradation (uopt – ui) exceeds a certain threshold Δ ui = uopt X (1 – αj) αj derivation Size of Gj must be taken into consideration The larger the size of Gj the higher the utility degradation must be in order to send feedback αj is a function of the number of receivers in G

Protocol Issues (Cont.) Avoiding Leave Action If a receiver calculates the theoretical rate to be less than the current receiving rate, it may leave the highest layer immediately To avoid coarse-grained quality degradation: Over a time interval T, the sender is collecting receiver feedback for each layer Each receiver calculates ri . If ri < gj a report is sent to the sender and the receiver waits for the next announcement of the sending rates Only if new rate has not been lowered to accommodate a receiver’s reported rate, then the receiver is forced to leave a group

Experiments Generation of 500 rates, with min and max rates set The inter-receiver fairness is maximized when all receivers are served optimally or

Experiments (Cont.) “Goodness” of a session determined by ratio of US to USopt

Results Single-Rate vs. Multi-rate Optimality occurs when number of layers L approaches number of receivers N, but higher number of layers causes more overhead First experiment studies the effect of increases the number of layers for a logarithmic utility function and a linear utility function

Results (Cont.) Normal Distribution of receiver rates mean = 1248kbps and varying standard deviation = 2k

Results (Cont.) Uniform Distribution with varying range [rmin, 2k X rmin]

Results (Cont.) Static Layers vs. Dynamic Layers Rmin and Rmax used to calculate predefined static layer rates and compared with situation where adaptive techniques are used on the actual distribution of the rates

Results (Cont.)

Results (Cont.) Assumed a trimodal distribution to find the rates for the static layers. Then, the effect of receivers drifting from last mode to an additional one was simulated

Results (Cont.)

Conclusions Adaptation in a multi-rate multicast mode may increase the overall satisfaction with only a few layers in an unpredictable environment, thus offsetting the cost of added complexity to the system