FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W152303293> ?p ?o ?g. }

• W152303293 abstract "With the latest developments in video coding technology and fast deployment of end-user broadband internet connections, real-time media applications become increasingly interesting for both private users and businesses. However, the internet remains a best-effort service network unable to guarantee the stringent requirements of the media application, in terms of high, constant bandwidth, low packet loss rate and transmission delay. Therefore, efficient adaptation mechanisms must be derived in order to bridge the application requirements with the transport medium characteristics. Lately, different network architectures, e.g., peer-to-peer networks, content distribution networks, parallel wireless services, emerge as potential solutions for reducing the cost of communication or infrastructure, and possibly improve the application performance. In this thesis, we start from the path diversity characteristic of these architectures, in order to build a new framework, specific for media streaming in multipath networks. Within this framework we address important issues related to an efficient streaming process, namely path selection and rate allocation, forward error correction and packet scheduling over multiple transmission paths. First we consider a network graph between the streaming server and the client, offering multiple possible transmission paths to the media application. We are interested in finding the optimal subset of paths employed for data transmission, and the optimal rate allocation on these paths, in order to optimize a video distortion metric. Our in-depth analysis of the proposed scenario eventually leads to the derivation of three important theorems, which, in turn represent the basis for an optimal, linear time algorithm that finds the solution to our optimization problem. At the same time, we provide distributed protocols which compute the optimal solution in a distributed way, suitable for large scale network graphs, where a centralized solution is too expensive. Next, we address the problem of forward error correction for scalable media streaming over multiple network paths. We propose various algorithms for error protection in a multipath scenario, and we assess the opportunity of in-network error correction. Our analysis stresses the advantage of being flexible in the scheduling and error correction process on multiple network paths, and emphasizes the limitations of possible real systems implementations, where application choices are limited. Finally, we observe the improvements brought by in-network processing of transmitted media flows, in the case of heterogeneous networks, when link parameters vary greatly. Once the rate allocation and error correction issues are addressed, we discuss the packet scheduling problem over multiple transmission paths. We rely on a scalable bitstream packet model inspired from the media coding process, where media packets have different priorities and dependencies. Based on the concept of data pre-fetch, and on a strict time analysis of the transmission process, we propose fast algorithms for efficient packet scheduling over multiple paths. We ensure media graceful degradation at the client in adverse network conditions by careful load balancing among transmission paths, and by conservative scheduling which transparently absorb undetected network variations, or network estimation errors. The final part of this thesis presents a possible system for media streaming where our proposed mechanisms and protocols can be straightforwardly implemented. We describe a wireless setup where clients can access various applications over possibly multiple wireless services. In this setup, we solve the rate allocation problem with the final goal of maximizing the overall system performance. To this end, we propose a unifying quality metric which maps the individual performance of each application (including streaming) to a common value, later used in the optimization process. We propose a fast algorithm for computing a close to optimal solution to this problem and we show that compared to other traditional methods, we achieve a more fair performance, better adaptable to changing network environments." @default.
• W152303293 created "2016-06-24" @default.
• W152303293 creator A5056852693 @default.
• W152303293 date "2007-01-01" @default.
• W152303293 modified "2023-09-23" @default.
• W152303293 title "Adaptive media streaming over multipath networks" @default.
• W152303293 doi "https://doi.org/10.5075/epfl-thesis-3908" @default.
• W152303293 hasPublicationYear "2007" @default.
• W152303293 type Work @default.
• W152303293 sameAs 152303293 @default.
• W152303293 citedByCount "1" @default.
• W152303293 crossrefType "journal-article" @default.
• W152303293 hasAuthorship W152303293A5056852693 @default.
• W152303293 hasConcept C110875604 @default.
• W152303293 hasConcept C120314980 @default.
• W152303293 hasConcept C127162648 @default.
• W152303293 hasConcept C135554599 @default.
• W152303293 hasConcept C136764020 @default.
• W152303293 hasConcept C158379750 @default.
• W152303293 hasConcept C161218011 @default.
• W152303293 hasConcept C31258907 @default.
• W152303293 hasConcept C41008148 @default.
• W152303293 hasConceptScore W152303293C110875604 @default.
• W152303293 hasConceptScore W152303293C120314980 @default.
• W152303293 hasConceptScore W152303293C127162648 @default.
• W152303293 hasConceptScore W152303293C135554599 @default.
• W152303293 hasConceptScore W152303293C136764020 @default.
• W152303293 hasConceptScore W152303293C158379750 @default.
• W152303293 hasConceptScore W152303293C161218011 @default.
• W152303293 hasConceptScore W152303293C31258907 @default.
• W152303293 hasConceptScore W152303293C41008148 @default.
• W152303293 hasLocation W1523032931 @default.
• W152303293 hasOpenAccess W152303293 @default.
• W152303293 hasPrimaryLocation W1523032931 @default.
• W152303293 hasRelatedWork W1525477782 @default.
• W152303293 hasRelatedWork W1546756868 @default.
• W152303293 hasRelatedWork W1786267965 @default.
• W152303293 hasRelatedWork W2016979835 @default.
• W152303293 hasRelatedWork W2041574933 @default.
• W152303293 hasRelatedWork W2066815822 @default.
• W152303293 hasRelatedWork W2068569342 @default.
• W152303293 hasRelatedWork W2114490182 @default.
• W152303293 hasRelatedWork W2119693362 @default.
• W152303293 hasRelatedWork W2130555906 @default.
• W152303293 hasRelatedWork W2138209332 @default.
• W152303293 hasRelatedWork W2146975297 @default.
• W152303293 hasRelatedWork W2160233994 @default.
• W152303293 hasRelatedWork W2161833445 @default.
• W152303293 hasRelatedWork W2283286837 @default.
• W152303293 hasRelatedWork W2613774252 @default.
• W152303293 hasRelatedWork W2909829829 @default.
• W152303293 hasRelatedWork W2938275972 @default.
• W152303293 hasRelatedWork W3018317585 @default.
• W152303293 hasRelatedWork W45495587 @default.
• W152303293 isParatext "false" @default.
• W152303293 isRetracted "false" @default.
• W152303293 magId "152303293" @default.
• W152303293 workType "article" @default.