Cooperative Mobile Live Streaming Considering Neighbor Reception SPEAKER: BO-YU HUANG ADVISOR: DR. HO-TING WU 2015/10/15 1.

Slides:



Advertisements
Similar presentations
MicroCast: Cooperative Video Streaming on Smartphones Lorenzo Keller, Anh Le, Blerim Cic, Hulya Seferoglu LIDS, Christina Fragouli, Athina Markopoulou.
Advertisements

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Adobe’s Real Time Messaging Protocol
Speaker: Li-Wei Wu Advisor: Dr. Kai-Wei Ke 1.  Introduction  Coolstreaming  Proposed system  Simulation  Conclusion  Reference 2.
Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.
Kangaroo: Video Seeking in P2P Systems Xiaoyuan Yang †, Minas Gjoka ¶, Parminder Chhabra †, Athina Markopoulou ¶, Pablo Rodriguez † † Telefonica Research.
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
1 Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks INFOCOM 2001 Michael Barry, Andrew T. Campbell Andras Veres.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Rate Distortion Optimized Streaming Maryam Hamidirad CMPT 820 Simon Fraser Univerity 1.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
1 Adaptive Live Broadcasting for Highly-Demanded Videos Hung-Chang Yang, Hsiang-Fu Yu and Li-Ming Tseng IEEE International Conference on Parallel and Distributed.
Improving ISP Locality in BitTorrent Traffic via Biased Neighbor Selection Ruchir Bindal, Pei Cao, William Chan Stanford University Jan Medved, George.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
1 Study on Adaptation of CDN Request-Routing to Scalable Conference System Toshiyuki KAWASAKI* Koji OKAMURA** * Graduate School of Information Science.
Wireless Switch Protocol 課程 : 行動計算 學號 :M 學生 : 陳德翰.
Study of the Relationship between Peer to Peer Systems and IP Multicasting From IEEE Communication Magazine January 2003 學號 :M 姓名 : 邱 秀 純.
1 Proceeding the Second Exercises on Computer and Systems Engineering Professor OKAMURA Laboratory. Othman Othman M.M.
Adaptive flow control via Interest Aggregation in CCN by Dojun Byun, Byoung-joon, Myeong-Wuk Jang Samsung Electronics, Advanced Institute of Technology.
Characteristics of QoS-Guaranteed TCP on Real Mobile Terminal in Wireless LAN Remi Ando † Tutomu Murase ‡ Masato Oguchi † † Ochanomizu University,Japan.
Hamida SEBA - ICPS06 June 26 th -29 th Lyon France 1 ARMP: an Adaptive Routing Protocol for MANETs Hamida SEBA PRISMa Lab. – G2Ap team
Chun-Yuan Chang, Cheng-Fu Chou * and Ming-Hung Chen Presenter: Prof. Cheng-Fu Chou National Taiwan University
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.
DELAYED CHAINING: A PRACTICAL P2P SOLUTION FOR VIDEO-ON-DEMAND Speaker : 童耀民 MA1G Authors: Paris, J.-F.Paris, J.-F. ; Amer, A. Computer.
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
A NAMED DATA NETWORKING FLEXIBLE FRAMEWORK FOR MANAGEMENT COMMUNICATION Authors: Daneil Corjuo and Rui L. Aguiar Ivan Vidal and Jamie Garcia-Reinoso Presented.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Fast Handoff for Seamless wireless mesh Networks Yair Amir, Clauiu Danilov, Michael Hilsdale Mobisys’ Jeon, Seung-woo.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Othman Othman M.M., Koji Okamura Kyushu University 1.
An Adaptive, High Performance MAC for Long- Distance Multihop Wireless Networks Presented by Jason Lew.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Wireless communications and mobile computing conference, p.p , July 2011.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Fast Join and Synchronization Schema in the IEEE e MAC
A Buffer-Aware HTTP Live Streaming Approach for SDN-Enabled 5G Wireless Networks Speaker: Bo-Yu Huang Advisor: Dr. Ho-Ting Wu Date: 2015/04/15 1.
Proposal of OmniRAN architecture for Data Offload Service through Wireless P2P Networks Document Number: omniran Date Submitted:
A+MAC: A Streamlined Variable Duty-Cycle MAC Protocol for Wireless Sensor Networks 1 Sang Hoon Lee, 2 Byung Joon Park and 1 Lynn Choi 1 School of Electrical.
Muhammad Niswar Graduate School of Information Science
Application Level QoS in Multimedia Peer-to-Peer (P2P) Networks Alireza Goudarzi Nematiy and Makoto Takizawa¤ Tokyo Denki University
Daniel A. G. Manzato and Nelson L. S. da Fonseca Institute of Computing, State University of Campinas Campinas, Brazil speaker: 吳麟佑.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
RM-MAC: A Routing-Enhanced Multi-Channel MAC Protocol in Duty-Cycle Sensor Networks Ye Liu, Hao Liu, Qing Yang, and Shaoen Wu In Proceedings of the IEEE.
Video Streaming Transmission Over Multi-channel Multi-path Wireless Mesh Networks Speaker : 吳靖緯 MA0G WiCOM '08. 4th International.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
A Cooperative ONU Sleep Method for Reducing Latency and Energy Consumption of STA in Smart-FiWi Networks Speaker: Chia-Chih Chien Advisor: Dr. Ho-Ting.
On the Design of Robust and Adaptive IEEE Multicast Services for Video Transmissions Speaker: Bo-Yu Huang Advisor: Dr. Ho-Ting Wu Date: 2014/12/23.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
DR-MPCP: Delayed REPORT message for MultiPoint Control Protocol in EPON Speaker: Chia-Chih Chien Advisor: Dr. Ho-Ting Wu Date: 2015/11/26 1.
An Efficient Implementation of File Sharing Systems on the Basis of WiMAX and Wi-Fi Jingyuan Li, Liusheng Huang, Weijia Jia, Mingjun Xiao and Peng Du Joint.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
MAC Protocols for Sensor Networks
Presenter: Kuei-Yu Hsu Advisor: Dr. Kai-Wei Ke 2013/9/30 Performance analysis of video streaming on different hybrid CDN & P2P infrastructure.
Mohsen Riahi Manesh and Dr. Naima Kaabouch
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Accelerating Peer-to-Peer Networks for Video Streaming
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
ECF: an MPTCP Scheduler to Manage Heterogeneous Paths
Scheduling Mechanism in IEEE e
Speaker: Po-Hung Chen Advisor: Dr. Ho-Ting Wu 2016/10/12
Presentation transcript:

Cooperative Mobile Live Streaming Considering Neighbor Reception SPEAKER: BO-YU HUANG ADVISOR: DR. HO-TING WU 2015/10/15 1

Outline Introduction Related Work Problems CSANR Simulation Result Conclusion Reference 2

Introduction In live streaming service, two delivery systems are mainly used, Client-Server (C/S) and Peer-to- Peer (P2P) system. A video content data is sliced into a sequence of fragments, called chunk, and delivered to user watching the video. In C/S system, The cost for provider to delivers video contents increases, if there are too many users requesting it. In P2P system, a user is called a peer, and plays a roll of not only receiver but also sender. 3

Introduction(Cont.) With the spread of smartphones, a demand for mobile live streaming system is increasing. However, the existing live streaming services are not sufficient for mobile. Different from peer in wired-network, Mobile peers have some characteristics should be considered: mobility and erratic bandwidth. Therefore, this paper propose CSANR (Chunk Select method Adaptive to Neighbor Reception), a method that enables peers change usage of their own cellular links adaptively by considering the reception of their neighbor peers. 4

Related Work A. P2P Live Streaming in Mobile Environment B. Cellular-WiFi Hybrid Network 5

P2P Live Streaming in Mobile Environment Mobile peer have some characteristics that should be considered. Mobility: Different from wired-network, mobile peer can move anywhere while watching a video content. Due to peer mobility, the topology of P2P network including mobile peer changes dynamically. Erratic bandwidth: Mobile peers download chunks by using their own cellular links. However, cellular bandwidth is easy to be affected by their position and environment. Even if there is a good area for communication, cellular bandwidth often decreases by the interference of other electric waves called Multi-path fading. 6

Cellular-WiFi Hybrid Network Mobile peer can use two communications in parallel, its own cellular link and Wi-Fi communication with other mobile peers. 7

Problems Using Cellular-WiFi hybrid network, mobile peers can enjoy watching live video contents more comfortably because of their chunk exchanges using Wi-Fi communication. However, there are some problems should be solved to apply it to the real environment.  Static Scheduling  Stochastic Chunk Selection 8

Static Scheduling In real environment, the case that all peer watching the video content keep staying at the place is rare. And, because of peer’s mobility, cellular bandwidth of peers changes dynamically. Static scheduling method is effective when the users watching same video content together are already determined, but real-time scheduling are more effective in other case. 9

Stochastic Chunk Selection In live streaming, all peer’s video progress are same and each peer selects chunks near from its video progress. That’s why, by using stochastic chunk selection in live streaming, it happens frequently that peers select same chunk. 10

Problems(Cont.) Cellular bandwidth dynamically changes in real environment. By decrease of peer’s cellular bandwidth, timeout chunk occurs frequently. Existing method, probability of chunk selection based on only number of peers, not considering the neighbor peer’s cellular bandwidth. 11

CSANR We propose CSANR (Chunk Select method Adaptive to Neighbor Reception), a method that changes the usage of peer’s own cellular link adaptively by considering the reception of the neighbor peers. In our method, peers can use their own cellular links and Wi-Fi communication between peers in parallel. Peers use cellular network to access video server and download chunks to be selected, and peers communicate with each other and exchange their information using Wi-Fi communication. 12

Scheduling Based on Offer-Select Method CSANR use Offer-Select method to exchange peer information. Offer-Select method is for chunk scheduling in P2P live streaming system. 13

Exchanging Offer Message In the proposed method, peers send offer message to the neighbor peers. Exchanging this message each other periodically enables peers perform real-time scheduling. Offer message includes peer information: IP address of sender and receiver, chunk ID that the peer select to download using its own cellular link, and a random number to avoid collisions of chunk selection. 14

Chunk Scheduling After exchanging peer information by sending an offer message to the neighbors, each peer determines which chunk it receives from whom. Chunks can be obtained through Wi-Fi communications only if the chunks are offered by the neighbor peers. When any neighbor peer does not offer the chunk, the peer has to download the chunk using its own cellular link, regardless of previous decision. 15

Rescheduling Mechanism In the chunk scheduling based on Offer-Select method, there is the case frequently that peer selects the chunks that is selected by the neighbor peers. To avoid this collision, CSANR have Rescheduling mechanism. CSANR offer message has random number to avoid collision of chunk selection between peers. 16

Sending Select Message By exchanging peer information, each peer can decide which communication can be used to get the chunk ready to be delivered, cellular or Wi-Fi communication. To receive the chunks offered by the neighbor peers, the peer sends a request packet to the neighbor peer, select message. The requested peer sends its chunks in response to the select message. 17

Reception by Overhearing In wireless communication, each peer can receive the packets that are sent to other peer. This is called overhear. Using overhear, each peer receives the chunk they do not have whether the chunk are sent to them or not. In proposed method, peers memorize IDs of the chunks which they sent in the past. If they are requested the chunk already sent, they do not respond to the request. 18

Dynamic Stochastic Chunk Selection To reduce usage of cellular bandwidth, each peer stochastically selects some chunks to download using its own cellular link based on chunk selection probability, p. This chunk selection probability has a influence on cellular traffic usage. If this probability is too high, each peer downloads most of the chunks by self using its own cellular link. If this probability is too low, there will be the chunks that any peer does not select to download by itself. We named this isolated chunk, timeout chunk. 19

Dynamic Stochastic Chunk Selection(Cont.) Suppose n users participate same Wi-Fi network and watch the same live video content. In stochastic selection, if each peer selects chunk without considering the neighbor reception, the most suitable value of p can be calculated using n. However, eq. (1) does not consider the changes of the neighbor peers' cellular bandwidth. CSANR calculates p dynamically by considering the neighbor reception. 20

Dynamic Stochastic Chunk Selection(Cont.) When Video rate is v[Kbps] and chunk size is Lchunk[Kbit], the number of the chunks delivered in tw second, Nchunk is as follows. If n peers cooperate and schedule Nchunk(tw) chunks, the number of chunks expected to be offered by the neighbor peers in time t, Oexpected(t), can be calculated using n and Eq. (2). 21

Dynamic Stochastic Chunk Selection(Cont.) Due to the frequent changes of cellular bandwidth, there can be the case that peer can not offer enough number of chunks. In Offer-Select method, each peer offers the chunks which can be downloaded. If peer’s cellular bandwidth decreases and it can not download the chunk they selected, the peer revokes its selection and these chunks are not offered. Therefore, we can presume peer’s cellular bandwidth by using number of chunks offered by the neighbor peers. 22

Dynamic Stochastic Chunk Selection(Cont.) Suppose the number of chunks that a peer is offered by the neighbor peers in time t is noffered(t). When the interval of offer message exchanging is tw, the number of chunks that were offered by the neighbor peers in the interval tw second just before that, Ooffered(t) is as follows. By using Eqs. (3) and (4), We can calculate the ratio of Ooffered(t) and Oexpected(tw). 23

Dynamic Stochastic Chunk Selection(Cont.) nv represents the value of the neighbors which is calculated by considering the neighbor peer’s cellular bandwidth. According to nv, each peer can regard that it cooperates with nv peers. Therefore, we can calculate chunk selection probability p in time t, p(t) using Eq. (1). 24

Dynamic Stochastic Chunk Selection(Cont.) In CSANR, each peer always calculates p(t) when it performs chunk scheduling. 25

Simulation Result We assume a full mesh topology, which all peers can communicate with each other directly by Wi-Fi connection. This topology is already formed before watching a video content. Each chunk must be exchange within the limited time, called play-out delay, to prevent the delay of video progress. After this time limit, each chunk can not be requested. We compare our method to the Cellular-WiFi live streaming system using fixed p(t) for chunk selection, which is labeled existing method. 26

Simulation Result(Cont.) Simulation parameters are shown in Table I. 27

Reduction of Cellular Traffic Figure 9 shows that the ratio of occurrence of timeout chunk. 28

Reduction of Cellular Traffic(Cont.) As shown in Fig. 10, CSANR can reduce unnecessary cellular traffic to occur with timeout chunks about 50% compared with the existing method. 29

Influences of the Changes of Cellular Bandwidth In order to confirm that CSANR chunk scheduling is adaptive to the neighbor reception. We performed simulation with setting that there are two peers and only peer 1’s cellular bandwidth changes. 30

Influences of the Changes of Cellular Bandwidth(Cont.) Figure 11 shows that chunk availability for each peer, the video quality each peer actually watched. 31

Influences of the Changes of Cellular Bandwidth(Cont.) Cellular usage of each peer is shown in Fig. 12. Cellular bandwidth usage means the ratio of the cellular usage in the video rate. For example, a peer is downloading 0.5Mbps data and video rate is 1Mbps, this value is 50%. 32

Influences of Difference of Cellular Bandwidth Resources Figure 13 shows the average of chunk availability in each value of ρ. 33

Conclusion In this paper, we proposed CSANR, a method enables peers change usage of their own cellular links adaptively by considering the reception of the neighbor peers. If the bandwidth of the peers decreases suddenly, CSANR can keep their chunk scheduling efficient. We evaluated our proposal method through network simulation. The simulation results show that CSANR can reduce increase of traffic occur with timeout chunk, and if the cellular bandwidth of the neighbor peers decreased, peer can be aware it and adjust its usage of cellular link adaptively. 34

Reference HATAKEYAMA, Sho; SAKATA, Yuji; SHIGENO, Hiroshi. Cooperative Mobile Live Streaming Considering Neighbor Reception. In: Advanced Information Networking and Applications (AINA), 2014 IEEE 28th International Conference on. IEEE, p