Dynamic Transmission Scheduling for Streaming Applications via P2P Overlay Export

@article{my_jsps_2009, abstract = {Abstract In current Peer-to-Peer streaming applications, a lot of research attempts to provide timely stream services to the end users. Most of them focus on how to organize the peer connections into an efficient overlay network. Due to the variation in the network, a lot of overhead is generated when the overlay structure adapts to the changes. In order to minimize the impact of network fluctuation, we proposed a scheduling algorithm which helps to distribute stream data efficiently through the fluctuating networks. It needs only partial information about overlay structure and provides the services to satisfy most number of users. The global latency experienced by peers in the system is thus minimized. To alleviate the problem of packet loss along the overlay, we introduce retransmission requests into our scheduling algorithm. Requests for much needed data are treated with higher priority. Parent peers which receive the request will re-send the missing data to minimize the loss impact. The missing data which are needed by more peers will have a larger cumulative impact through the tree overlay and these are thus scheduled and sent earlier. Simulation results showed that our prioritization and scheduling algorithm minimizes the negative impact of fluctuation and data loss in a dynamic network environment.}, author = {Li, Jiaming and Yeo, Chai K.}, citeulike-article-id = {4054847}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11265-009-0339-2}, citeulike-linkout-1 = {http://www.springerlink.com/content/l4m23p72847x1gl1}, doi = {10.1007/s11265-009-0339-2}, journal = {Journal of Signal Processing Systems}, keywords = {p2p, scheduling, streaming}, posted-at = {2009-08-05 07:05:30}, priority = {2}, title = {Dynamic Transmission Scheduling for Streaming Applications via P2P Overlay}, url = {http://dx.doi.org/10.1007/s11265-009-0339-2} }

TY - JOUR ID - my_jsps_2009 L3 - citeulike-article-id:4054847 N2 - Abstract In current Peer-to-Peer streaming applications, a lot of research attempts to provide timely stream services to the end users. Most of them focus on how to organize the peer connections into an efficient overlay network. Due to the variation in the network, a lot of overhead is generated when the overlay structure adapts to the changes. In order to minimize the impact of network fluctuation, we proposed a scheduling algorithm which helps to distribute stream data efficiently through the fluctuating networks. It needs only partial information about overlay structure and provides the services to satisfy most number of users. The global latency experienced by peers in the system is thus minimized. To alleviate the problem of packet loss along the overlay, we introduce retransmission requests into our scheduling algorithm. Requests for much needed data are treated with higher priority. Parent peers which receive the request will re-send the missing data to minimize the loss impact. The missing data which are needed by more peers will have a larger cumulative impact through the tree overlay and these are thus scheduled and sent earlier. Simulation results showed that our prioritization and scheduling algorithm minimizes the negative impact of fluctuation and data loss in a dynamic network environment. JF - Journal of Signal Processing Systems TI - Dynamic Transmission Scheduling for Streaming Applications via P2P Overlay KW - p2p KW - scheduling KW - streaming AU - Li, Jiaming AU - Yeo, Chai UR - http://dx.doi.org/10.1007/s11265-009-0339-2 ER -