A Proxy-Caching Prefix Assignment Algorithm Based on P2P Cooperation in the Media Streaming System

Author(s):  
Rui-chun Tang ◽  
Qing-lei Wei ◽  
Bin Liu
Author(s):  
Al Bento

The objective of this chapter is to describe the process of creating audio and video streaming content for an on-line class session1 . An overall model of audio and video streaming is described, together with the media streaming process, in the introduction. The next parts of the chapter discuss how to create a class session with audio streaming only, audio and graphics, and audio and video. The chapter ends with a discussion on how to set up a streaming media server.


Media streaming has gained popularity due to convenience of playing it at one’s own leisure. It demands for smooth playing of media. However,with the increasing trend of media streaming and number of online users, it is getting difficult for content providers of popular media contents to handle media playing requests for popular media files. The number of simultaneous requests for media contents may affect uniform delivery of media contents and can lead to lower engagement of end-users.Content Delivery Network (CDN) plays an important role in streaming popular media contents by satisfying end-users’ requests through surrogate servers. However, in order to enhance end-users experience, it is not sufficient to only reduce response time of media segments. It also requires to have lesser number of stalls during media streaming. This entails for redirecting requests to suitable surrogate servers as well as managingthetime duration between delivery of subsequent segments of a media file.The proposed methodnamed Stall Aware Media Streaming (SAMS) focuses on enhancing end-users experience by reducing wait time during media streaming.It keeps track of the possibility of stalls during media streaming and adjusts the media segments delivery rate to endusers accordingly. This results in meeting Quality of Service (QoS) requirement of end-users for media streaming in a better way by content providers.


2004 ◽  
Vol 42 (8) ◽  
pp. 88-94 ◽  
Author(s):  
Jiangchuan Liu ◽  
Jianliang Xu

Author(s):  
Manuela Pereira ◽  
Mário M. Freire

information while being downloaded by clients. With the explosive growth of the Web and the mature of digital video technology, media streaming has received a great deal of interest as a promising solution for multimedia delivery services. This approach allows that media objects can be accessed in a similar way to conventional text and images using a download-and-play mode. However, unlike static text-based content, proxy caching has difficulty in delivering streaming media content because media objects are usually very large and its transmission consumes a great amount of network resources, prolongs startup latency, and threatens the playback continuity. The size of a conventional Web object is typically on the order of 1–100 kbytes and, therefore, a decision regarding either caching or not an object in its totality is an easy task (Liu & Xu, 2004). However, the size of media objects is very large, reaching a size on the order of several hundreds of Mbytes or even Gbytes. Therefore, caching a whole media object at a Web proxy optimized for delivering conventional small-size Web objects is not feasible, since large streams would quickly exhaust the capacity of the proxy cache. Besides, the streaming of media objects requires a significant amount of resources such as disk space and network bandwidth, which need to be maintained during a long period of time. Moreover, the long playback duration of a streaming may allow several client-server interactions. Therefore, access rates might be different for different parts of a stream, which makes cache management potentially more complex, as pointed out by Liu and Xu (2004). On the other hand, a download-beforeplaying solution provides continuous playback, but it also introduces a large startup delay. An effective solution to reduce client-perceived latencies and network congestion is to cache data at proxies widely deployed across the Internet. This solution, besides inexpensive, also leads to an improvement of both availability of objects and packet losses since redundant network transmission decreases while transmission efficiency increases. However, proxies are generally optimized for delivering conventional small-size Web objects, which may not satisfy the requirements of streaming applications. Due to these particular features of media objects, novel caching strategies have been proposed. With the evolution of the Internet as the dominant architecture for applications, contents, and services, these are gradually migrating from the client-­server paradigm to the edge services paradigm and to the peer-to-peer (P2P) computing paradigm. Recently, P2P system has received a great amount of interest as a promising scalable and costeffective solution for next-generation multimedia content distribution. This kind of systems have advantages regarding systems based on the client-server paradigm, namely improved scalability and reliability, cheaper infrastructures due to direct communication among peers, and easiness of resource aggregation in order to provide, for instance, massive processing power (Ye, Makedon, & Ford, 2004). However, P2P systems also have some drawbacks, namely the considerably more complex searching and node organization and security issues (Aberer, Punceva, Hauswirth, & Schmidt., 2002). Therefore, this article limits the discussion to low-cost proxy caching strategies for media streaming over Internet.


2007 ◽  
Vol 2007 ◽  
pp. 1-8 ◽  
Author(s):  
Dan Jurca ◽  
Pascal Frossard

We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, according to their sending time. However, the streaming server usually cannot have a perfect knowledge of the channel bandwidth, and important packets may be lost due to late arrival, if the scheduling is based on an over-estimated bandwidth. Robust media streaming techniques should take into account the mismatch between the values of the actual channel bandwidth and its estimation at the server. We address this rate prediction mismatch by media scheduling with a conservative delay, which provides a safety margin for the packet delivery, even in the presence of unpredicted bandwidth variations. We formulate an optimization problem whose goal is to obtain the optimal value for the conservative delay to be used in the scheduling process, given the network model and the actual playback delay imposed by the client. We eventually propose a simple alternative to the computation of the scheduling delay, which is effective in real-time streaming scenarios. Our streaming method proves to be robust against channel prediction errors, and performs better than other robustness mechanisms based on frame reordering strategies.


2012 ◽  
Vol 56 (8) ◽  
pp. 45-49
Author(s):  
Sachin Yadav ◽  
Shailendara Mishra ◽  
Ranjeeta Yadav

Sign in / Sign up

Export Citation Format

Share Document