CiteULike: p2pstreaming delay http://www.citeulike.org/user/p2pstreaming/tag/delay CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/p2pstreaming/article/2776603 <i>Packet Video 2007 (2007), pp. 173-181.</i><br /><br />Peer-to-peer (P2P) networks represent a valuable architecture for streaming video over the Internet. In these systems, users contribute their resources to relay the media to others and no dedicated infrastructure is required. In order to ensure a low end-to-end delay, P2P overlay networks are often organized as a set of complementary multicast trees. The source of the stream multiplexes the data on top of these trees and the routing of packets is statically defined. In this scenario, the reliability of the overlay links is critical for the performance of the system since temporary link failure or network congestion can cause a significant disruption of the end-user quality. The novel Scalable Video Coding (SVC) standard enables efficient usage of the network capacity by allowing intermediate high capacity nodes in the overlay network to dynamically extract layers from the scalable bit stream to serve less capable peers. On the other hand, SVC incurs a certain loss in terms of coding efficiency with respect to H.264/AVC single-layer coding. We propose a simple model that allows to evaluate the trade-off of using a scalable codec with respect to single-layer coding, given the distribution of the receivers&#x2019; capacities in an error-free network. We also report experimental results obtained by using SVC on top of a real-time implementation of the Stanford Peer-to-Peer Multicast (SPPM) protocol that clearly show the benefits of a prioritization mechanism to react to network congestion. Low-delay peer-to-peer streaming using scalable video coding Pierpaolo Baccichet Thomas Schierl Thomas Wiegand Bernd Girod doi:10.1109/PACKET.2007.4397039 Packet Video 2007 (2007), pp. 173-181. 2008-05-09T20:50:52-00:00 Packet Video 2007 173 181 delay peer-to-peer scalable http://www.citeulike.org/user/p2pstreaming/article/760349 <i>IEEE Transactions on Communications, Vol. 32, No. 8. (1984), pp. 911-919.</i><br /><br />We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change. Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks D Bertsekas E Gafni R Gallager IEEE Transactions on Communications, Vol. 32, No. 8. (1984), pp. 911-919. 2006-07-15T20:46:09-00:00 IEEE Transactions on Communications 32 8 911 919 delay minimum http://www.citeulike.org/user/p2pstreaming/article/760348 <i>IEEE Transactions on Communications, Vol. 25, No. 1. (1977), pp. 73-85.</i><br /><br />An algorithm is defined for establishing routing tables in the individual nodes of a data network. The routing table at a node<tex>i</tex>specifies, for each other node<tex>j</tex>, what fraction of the traffic destined for node<tex>j</tex>should leave node<tex>i</tex>on each of the links emanating from node<tex>i</tex>. The algorithm is applied independently at each node and successively updates the routing table at that node based on information communicated between adjacent nodes about the marginal delay to each destination. For stationary input traffic statistics, the average delay per message through the network converges, with successive updates of the routing tables, to the minimum average delay over all routing assignments. The algorithm has the additional property that the traffic to each destination is guaranteed to be loop free at each iteration of the algorithm. In addition, a new global convergence theorem for noncontinuous iteration algorithms is developed. A Minimum Delay Routing Algorithm Using Distributed Computation R Gallager IEEE Transactions on Communications, Vol. 25, No. 1. (1977), pp. 73-85. 2006-07-15T20:42:38-00:00 IEEE Transactions on Communications 25 1 73 85 delay minimum