Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
HTTP http adaptive streaming architectures for video on demand and live TV services
Download
index.pdf
Date
2013
Author
Özcan, Yiğit
Metadata
Show full item record
Item Usage Stats
145
views
100
downloads
Cite This
HTTP Adaptive Streaming (HAS) has become a popular video streaming solution since it both benefits from the ubiquitous HTTP protocol and firewall and NAT traversal capabilities of TCP. HAS aims to provide high Quality of Experience (QoE) to the clients under limited and varying bandwidth by rate adaptation algorithms which allow the clients to choose the most appropriate video quality. A rate adaptation algorithm should utilize the available bandwidth. Furthermore, the received video bitrates should not deviate from each other leading to an unfair bandwidth use among the clients. It is also desired to minimize the rate switches as they degrade QoE of the clients. In this thesis, we propose two architectures that operate on HAS. The first architecture is FEedback based Adaptive STreaming over HTTP (FEAST). FEAST enables the clients to adapt their rates according to the total number of clients, average video rate and the average bandwidth information provided by the server. These values are computed as moving averages by the server with a small amount of information sent from the clients. The server side computation is simple and not client specific which makes FEAST a scalable solution. The second architecture is Adaptive LIVE Streaming over HTTP (ALIVE) which enables a high number of clients to watch live TV channels over HTTP. ALIVE is based on enabling the clients to download the contents from nearby clients instead of the server whenever it is possible. ALIVE employs SVC which makes it possible to adapt the video bitrates of the clients even when they download from other clients. ALIVE decreases the load of the server and accommodates more clients as we demonstrate with simulations.
Subject Keywords
Television.
,
Streaming video.
,
Television
,
Streaming technology (Telecommunications).
URI
http://etd.lib.metu.edu.tr/upload/12616206/index.pdf
https://hdl.handle.net/11511/22786
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Efficient and fair adaptive streaming: algorithm, implementation and evaluation
Öge, Ahmet; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2017)
HTTP Adaptive Streaming (HAS) is a popular video streaming method where the client downloads video segments over standard HTTP protocol. In HAS, the server stores the video segments that are encoded in different qualities which determine the video bit rates. To this end, the client first downloads a file which describes the video segments. Then, using a rate adaptation algorithm, the client decides on the most appropriate video bit rate for the next segment to download and sends an HTTP request for that seg...
Hybrid Fault Tolerant Peer to Peer Video Streaming Architecture
Oeztoprak, Kasim; Akar, Gözde (Institute of Electronics, Information and Communications Engineers (IEICE), 2008-11-01)
In this paper, we propose a fault tolerant hybrid p2p-CDN video streaming arhitecture to overcome the problems caused by peer behavior in peer-to-peer (P2P) video streaming systems. Although there are several studies modeling and analytically investigating peer behaviors in P2P video streaming systems, they do not COMe LIP with a solution to guarantee the required Quality of the Services (QoS). Therefore, in this study a hybrid geographical location-time and interest based clustering algorithm is proposed t...
Optimal streaming of rate adaptable video
Gürses, Eren; Akar, Gözde; Department of Electrical and Electronics Engineering (2006)
In this study, we study the dynamics of network adaptive video streaming and propose novel algorithms for rate distortion control in video streaming. While doing so, we maintain inter-protocol fairness with TCP (Transmission Control Protocol) that is the dominant transport protocol in the current Internet. The proposed algorithms are retransmission-based and necessitate the use of playback buffers in order to tolerate the extra latency introduced by retransmissions. In the first part, we propose a practical...
Cooperative Network Coded ARQ Strategy for Broadcast Networks
Tutgun, Rasit; AKTAŞ, EMRE (2015-06-12)
A novel cooperative automatic repeat request (ARQ) method with network coding is proposed for broadcast networks where single source node broadcasts multiple packets to multiple destinations. Upon a failed transmission, multiple relays cooperate with the source node at the retransmission phase, where network coding is used to combine multiple lost packets. A random access mechanism is employed where retransmission is done according to back-off counters. The proposed method employs the back-off mechanism to ...
Hybrid Data Structure for IP Lookup in Virtual Routers Using FPGAs
Erdem, Oguzhan; Le, Hoang; Prasanna, Viktor K.; Bazlamaçcı, Cüneyt Fehmi (2011-09-14)
Network router virtualization has recently gained much interest in the research community, as it allows multiple virtual router instances to run on a common physical router platform. The key metrics in designing network virtual routers are (1) number of supported virtual router instances, (2) total number of prefixes, and (3) ability to quickly update the virtual table. Existing merging algorithms use leaf pushing and a shared next hop data structure to eliminate the large memory bandwidth requirement. Howe...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Y. Özcan, “HTTP http adaptive streaming architectures for video on demand and live TV services,” M.S. - Master of Science, Middle East Technical University, 2013.