Rate-distortion optimized video peer-to-peer multicast streaming
|
|
- Erica Richards
- 6 years ago
- Views:
Transcription
1 Rate-distortion optimized video peer-to-peer multicast streaming Invited Paper Eric Setton, Jeonghun Noh and Bernd Girod Information Systems Laboratory, Department of Electrical Engineering Stanford University, Stanford, CA , USA {esetton, jhnoh, ABSTRACT In live peer-to-peer multicast streaming a source distributes a multimedia file to a large population of hosts by making use of their forwarding capacity rather than relying on costly dedicated media servers. Due to the dynamic nature of the hosts which may disconnect at any time, a robust control protocol is needed to maintain connectivity between the peers. To avoid playout interruptions, the control plane robustness needs to be reproduced at the application. This work analyzes the gains that video coding and prioritized packet scheduling at the application layer can bring to the overall streaming performance. A rate-distortion model which predicts end-to-end video quality in throughput limited environments is used to determine the minimal amount of over-provisioning necessary to avoid self-inflicted congestion. The video stream transmitted by the source contains H.264 SP and SI frames, which are used to adaptively stop error propagation due to packet loss. Distortion-optimized retransmission requests are issued by receiving hosts to recover the most important missing packets while limiting the induced congestion. Experiments for several hundred hosts simulated in NS-2 illustrate the benefits of the different approaches. Categories and Subject Descriptors C.2 [Computer-communication networks]: Distributed systems General Terms Design, Performance Keywords Peer-to-peer, video streaming (Produces the permission block, copyright information and page numbering). For use with ACM PROC ARTICLE- SP.CLS V2.6SP. Supported by ACM. 1. INTRODUCTION As IP multicast is not universally supported, distribution of media streams in the public Internet to a large audience (multicasting) is typically realized by a large number of unicast connections. If the maximum number of streams of an individual media server (typically between a few hundred and a few thousand) is exceeded, additional server capacity must be provided by a suitable content-delivery infrastructure, e.g., in the form of a network of replication servers. Peer-to-peer (P2P) multicasting is an elegant alternative in which each end-host may act as a potential server for other clients. This avoids dedicated replication servers altogether. The approach is self-scaling, as the number of peer servers and peer clients increases at the same rate, hence it avoids the bottleneck of a central server (or dedicated replication server). The approach, in principle, would allow a highly dynamic support of changing multicast demand at very low cost. The major challenge, however, is the complete lack of performance guarantees in the P2P network. Peer nodes might be turned off or disconnected at any time without prior notice, while other nodes join or re-join. Such a highly unreliable network fabric poses a major difficulty for media streaming. A recent study based on statistics collected over the Internet reveals that enough bandwidth is available for peer-to-peer streaming even on a large scale [11]. This is also reflected in analysis collected over real implementations of peer-to-peer streaming systems [3][12]. The stability of the system which is necessary to provide a satisfactory user experience largely depends on the design of the protocol. To gain robustness and possibly aggregate data rate, path diversity should be attained by distributing streams across a sufficiently large number of complementary multicast trees. Individual nodes are important nodes near the top in some multicast tree, but near the bottom and less important in others, thus avoiding single points of failure in the node dependency graph. In the aggregate, the uplink and the downlink data rates of the clients for P2P multicasting are the same. With carefully designed diverse multicast trees, this balance can be attained for each individual peer node as well. Although the control protocol is essential to provide efficient means of building and maintaining multiple multicast trees, it needs to be combined with advanced multimedia (audio and video) coding and streaming solutions at the ap-
2 plication layer. State-of-the art compression which achieves better rate-distortion performance alleviates the bandwidth requirements, while error resilient streaming techniques may improve the received media quality, as in [8], where path diversity is associated with multiple description coding (MDC). The purpose of the this work is to show the benefits on a video peer-to-peer multicast streaming system of video coding, adaptive streaming and optimized packet scheduling. We believe the overall system performance can be greatly improved by using efficient single-description coding techniques and achieving the required robustness through distortion-optimized packet scheduling. In the next section, we describe the control protocol which builds and maintains multiple multicast trees to broadcast a video stream from a source to a set of peers. In Sec.3, we make use of a video distortion model, previously proposed in [10], to predict the received video quality when a video stream is sent from multiple throughput-limited senders to a receiver at different rates. The model is used to determine the amount of over-provisioning required to limit the congestion created between end-hosts. The single description video encoding contains the new picture types SP and SI introduced in the latest video coding standard H.264 [4]. These switching picture types can be send adaptively stop error propagation in the case of transmission errors. In Sec.4 we will characterize the bit rate saving achieved by using SP and SI frames compared to traditional video transmission based on I and P frames. In the last part of the paper, we focus on retransmission scheduling from a receiving host to its ancestors. Different from network-level multicasting, the incorporation of application level retransmission requests into P2P multicasting is possible without feedback implosion, since the fan-out of each individual node is small. We describe in Sec.5, how to schedule retransmissions from the receiver to maximize its decoded video quality while limiting the incurred network congestion. 2. OVERLAY MULTICAST PROTOCOL The control protocol enables a video source to distribute a video stream to a population of hosts via P2P multicasting. The video source peer and other peers are connected via multiple trees which are constructed dynamically by the protocol. The source is the root of all trees and the trees are built independently. The branches of each tree connect a host to its descendants. These links are virtual tunnels which hide the underlying physical network topology. The video stream is distributed evenly over the different trees. Hence, peers need to join each of the multiple trees to decode and play out the video successfully. Our simulations are based on a moderate size network of a few hundred nodes, which resembles a large private intranet or a campus network, an example of which is shown on Fig.1. We make the following simplifying assumptions: the control and transmission protocol is implemented over the UDP/IP protocol stack and we ignore any Network Address Translator or firewall issue which may limit the connectivity; the hosts have heterogeneous but fixed upload bandwidth which they have measured and know accurately. Although these problems need to be addressed for a real Internet implementation (see e.g. [3]), they are not directly relevant to Figure 1: Example of network topology used for simulation. the scope of this paper. Besides accepting new peers, the protocol maintains the trees when peers leave or are disconnected during the session. A peer may leave ungracefully due to network shutdown or system failure. To keep the descendants of the peer connected, hosts need to monitor the state of their ancestors and may decide to rejoin if they detect traffic interruptions. Our control protocol is completely distributed, except for an approximate list of connected peer maintained at the source. 2.1 Joining Each joining host discovers the address of the source of the video stream by a directory service such as a website and contacts this peer to obtain a list of hosts randomly chosen among connected members. The joining peer contacts all the members of the list and waits for replies. The hosts determines a candidate parent for each tree. If the candidate parent has enough available bandwidth at the time of the request, it accepts the host and starts forwarding video packets to him. This 6-way handshaking join process is common in peer-to-peer multicast protocols. Parents are selected based on their available bandwidth and on the delay in the response which gives a coarse roundtrip-time estimate. To make use of path diversity and reduce multiple tree failure due to a common parent, different parents whenever it is possible. Once a peer is connected, it will inform its parents of its presence by transmitting periodic hello messages. These messages are also used to propagate topology information such as the subtree size of a peer. Reception of a hello message generates an immediate response. This reply is intended to confirm the parent s presence. 2.2 Node disconnection Ungraceful leaves occur when a peer leaves the group without notice which may cause disconnection of the peer s descendants from the group. When a host leaves, its children detect missing video packets and/or missing hello replies. Once the leave is detected, hosts will try to use extra links, maintained in parallel of the multicast trees, to recover connectivity. If this fast recovery mechanism fails, the peer has
3 to contact the source to get a new list of candidate parents. While the host reconnects, retransmission requests are issued over the other multicast trees to recover missing video packets. Extra links to potential parents are maintained by messages exchanged periodically. The list is obtained when the source peer replies to the initial join request. After a host joins the different multicast trees, it keeps the list of remaining available hosts to construct a pool of extra links. If the number of hosts in the pool falls below a certain threshold the list is updated using a gossip algorithm. Extra links are not reserved resources but do indicate which hosts are available for potential reconnection. Child leave detection is less influential to the overall performance because late detection of a child leave only means temporary waste of the local network bandwidth. Since the penalty of false child leave detection is high, a longer time interval is allowed before a child leave is detected. When a child leaves, its parent will stop forwarding video packets by removing it from its forwarding table. 2.3 Loop avoidance After a host is disconnected, it may try to rejoin one of its descendants. This will create a loop which will eventually starve the whole subtree. To prevent such an undesirable case, each peer keeps the list of its direct ancestors, which are peers in the path from the peer to the source. When one of the peers in the extra link pool receives a rejoin request, it first examines if the requesting peer is one of its direct ancestors. Since a peer only needs to remember the direct ancestors, it doesn t need to know the whole tree structure. Thus, additional memory and processing power are negligible. Figure 2: Percentage of control protocol overhead. 2.4 Protocol evaluation The control protocol was evaluated over different network topologies for varying number of multicast trees. In Fig.2, the control traffic overhead is shown for different configurations. As illustrated, even when 4 mutliple trees are maintained the overhead does not exceed 2% of the total traffic exchanged on the network, for topologies supporting up to 750 hosts. In terms of latency, the joining operation takes less than 0.5s, parent leaves are detected in less than 2 seconds and it takes an additional second to rejoin, on average. When video is distributed over a larger number of multiple trees, the effect of an ungraceful leave is less important as children have several parents from whom they can request retransmissions. On the other hand, maintaining more trees incurs more control traffic overhead. In Fig.3, this tradeoff is shown in terms of the average video quality for the hosts of the network, measured as the average Peak Signal to Noise Ratio (PSNR), represented in db, as a function of the number of multiple multicast trees maintained by the protocol. In this environment, the optimal tradeoff between robustness and congestion is obtained when 4 multiple trees are used. Figure 3: Video quality as a function of the number of multiple trees. 3. VIDEO DISTORTION MODEL For live video streaming applications, video packets are transmitted over the network and need to meet a playout dead-
4 line. Decoded video quality at the receiver is therefore affected by two factors: distortion introduced by the encoder compression, denoted by D enc, and distortion due to packet loss or late arrivals, denoted by D loss. Assuming an additive relation of these two independent factors, a video distortion model was derived in [10]. The decoded video distortion, D dec, is given by: D dec = D enc + D loss, (1) D enc = D 0 + θ/(r R 0), (2) D loss = κ(p r +(1 P r)e (C R)T/L ), (3) n C = C i, (4) R = i=1 n R i (5) i=1 In (2), R is the total rate of the video stream, and the parameters D 0, θ and R 0 are estimated from empirical ratedistortion curves via regression techniques. PSNR (db) kbps exp kbps exp. 360 kbps exp. 80 kbps model kbps model 360 kbps model Rate (kbps) Figure 4: Rate-distortion model and experimental results video streaming over varying capacity paths. The second distortion term, D loss, depends linearly on the packet loss rate. The scaling factor κ indicates the sensitivity of the stream to losses which depend on the encoding structure. The other factor reflects the combined rate of random losses and late arrivals. P r is the random packet loss rate and T is the time within which each packet should reach the receiver (typically a few hundred milliseconds). The parameters C and L depend on the maximum allowable rate and on the average packet size. In (4)-(5), C i and R i represent the available throughput and the rate of the video exchanged between the receiver and its parent on the i th multicast tree. Typically, each video substream will be equivalent: R i = R/n. In Fig.4, the model is represented together with empirical measurements for three different network setups. In the first case the aggregate throughput to the receiver over the different multicast trees is 80kbps, 260kbps in the second case and 360kbps in the third. This model reflects the impact of the rate on video distortion. At lower rates, reconstructed video quality is limited by coarse quantization, whereas at high rates, more packets are delayed beyond their playout deadline due to network congestion. For live video steaming in a bandwidth-limited environment, we therefore expect to achieve maximum decoded quality for some intermediate rate. This is illustrated in Fig. 4, by the bell shape of the curves representing decoded video quality. For peer-to-peer streaming, it is essential to limit the amount of self-inflicted congestion created by the media streams. Indeed, as there might be a large number of intermediate end-hosts separating a peer from the source, any increase in network congestion, may be reflected multiplicatively in the total end-to-end delay. Combined with physical link latency this delay may cause some packets to miss their playout deadline, resulting in decoding errors and a decrease in decoded quality. The second term of (3) reflects congestion. Hence, for fine tuning, congestion may be reduced by the following methods: increasing the amount of over-provisioning by reserving a larger capacity C i on each of the multicast Figure 5: SI frames share the instant refresh properties of I frames but are only sent after a frame is lost. trees between a sender peer and a receiver peer; decreasing the encoding rate of the video R. When video is pre-encoded at a constant rate, as is often the case, it is not always possible to reduce the streaming rate. Thus, it may be necessary to employ more over-provisioning, this in turn may decrease the number of hosts supported by the peer-to-peer system. Themodelcanbeusedtodeterminetherightamountof over-provisioning by limiting (3) by a fixed threshold. 4. ERROR-RESILIENT STREAMING In this section, we describe the structure used to encode the video file. The video stream distributed over the peerto-peer network includes periodic SP frames which enable adaptive error recovery. 4.1 SP and SI frames SP/SI pictures are new types of predictively/intra coded pictures. They were proposed in 2001 by Karczewicz and Kurceren, as a solution for error resilience, bitstream switching and random access [6, 7]. They are now part of the Extended Profile of H.264. The main advantage of this new picture type is that it can be reconstructed exactly by using different sets of predictors or no predictor at all. This allows to refresh a prediction chain adaptively as depicted in Fig. 5.
5 Figure 6: GOP structures used for streaming with SP and SI frames and for periodic I frame insertion. In a video streaming application, when a packet arrives at the receiver after its playout deadline, it is discarded by the decoder as if it were lost. To avoid interruptions, the errors due to packet loss or to excessive delays are concealed by freezing the previous frame until the next decodable frame and the playout continues at the cost of higher distortion. When SP frames are used, if a P frame or an SP frame is lost and cannot be retransmitted, an SI frame is sent at the beginning of the next group of pictures (GOP) to stop decoding error from propagating further, as depicted in Fig. 5. This differs from traditional video streaming where I frames are transmitted periodically whether decoding errors occurornot. 4.2 Compression efficiency The video encoding structure shown in Fig. 6 was chosen for the streaming experiments presented in this paper. The number of frames in a Groups of Pictures (GOP) is 16, with one SP frame (and its corresponding SI frame) per GOP and 3 B frames between P frames. This ensures good error resilience properties and allows to easily scale down the frame rate by 2 or even 4 if needed. The encoded video sequences used in the following experiments, as well as rate-distortion preambles characterizing the size and quality of the frames are made publicly available [1] 1. The average compression efficiency of different frame types is shown in Fig.7. As the size of SP frames is less than that of I frames, for environments with limited loss rates, the bit rate savings obtained by not transmitting unnecessary I frames may reach up to 25%. This is illustrated in Fig.8, which shows the compression efficiency of GOPs containing SP or SI frames compared to GOPs with periodic I frames. 4.3 SI frame regeneration The details of the encoding/decoding process of SP and SI frames is beyond the scope of this paper, however, we note that if an SP frame is decoded correctly, the corresponding SI picture may be created by the decoder with very limited additional complexity 2. As a consequence, in the peer-to-peer streaming scenario, each host which receives and decodes an SP frame correctly may regenerate the corresponding SI frame. Therefore, this host may transmit an SI frame rather than the SP frame it received if it is needed by one of its descendant. This technique allows the adaptive streaming to take place not only between the source and its direct descendants but also further down in the tree. 1 The preambles also indicate the distortion values obtained by concealing a frame with any other frame of the stream, allowing to simulate realistically video streaming without the overhead of encoding and decoding. 2 However the reverse is not true: the SP frame cannot be recovered from the SI frame without a complete encoder. PSNR (db) B frames P frames 34 SP frames I frames SI frames Rate (bits/pixel) Figure 7: Frame type comparison for Mother & Daughter sequence. PSNR (db) periodic I frames 37 periodic SP frames periodic SI frames Rate (Kbps) Figure 8: Rate-distortion performance with periodic I frame, SP frame or SI frame insertion, for Mother & Daughter.
6 5. OPTIMIZED RETRANSMISSIONS In this section, we describe how to determine optimal retransmission schedule for missing packets of a video stream. This schedule indicates which packets of the stream will be requeste to maximize the decoded video quality at the receiver while limiting the congestion created on the network. The aim of the congestion distortion optimized retransmission scheduler (CoDiO) is to determine a schedule minimizing the expected Lagrangian cost D + λ, where D is the distortion of the received video stream and is the endto-end delay which serves as the congestion metric. In [9], we analyze the benefits of using this metric rather than the traditional objective D + λr used in rate-distortion optimized scheduling [2]. In particular, end-to-end delay is inherently adaptive to time-varying network conditions. In addition, it reflects better the impact of a user operating on a bandwidth-limited network. To minimize the Lagrangian cost, CoDiO selects the most important packets in terms of video distortion reduction, and requests them in an order which minimizes the congestion created on the network. For example, I frames are requested in priority whereas B frames might not be retransmitted at all. In addition, Co- DiO avoids requesting packets in large bursts as this has the worse effect on the queuing delay. In the following, we describe how to estimate, with low complexity, the distortion corresponding to a given retransmission schedule and how to limit congestion. 5.1 Determining the video distortion The expected value of the distortion for the video stream decoded by the client is computed as in [5]. Namely, if copy error concealment is used, an undecodable frame is replaced with the nearest correctly decoded frame for display. Hence, to capture the effect of packet loss on the video quality, only a limited number of display outcomes need to be identified and associated with different distortions. Let D(s, f) denote the distortion resulting from substituting frame s to frame f, the expected distortion when displaying frame f is: D(f) = D(s, f)pr{s} (6) s In Eq. (6), Pr{s} represents the probability that frame s is displayed instead of f. This probability may be computed, as described in [5], by combining the probabilities that different packets do not reach the client by their playout deadline. The difficulty resides in estimating the delay distribution function needed to derive these quantities. Different techniques, with varying complexity, can be used to model this distribution. In our simulations, we use a very simple estimation method to keep the simulation time low: we classify packets into two sets, the set of missing packets and the set of packets which have been or will be received before their playout deadline. This classification reduces the number of possible decoding states to one, thus we know which frames will be displayed over the horizon considered. It is then easy to determine the sensitivity of the distortion to each missing packet, and requests are issued in the order of importance of the packets. 5.2 Limiting congestion In the scenario considered, the available transmission rate between a sending peer and a receiving peer depends on several factors, such as the uplink throughput of the sending peer, the number of other hosts served by this peer and the rate of the video stream. Given these parameters, the available throughput C i may be computed and the average end-to-end delay over a certain time horizon can be estimated for a given retransmission schedule. However, the estimation also requires modelling the delay distribution of the path between sender and receiver. As a low-complexity alternative, we suggest to limit the number of unacknowledged retransmission requests from a peer to each of its parents. As unacknowledged retransmission requests represent a packet being transmitted or processed between the two peers, these packets contribute to end-to-end delay hence to congestion. The tradeoff between the speed of the retransmissions and the amount of congestion created on the bottleneck links can be set by determining the optimal number of unacknowledged packets tolerated between a sender and a receiver This optimization will be carried out experimentally. 6. CONCLUSIONS Live peer-to-peer multicast streaming is constrained by the dynamic behavior of hosts and by limited uplink throughput. Dynamic control protocols are needed to support heterogeneous peers and react rapidly to node disconnections. We propose to use video encoding, streaming and scheduling techniques developed recently to further enhance the performance. A rate-distortion model analyzes the tradeoff between self-inflicted congestion and video quality and is used to determine the amount of over-provisioning necessary when low latency is required. H.264 SP and SI frames are incorporated into the video stream to provide adaptive error-resiliency capability and achieve bit-rate saving gains of up to 25% compared to traditional video streams. Last, retransmission of missing packets are requested in a congestion-optimized fashion which selects the most important packets in terms of video quality while limiting the induced congestion. The experimental results are collected over a simulated network in ns-2 for a large number of hosts which join and leave dynamically. Although the gains obtained in this paper are for our implementation of an overlay multicast control protocol, we believe the results are more general and could be applied to most implementations of video peer-to-peer streaming. 7. REFERENCES [1] Encoded sequences with SP/SI frames. esetton/sequences.htm. [2] P. Chou and Z. Miao. Rate-distortion optimized streaming of packetized media. Microsoft Research Technical Report MSR-TR , Feb [3] Y.Chu,A.Ganjam,T.Ng,S.Rao, K. Sripanidkulchai, J. Zhan, and H. Zhang. Early experience with an internet broadcast system based on overlay multicast. Proceedings of USENIX 04, page , June [4] ITU-T and ISO/IEC JTC 1. Advanced Video Coding for Generic Audiovisual services, ITU-T
7 Recommendation H ISO/IEC (AVC), [5] M. Kalman, P. Ramanathan, and B. Girod. Rate-distortion optimized streaming with multiple deadlines. Proc. International Conference on Image Processing, Barcelona, Spain, Sept [6] M. Karczewicz and R. Kurceren. A Proposal for SP-Frames. VideoCodingExpertsGroupMeeting,, Doc. VCEG-L-27, Eibsee, Germany, Jan [7] M. Karczewicz and R. Kurceren. The SP- and SI-frames design for H.264/AVC. IEEE Trans. CSVT, 13(7): , July [8] V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai. Distributing streaming media content using cooperative networking. Proceedings NOSSDAV 02, Miami, USA, May [9] E. Setton and B. Girod. Congestion-Distortion Optimized Scheduling of Video. Multimedia Signal Processing Workshop (MMSP), Siena, Italy, pages , Oct [10] E. Setton, X. Zhu, and B. Girod. Minimizing distortion for multipath video streaming over ad hoc networks. International Conference on Image Processing, Singapore, pages , Oct [11] K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang. The feasibility of supporting largescale live streaming applications with dynamic application endpoints. Proceedings SIGCOMM 04, Portland, USA, Aug [12] X. Zhang, J. Liu, B. Li, and T.-S. P. Yum. Donet/coolstreaming: A data-driven overlay network for live media streaming. Proceedings IEEE Infocom, Miami, USA, Feb
Rate-Distortion Optimized Video Peer-to-Peer Multicast Streaming
Eric Setton esetton@stanford.edu Rate-Distortion Optimized Video Peer-to-Peer Multicast Streaming Invited Paper Jeonghun Noh jhnoh@stanford.edu Bernd Girod bgirod@stanford.edu Information Systems Laboratory,
More informationRate-distortion Optimized Streaming of Compressed Light Fields with Multiple Representations
Rate-distortion Optimized Streaming of Compressed Light Fields with Multiple Representations Prashant Ramanathan and Bernd Girod Department of Electrical Engineering Stanford University Stanford CA 945
More informationLow-delay Peer-to-Peer Streaming using Scalable Video Coding
Low-delay Peer-to-Peer Streaming using Scalable Video Coding Pierpaolo Baccichet, Thomas Schierl, Thomas Wiegand, Bernd Girod Max Planck Center for Visual Computing & Communication, 945 Stanford CA, USA
More informationPredicting connection quality in peer-to-peer real-time video streaming systems
Predicting connection quality in peer-to-peer real-time video streaming systems Alex Giladi Jeonghun Noh Information Systems Laboratory, Department of Electrical Engineering Stanford University, Stanford,
More informationRate-distortion Optimized Streaming of Compressed Light Fields with Multiple Representations
Rate-distortion Optimized Streaming of Compressed Light Fields with Multiple Representations Prashant Ramanathan and Bernd Girod Department of Electrical Engineering Stanford University Stanford CA 945
More informationIN live peer-to-peer (P2P) video multicast, a stream is
1 Congestion-Aware Video Streaming for Peer-to-Peer Live Multicast Eric Setton, Student Member, IEEE, and Bernd Girod, Fellow, IEEE, Invited Paper Abstract Peer-to-peer video multicast is promising for
More informationPeer-to-Peer Live Multicast: A Video Perspective
INVITED PAPER Peer-to-Peer Live Multicast: A Video Perspective Systems designed to provide television quality viewing in peer-to-peer computer networks, and the tools to measure their effectiveness, are
More informationThe Performance of MANET Routing Protocols for Scalable Video Communication
Communications and Network, 23, 5, 9-25 http://dx.doi.org/.4236/cn.23.522 Published Online May 23 (http://www.scirp.org/journal/cn) The Performance of MANET Routing Protocols for Scalable Video Communication
More informationXiaoqing Zhu, Sangeun Han and Bernd Girod Information Systems Laboratory Department of Electrical Engineering Stanford University
Congestion-aware Rate Allocation For Multipath Video Streaming Over Ad Hoc Wireless Networks Xiaoqing Zhu, Sangeun Han and Bernd Girod Information Systems Laboratory Department of Electrical Engineering
More informationCoding for the Network: Scalable and Multiple description coding Marco Cagnazzo
Coding for the Network: Scalable and Multiple description coding Marco Cagnazzo Overview Examples and motivations Scalable coding for network transmission Techniques for multiple description coding 2 27/05/2013
More informationMulti-path Forward Error Correction Control Scheme with Path Interleaving
Multi-path Forward Error Correction Control Scheme with Path Interleaving Ming-Fong Tsai, Chun-Yi Kuo, Chun-Nan Kuo and Ce-Kuen Shieh Department of Electrical Engineering, National Cheng Kung University,
More informationReceiver-based adaptation mechanisms for real-time media delivery. Outline
Receiver-based adaptation mechanisms for real-time media delivery Prof. Dr.-Ing. Eckehard Steinbach Institute of Communication Networks Media Technology Group Technische Universität München Steinbach@ei.tum.de
More informationTo address these challenges, extensive research has been conducted and have introduced six key areas of streaming video, namely: video compression,
Design of an Application Layer Congestion Control for Reducing network load and Receiver based Buffering Technique for packet synchronization in Video Streaming over the Internet Protocol Mushfeq-Us-Saleheen
More informationEXPERIENCES WITH A LARGE-SCALE DEPLOYMENT OF STANFORD PEER-TO-PEER MULTICAST
EXPERIENCES WITH A LARGE-SCALE DEPLOYMENT OF STANFORD PEER-TO-PEER MULTICAST Jeonghun Noh, Pierpaolo Baccichet, Bernd Girod Information Systems Laboratory, Department of Electrical Engineering Stanford
More informationMULTI-BUFFER BASED CONGESTION CONTROL FOR MULTICAST STREAMING OF SCALABLE VIDEO
MULTI-BUFFER BASED CONGESTION CONTROL FOR MULTICAST STREAMING OF SCALABLE VIDEO Chenghao Liu 1, Imed Bouazizi 2 and Moncef Gabbouj 1 1 Department of Signal Processing, Tampere University of Technology,
More informationQUANTIZER DESIGN FOR EXPLOITING COMMON INFORMATION IN LAYERED CODING. Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose
QUANTIZER DESIGN FOR EXPLOITING COMMON INFORMATION IN LAYERED CODING Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose Department of Electrical and Computer Engineering University of California,
More informationEnabling Adaptive Video Streaming in P2P Systems
1 Enabling Adaptive Video Streaming in P2P Systems Dan Jurca (IEEE student member), Jacob Chakareski, Jean-Paul Wagner (IEEE student member), and Pascal Frossard (IEEE senior member) Ecole Polytechnique
More informationOPTIMAL SERVER BANDWIDTH ALLOCATION AMONG MULTIPLE P2P MULTICAST LIVE VIDEO STREAMING SESSIONS. Aditya Mavlankar, Jeonghun Noh, and Bernd Girod
OPTIMAL SERVER BANDWIDTH ALLOCATION AMONG MULTIPLE P2P MULTICAST LIVE VIDEO STREAMING SESSIONS Aditya Mavlankar, Jeonghun Noh, and Bernd Girod Information Systems Laboratory, Department of Electrical Engineering
More informationPeer-to-Peer Streaming Systems. Behzad Akbari
Peer-to-Peer Streaming Systems Behzad Akbari 1 Outline Introduction Scaleable Streaming Approaches Application Layer Multicast Content Distribution Networks Peer-to-Peer Streaming Metrics Current Issues
More informationDelay Constrained ARQ Mechanism for MPEG Media Transport Protocol Based Video Streaming over Internet
Delay Constrained ARQ Mechanism for MPEG Media Transport Protocol Based Video Streaming over Internet Hong-rae Lee, Tae-jun Jung, Kwang-deok Seo Division of Computer and Telecommunications Engineering
More informationDistributed Rate Allocation for Video Streaming over Wireless Networks with Heterogeneous Link Speeds
Distributed Rate Allocation for Video Streaming over Wireless Networks with Heterogeneous Link Speeds Invited Paper Xiaoqing Zhu and Bernd Girod Information Systems Laboratory, Stanford University, CA
More informationAn Empirical Study of Flash Crowd Dynamics in a P2P-based Live Video Streaming System
An Empirical Study of Flash Crowd Dynamics in a P2P-based Live Video Streaming System Bo Li,GabrielY.Keung,SusuXie,Fangming Liu,YeSun and Hao Yin Hong Kong University of Science and Technology Tsinghua
More informationTECHNIQUES STREAMING FOR IMPROVED
TECHNIQUES FOR IMPROVED RATE-DISTORTION OPTIMIZED VIDEO STREAMING Mark Kalman and Bernd Girod Information Systems Laboratory Stanford University We present techniques recently developed by our research
More informationTowards Low-Redundancy Push-Pull P2P Live Streaming
Towards Low-Redundancy Push-Pull P2P Live Streaming Zhenjiang Li, Yao Yu, Xiaojun Hei and Danny H.K. Tsang Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology
More informationMulticast Transport Protocol Analysis: Self-Similar Sources *
Multicast Transport Protocol Analysis: Self-Similar Sources * Mine Çağlar 1 Öznur Özkasap 2 1 Koç University, Department of Mathematics, Istanbul, Turkey 2 Koç University, Department of Computer Engineering,
More informationWITH the increase in the bandwidth of wireless channels
2 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 17, NO. 1, JANUARY 2007 Multiple Tree Video Multicast Over Wireless Ad Hoc Networks Wei Wei and Avideh Zakhor, Fellow, IEEE Abstract
More informationUnequal Error Recovery Scheme for Multimedia Streaming in Application-Level Multicast
Unequal Error Recovery Scheme for Multimedia Streaming in Application-Level Multicast Joonhyoung Lee, Youngha Jung, and Yoonsik Choe Department of Electrical and Electronic Engineering, Yonsei University,
More informationRECOMMENDATION ITU-R BT.1720 *
Rec. ITU-R BT.1720 1 RECOMMENDATION ITU-R BT.1720 * Quality of service ranking and measurement methods for digital video broadcasting services delivered over broadband Internet protocol networks (Question
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationNetwork-Adaptive Video Coding and Transmission
Header for SPIE use Network-Adaptive Video Coding and Transmission Kay Sripanidkulchai and Tsuhan Chen Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213
More informationSystematic Lossy Error Protection for Video Transmission over Wireless Ad Hoc Networks
Systematic Lossy Error Protection for Transmission over Wireless Ad Hoc Networks Xiaoqing Zhu, Shantanu Rane and Bernd Girod Information Systems Laboratory, Stanford University, Stanford, CA 94305 ABSTRACT
More informationERROR-ROBUST INTER/INTRA MACROBLOCK MODE SELECTION USING ISOLATED REGIONS
ERROR-ROBUST INTER/INTRA MACROBLOCK MODE SELECTION USING ISOLATED REGIONS Ye-Kui Wang 1, Miska M. Hannuksela 2 and Moncef Gabbouj 3 1 Tampere International Center for Signal Processing (TICSP), Tampere,
More informationPartial Reliable TCP
Partial Reliable TCP Yao-Nan Lien and Ming-Han Wu Computer Science Department,National Chengchi University, Taipei, Taiwan, R.O.C. lien@cs.nccu.edu.tw ABSTRACT-Some new information services over IPbased
More informationCC-SCTP: Chunk Checksum of SCTP for Enhancement of Throughput in Wireless Network Environments
CC-SCTP: Chunk Checksum of SCTP for Enhancement of Throughput in Wireless Network Environments Stream Control Transmission Protocol (SCTP) uses the 32-bit checksum in the common header, by which a corrupted
More informationROBUST LOW-LATENCY VOICE AND VIDEO COMMUNICATION OVER BEST-EFFORT NETWORKS
ROBUST LOW-LATENCY VOICE AND VIDEO COMMUNICATION OVER BEST-EFFORT NETWORKS a dissertation submitted to the department of electrical engineering and the committee on graduate studies of stanford university
More informationUnderstanding Mesh-based Peer-to-Peer Streaming
Understanding Mesh-based Peer-to-Peer Streaming Nazanin Magharei, Reza Rejaie Department of Computer and Information Science University of Oregon {nazanin,reza}@cs.uoregon.edu ABSTRACT A common approach
More informationEfficient and Load-Balance Overlay Multicast Scheme with Path Diversity for Video Streaming
Efficient and Load-Balance Overlay Multicast Scheme with Path Diversity for Video Streaming Chao-Lieh Chen 1, Jeng-Wei Lee 2, Jia-Ming Yang 2, and Yau-Hwang Kuo 2 1 Department of Electronic Engineering,
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationDynamic Load-balanced Path Optimization in SDN-based Data Center Networks
Dynamic Load-balanced Path Optimization in SDN-based Data Center Networks Yuan-Liang Lan Department of Computer Science National Chiao Tung University Hsinchu, Taiwan kmntree@gmail.com Kuochen Wang and
More informationVideo Streaming Over Multi-hop Wireless Networks
Video Streaming Over Multi-hop Wireless Networks Hao Wang Dept. of Computer Information System, Cameron University hwang@cameron.edu Andras Farago, Subbarayan Venkatesan Dept. of Computer Science, The
More informationOverlay Networks for Multimedia Contents Distribution
Overlay Networks for Multimedia Contents Distribution Vittorio Palmisano vpalmisano@gmail.com 26 gennaio 2007 Outline 1 Mesh-based Multicast Networks 2 Tree-based Multicast Networks Overcast (Cisco, 2000)
More informationRouting-aware Multiple Description Coding with Multipath Transport for Video Delivered over Mobile Ad-hoc Networks
Routing-aware Multiple Description Coding with Multipath Transport for Video Delivered over Mobile Ad-hoc Networks Yiting Liao and Jerry D. Gibson Department of Electrical and Computer Engineering University
More informationRouting Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationDistributed Rate Allocation for Video Streaming over Wireless Networks. Wireless Home Video Networking
Ph.D. Oral Defense Distributed Rate Allocation for Video Streaming over Wireless Networks Xiaoqing Zhu Tuesday, June, 8 Information Systems Laboratory Stanford University Wireless Home Video Networking
More informationMISB EG Motion Imagery Standards Board Engineering Guideline. 24 April Delivery of Low Bandwidth Motion Imagery. 1 Scope.
Motion Imagery Standards Board Engineering Guideline Delivery of Low Bandwidth Motion Imagery MISB EG 0803 24 April 2008 1 Scope This Motion Imagery Standards Board (MISB) Engineering Guideline (EG) provides
More informationCompression of VQM Features for Low Bit-Rate Video Quality Monitoring
Compression of VQM Features for Low Bit-Rate Video Quality Monitoring Mina Makar, Yao-Chung Lin, Andre F. de Araujo and Bernd Girod Information Systems Laboratory, Stanford University, Stanford, CA 9435
More informationCross-Layer Perceptual ARQ for H.264 Video Streaming over Wireless Networks
Cross-Layer Perceptual ARQ for H.264 Video Streaming over 802.11 Wireless Networks P. Bucciol,G.Davini, E. Masala, E. Filippi and J.C. De Martin IEIIT-CNR / Dipartimento di Automatica e Informatica Politecnico
More informationMITIGATING THE EFFECT OF PACKET LOSSES ON REAL-TIME VIDEO STREAMING USING PSNR AS VIDEO QUALITY ASSESSMENT METRIC ABSTRACT
MITIGATING THE EFFECT OF PACKET LOSSES ON REAL-TIME VIDEO STREAMING USING PSNR AS VIDEO QUALITY ASSESSMENT METRIC Anietie Bassey, Kufre M. Udofia & Mfonobong C. Uko Department of Electrical/Electronic
More informationA Quantized Transform-Domain Motion Estimation Technique for H.264 Secondary SP-frames
A Quantized Transform-Domain Motion Estimation Technique for H.264 Secondary SP-frames Ki-Kit Lai, Yui-Lam Chan, and Wan-Chi Siu Centre for Signal Processing Department of Electronic and Information Engineering
More informationLive P2P Streaming with Scalable Video Coding and Network Coding
School of Computing Science Simon Fraser University, Canada Live P2P Streaming with Scalable Video Coding and Network Coding Mohamed dhefeeda (Joint work with Shabnam Mirshokraie) 22 February 2010 Mohamed
More informationRecommended Readings
Lecture 11: Media Adaptation Scalable Coding, Dealing with Errors Some slides, images were from http://ip.hhi.de/imagecom_g1/savce/index.htm and John G. Apostolopoulos http://www.mit.edu/~6.344/spring2004
More informationStreaming Performance in Multiple-tree-based Overlays
Streaming Performance in Multiple-tree-based Overlays György Dán, Viktória Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School of Electrical Engineering KTH, Royal Institute of Technology
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationMaster s Thesis. A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems
Master s Thesis Title A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems Supervisor Professor Masayuki Murata Author Hideto Horiuchi February 14th, 2007 Department
More informationRouting Protocols in MANET: Comparative Study
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119
More informationImproving the quality of H.264 video transmission using the Intra-Frame FEC over IEEE e networks
Improving the quality of H.264 video transmission using the Intra-Frame FEC over IEEE 802.11e networks Seung-Seok Kang 1,1, Yejin Sohn 1, and Eunji Moon 1 1Department of Computer Science, Seoul Women s
More informationConsidering Priority in Overlay Multicast Protocols under Heterogeneous Environments
Considering Priority in Overlay Multicast Protocols under Heterogeneous Environments Michael Bishop and Sanjay Rao Purdue University Kunwadee Sripanidkulchai National Electronics and Computer Technology
More informationCHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION
CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION 5.1 INTRODUCTION Generally, deployment of Wireless Sensor Network (WSN) is based on a many
More informationBandwidth Aggregation with Path Interleaving Forward Error Correction Mechanism for Delay-Sensitive Video Streaming in Wireless Multipath Environments
Tamkang Journal of Science and Engineering, Vol. 13, No. 1, pp. 1 9 (2010) 1 Bandwidth Aggregation with Path Interleaving Forward Error Correction Mechanism for Delay-Sensitive Video Streaming in Wireless
More informationComputation of Multiple Node Disjoint Paths
Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes
More informationSubnet Multicast for Delivery of One-to-Many Multicast Applications
Subnet Multicast for Delivery of One-to-Many Multicast Applications We propose a new delivery scheme for one-to-many multicast applications such as webcasting service used for the web-based broadcasting
More informationDistributed bandwidth-efficient packet scheduling for live streaming with network coding
Distributed bandwidth-efficient packet scheduling for live streaming with network coding Huang, S; Izquierdo, E; Hao, P The final publication is available at http://dl.acm.org/citation.cfm?id=2806395 For
More informationAdaptation of Scalable Video Coding to Packet Loss and its Performance Analysis
Adaptation of Scalable Video Coding to Packet Loss and its Performance Analysis Euy-Doc Jang *, Jae-Gon Kim *, Truong Thang**,Jung-won Kang** *Korea Aerospace University, 100, Hanggongdae gil, Hwajeon-dong,
More informationComplexity Reduced Mode Selection of H.264/AVC Intra Coding
Complexity Reduced Mode Selection of H.264/AVC Intra Coding Mohammed Golam Sarwer 1,2, Lai-Man Po 1, Jonathan Wu 2 1 Department of Electronic Engineering City University of Hong Kong Kowloon, Hong Kong
More informationMedia-Aware Multi-User Rate Allocation over Wireless Mesh Network
Media-Aware Multi-User Rate Allocation over Wireless Mesh Network Xiaoqing Zhu and Bernd Girod Information Systems Laboratory, Stanford University, CA, U.S.A. {zhuxq,bgirod}@stanford.edu Abstract When
More information1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks
More informationImproving TCP Performance over Wireless Networks using Loss Predictors
Improving TCP Performance over Wireless Networks using Loss Predictors Fabio Martignon Dipartimento Elettronica e Informazione Politecnico di Milano P.zza L. Da Vinci 32, 20133 Milano Email: martignon@elet.polimi.it
More informationCross Layer Design for QoS Support in Multimedia Applications over Wireless Networks. Jaydip Sen Innovation Lab TCS Kolkata
Cross Layer Design for QoS Support in Multimedia Applications over Wireless Networks Jaydip Sen Innovation Lab TCS Kolkata Agenda Introduction Different approaches to Cross Layer Design Applications of
More informationInvestigation of the GoP Structure for H.26L Video Streams
Investigation of the GoP Structure for H.26L Video Streams F. Fitzek P. Seeling M. Reisslein M. Rossi M. Zorzi acticom GmbH mobile networks R & D Group Germany [fitzek seeling]@acticom.de Arizona State
More informationFast Decision of Block size, Prediction Mode and Intra Block for H.264 Intra Prediction EE Gaurav Hansda
Fast Decision of Block size, Prediction Mode and Intra Block for H.264 Intra Prediction EE 5359 Gaurav Hansda 1000721849 gaurav.hansda@mavs.uta.edu Outline Introduction to H.264 Current algorithms for
More informationCODING METHOD FOR EMBEDDING AUDIO IN VIDEO STREAM. Harri Sorokin, Jari Koivusaari, Moncef Gabbouj, and Jarmo Takala
CODING METHOD FOR EMBEDDING AUDIO IN VIDEO STREAM Harri Sorokin, Jari Koivusaari, Moncef Gabbouj, and Jarmo Takala Tampere University of Technology Korkeakoulunkatu 1, 720 Tampere, Finland ABSTRACT In
More informationAMRIS: A Multicast Protocol for Ad hoc Wireless Networks
of AMRIS: A Multicast Protocol for Ad hoc Wireless Networks C.W. Wu, Y.C. Tay National University of Singapore wuchunwei@alum.comp.nus.edu.sg,tay@acm.org Abstract This paper introduces AMRIS, a new multicast
More informationVolume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com Efficient
More informationJoint Capacity, Flow and Rate Allocation for Multiuser Video Streaming over Wireless Ad-Hoc Networks
Joint Capacity, Flow and Rate Allocation for Multiuser Video Streaming over Wireless Ad-Hoc Networks Sachin Adlakha Wireless Systems Laboratory Department of Electrical Engineering 35 Serra Mall Stanford,
More informationReversing Ticket Based Probing Routing Protocol for MANET
Reversing Ticket Based Probing Routing Protocol for MANET TURGUT YUCEL and MIN SONG Department of Electrical and Computer Engineering Old Dominion University Norfolk, VA 23529 U.S.A. http://www.odu.edu/networking
More informationVIDEO STREAMING OVER WIRELESS NETWORKS
1th European Signal Processing Conference (EUSIPCO 7), Poznan, Poland, September 3-7, 7, copyright by EURASIP VIDEO STREAMING OVER WIRELESS NETWORKS Xiaoqing Zhu and Bernd Girod Information Systems Laboratory,
More informationUtility-based Packet Scheduling in P2P Mesh-based Multicast
Utility-based Packet Scheduling in P2P Mesh-based Multicast Jacob Chakareski and Pascal Frossard Signal Processing Laboratory - LTS4 Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland ABSTRACT
More informationImproving Interactive Video in Wireless Networks Using Path Diversity 1
Improving Interactive Video in Wireless Networks Using Path Diversity 1 Ahmed Abd El Al *, Chitra Venkatramani, Tarek Saadawi *, Myung Lee * * City College and Graduate Center of City University of New
More informationApplications such as Internet TV,
Feature Article Loss Recovery in Application- Layer Multicast Xing Jin, W.-P. Ken Yiu, and S.-H. Gary Chan The Hong Kong University of Science and Technology Application-layer multicast, sometimes called
More informationADAPTIVE PICTURE SLICING FOR DISTORTION-BASED CLASSIFICATION OF VIDEO PACKETS
ADAPTIVE PICTURE SLICING FOR DISTORTION-BASED CLASSIFICATION OF VIDEO PACKETS E. Masala, D. Quaglia, J.C. De Martin Λ Dipartimento di Automatica e Informatica/ Λ IRITI-CNR Politecnico di Torino, Italy
More informationLayered Multicast with Forward Error Correction (FEC) for Internet Video
Layered Multicast with Forward Error Correction (FEC) for Internet Video ZaiChen Zhang and Victor O. K. Li The University of Hong Kong Hong Kong, China Abstract In this paper, we propose RALF, a new FEC-based
More informationThe Frozen Mountain irtc White Paper Series
The Frozen Mountain irtc White Paper Series This white paper is the fourth in a series on Internet Based Real Time Communications (irtc) written by Frozen Mountain Software s CTO Anton Venema. The complete
More informationFor layered video encoding, video sequence is encoded into a base layer bitstream and one (or more) enhancement layer bit-stream(s).
3rd International Conference on Multimedia Technology(ICMT 2013) Video Standard Compliant Layered P2P Streaming Man Yau Chiu 1, Kangheng Wu 1, Zhibin Lei 1 and Dah Ming Chiu 2 Abstract. Peer-to-peer (P2P)
More informationContinuous Real Time Data Transfer with UDP/IP
Continuous Real Time Data Transfer with UDP/IP 1 Emil Farkas and 2 Iuliu Szekely 1 Wiener Strasse 27 Leopoldsdorf I. M., A-2285, Austria, farkas_emil@yahoo.com 2 Transilvania University of Brasov, Eroilor
More informationA Top Catching Scheme Consistency Controlling in Hybrid P2P Network
A Top Catching Scheme Consistency Controlling in Hybrid P2P Network V. Asha*1, P Ramesh Babu*2 M.Tech (CSE) Student Department of CSE, Priyadarshini Institute of Technology & Science, Chintalapudi, Guntur(Dist),
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationover the Internet Tihao Chiang { Ya-Qin Zhang k enormous interests from both industry and academia.
An End-to-End Architecture for MPEG-4 Video Streaming over the Internet Y. Thomas Hou Dapeng Wu y Wenwu Zhu z Hung-Ju Lee x Tihao Chiang { Ya-Qin Zhang k Abstract It is a challenging problem to design
More informationMultimedia networked applications: standards, protocols and research trends
Multimedia networked applications: standards, protocols and research trends Maria Teresa Andrade FEUP / INESC Porto mandrade@fe.up.pt ; maria.andrade@inescporto.pt http://www.fe.up.pt/~mandrade/ ; http://www.inescporto.pt
More informationInformation Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast
2005 Conference on Information Sciences and Systems, The Johns Hopkins University, March 16 18, 2005 Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast Yunnan Wu
More informationA HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMING
A HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMING Seyed Mehran Ronaghi 1 and Behzad Akbari 2 1 Department of Electrical and Computer Engineering, Qazvin Islamic Azad University, Qazvin,
More informationEMERGING multihop wireless LAN (WLAN) networks
IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 9, NO. 6, OCTOBER 2007 1299 Informationally Decentralized Video Streaming Over Multihop Wireless Networks Hsien-Po Shiang and Mihaela van der Schaar, Senior Member,
More informationFast RTP Retransmission for IPTV - Implementation and Evaluation
Fast RTP Retransmission for IPTV - Implementation and Evaluation M.J. Prins, M. Brunner, G. Karagiannis, H. Lundqvist, and G. Nunzi Abstract With the deployment of IPTV reliability for multicast is becoming
More informationUAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks
UAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks Sung-Hee Lee, Jong-Mu Choi, and Young-Bae Ko College of Information and Communication, Ajou University, South Korea shlee@dmc.ajou.ac.kr,
More informationStretch-Optimal Scheduling for On-Demand Data Broadcasts
Stretch-Optimal Scheduling for On-Demand Data roadcasts Yiqiong Wu and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University, University Park, PA 6 E-mail: fywu,gcaog@cse.psu.edu
More informationVideo-Aware Wireless Networks (VAWN) Final Meeting January 23, 2014
Video-Aware Wireless Networks (VAWN) Final Meeting January 23, 2014 1/26 ! Real-time Video Transmission! Challenges and Opportunities! Lessons Learned for Real-time Video! Mitigating Losses in Scalable
More informationUnbalanced Multiple Description Video Communication Using Path Diversity
Unbalanced Multiple Description Video Communication Using Path Diversity John G. Apostolopoulos, Susie J. Wee Client and Media Systems Laboratory HP Laboratories Palo Alto HPL-01-3 November th, 01* video
More informationTopology Optimization in Hybrid Tree/Mesh-based Peer-to-Peer Streaming System
88 Topology Optimization in Hybrid Tree/Mesh-based Peer-to-Peer Streaming System Tran Thi Thu Ha 1, Jinsul Kim 1, Jaehyung Park 1 Sunghyun Yoon 2, Ho-Yong Ryu 2 1 School of Electronics & Computer Engineering,
More informationENHANCING THE PERFORMANCE OF MANET THROUGH MAC LAYER DESIGN
I J I T E ISSN: 2229-7367 3(1-2), 2012, pp. 19-24 ENHANCING THE PERFORMANCE OF MANET THROUGH MAC LAYER DESIGN 1 R. MANIKANDAN, 2 K. ARULMANI AND 3 K. SELVAKUMAR Department of Computer Science and Engineering,
More informationDouble Feedback Streaming Agent for Real-time Delivery of Media over 3G Wireless Networks
Double Feedback Streaming Agent for Real-time Delivery of Media over 3G Wireless Networks Gene Cheung, Wai-Tian Tan Hewlett-Packard Laboratories Takeshi Yoshimura NTT DoCoMo, Inc. Abstract A network agent
More informationDynamically Provisioning Distributed Systems to Meet Target Levels of Performance, Availability, and Data Quality
Dynamically Provisioning Distributed Systems to Meet Target Levels of Performance, Availability, and Data Quality Amin Vahdat Department of Computer Science Duke University 1 Introduction Increasingly,
More information