In the adaptive video streaming (AVS) literature the term fair sharing has been used to describe equal amounts of bandwidth allocated to adaptive client players. However, we argue that even though bandwidth sharing is an important aspect in some problems the same does not apply to AVS. Here the term relative ‘fair’ sharing is more applicable. The reason is that videos have different quality levels and will require differing amounts of the bandwidth to satisfy their needs. A 90% to 10% sharing may be sufficient for two players, one with high demands and the other with low demands. A 50% sharing may lead the player with the high bandwidth demand to get too little of the needed bandwidth resource. In addition, channel conditions may lead to players requiring different amount of bandwidth. Again, the concept of fair sharing has to be extended to relative ‘fair’ sharing for such scenarios. Hence, bandwidth estimation techniques players use to estimate the network bandwidth is very important in segment selection. A player utilizes one of the many techniques to determine what share of the bandwidth it can utilize among competing players. In this paper we explore some of the techniques used in state of-the-art players in their attempt to obtain a ‘fair’ share of the network bandwidth.
What happens when adaptive video streaming players compete in time-varying ba...Eswar Publications
Competition among adaptive video streaming players severely diminishes user-QoE. When players compete at a bottleneck link many do not obtain adequate resources. This imbalance eventually causes ill effects such as screen flickering and video stalling. There have been many attempts in recent years to overcome some of these problems. However, added to the competition at the bottleneck link there is also the possibility of varying network bandwidth which can make the situation even worse. This work focuses on such a situation. It evaluates current heuristic adaptive video players at a bottleneck link with time-varying bandwidth conditions. Experimental setup includes the TAPAS player and emulated network conditions. The results show PANDA outperforms FESTIVE, ELASTIC and the Conventional players.
Implementing a Caching Scheme for Media Streaming in a Proxy ServerAbdelrahman Hosny
In the past few years, websites have moved from being
static web pages into rich media applications that use audio,
images and videos heavily in their interaction with users. This
change has made a dramatic change in network traffics
nowadays. Organizations spend a lot of effort, time and money
to improve response time and design intermediary systems that
enhance overall user experience. Media traffic represents
about 69.9-88.8% of all traffic. Therefore, enhancing networks
to accommodate this large traffic is a major trend. Content
Distribution Networks (CDNs) are now largely deployed for a
faster delivery of media. Redundancy and caching are also
implemented to decrease response time.
In this project, we are implementing a caching scheme for
media streaming in a proxy server. Unlike CDNs, which
require huge infrastructure, our caching proxy server will be
as simple as a piece of software that is portable and can be
installed in small as well as large scales. It may be deployed in
a university network, company’s private network or on ISPs
servers. This caching scheme, specially tailored for media
streaming, will reduce traffic and enhance network efficiency
in general.
Index Terms – Proxy servers, Caching, Media streaming
In the support of congestion control over the Internet
in providing the assurance of the equality between much diverse
traffic is a difficult function. The advent of streaming media has
offered users with low-latency media content, with higher
congestion on the Internet due to stringent bandwidth and
latency requirements. Therefore, it is more and more important
to resolve the difficulties of increased packet deliver fail reasoned
because of congestion and better quality of service for streaming
media. In this paper, we propose a review on the congestion
control approaches (CCA) for the real-time streaming
applications on the Internet. The role of TCP in network
congestion control and the characteristics of the original realtime
streaming media are discussed. After that, we discuss issues
in the media stream and real-time congestion control. The survey
will support the understanding of the current congestion
mechanism and continue to enhance the expansion of real-time
streaming application services.
Internet Path Selection on Video QoE Analysis and ImprovementsIJTET Journal
Abstract— Systematically study a large number of Internet paths between popular video destinations and clients to create an empirical understanding of the location, existence, and repetition of failures. Finding ways to lower a providers costs for real-time, Internet protocol television services through a Internet protocol television architecture and through intelligent destination-shifting of selected services investigate ways to recover from Quality of Experience degradation. Using Live Television and Video on Demand as examples, we can take advantage of the different deadlines associated with each service to effectively obtain these services. Designing and implementing a prototype packet forwarding module called source initiated frame restoration. We implemented source initiated frame restoration on nodes and compared the performance of source initiated frame restoration to the default Internet routing. We found that source initiated frame restoration outperforms IP path selection by providing higher on-screen perceptual quality. These failures are mapped to the desired video quality in need by reconstructing video clips and by conducting user surveys. We can then examine ways to recover from Quality of Experience degradation by choosing one hop detour paths that preserve application specific policies. Path ranking methodology is used to find the path which contain high quality videos with low cost and occupies very low memory space. By ranking videos according to their quality, size, and cost, the top ranking videos can be retrieved by the client.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
The Effect of Seeking Operation on QoE of HTTP Adaptive Streaming ServicesIJCNCJournal
In this paper, we assess multidimensional QoE (Quality of Experience) of HTTP-based streaming services
in seeking operation to evaluate the effect of two transmission schemes: adaptive bitrate streaming and
progressive download. We perform a subjective experiment with two contents and various network load
conditions. In the experiment, subjects find pre-specified scenes by means of seeking the video as they want
to see the scenes right now. We also perform the principal component analysis for the assessment result of
multidimensional QoE. We then find that the adaptive bitrate streaming is not necessarily effective for QoE
enhancement; the effectiveness of the scheme depends on the usage of the system and network conditions.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the development of distributed P2P block schedulers for content exchange among the participating peers and on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed monitoring and control architectures that use resources from the cloud in order to enhance QoS and achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network congestion, and v) is friendly to traditional TCP generated traffic.The proposed P2P congestion control has been implemented, tested and evaluated through a series of real experiments powered across the BonFIRE infrastructure.
What happens when adaptive video streaming players compete in time-varying ba...Eswar Publications
Competition among adaptive video streaming players severely diminishes user-QoE. When players compete at a bottleneck link many do not obtain adequate resources. This imbalance eventually causes ill effects such as screen flickering and video stalling. There have been many attempts in recent years to overcome some of these problems. However, added to the competition at the bottleneck link there is also the possibility of varying network bandwidth which can make the situation even worse. This work focuses on such a situation. It evaluates current heuristic adaptive video players at a bottleneck link with time-varying bandwidth conditions. Experimental setup includes the TAPAS player and emulated network conditions. The results show PANDA outperforms FESTIVE, ELASTIC and the Conventional players.
Implementing a Caching Scheme for Media Streaming in a Proxy ServerAbdelrahman Hosny
In the past few years, websites have moved from being
static web pages into rich media applications that use audio,
images and videos heavily in their interaction with users. This
change has made a dramatic change in network traffics
nowadays. Organizations spend a lot of effort, time and money
to improve response time and design intermediary systems that
enhance overall user experience. Media traffic represents
about 69.9-88.8% of all traffic. Therefore, enhancing networks
to accommodate this large traffic is a major trend. Content
Distribution Networks (CDNs) are now largely deployed for a
faster delivery of media. Redundancy and caching are also
implemented to decrease response time.
In this project, we are implementing a caching scheme for
media streaming in a proxy server. Unlike CDNs, which
require huge infrastructure, our caching proxy server will be
as simple as a piece of software that is portable and can be
installed in small as well as large scales. It may be deployed in
a university network, company’s private network or on ISPs
servers. This caching scheme, specially tailored for media
streaming, will reduce traffic and enhance network efficiency
in general.
Index Terms – Proxy servers, Caching, Media streaming
In the support of congestion control over the Internet
in providing the assurance of the equality between much diverse
traffic is a difficult function. The advent of streaming media has
offered users with low-latency media content, with higher
congestion on the Internet due to stringent bandwidth and
latency requirements. Therefore, it is more and more important
to resolve the difficulties of increased packet deliver fail reasoned
because of congestion and better quality of service for streaming
media. In this paper, we propose a review on the congestion
control approaches (CCA) for the real-time streaming
applications on the Internet. The role of TCP in network
congestion control and the characteristics of the original realtime
streaming media are discussed. After that, we discuss issues
in the media stream and real-time congestion control. The survey
will support the understanding of the current congestion
mechanism and continue to enhance the expansion of real-time
streaming application services.
Internet Path Selection on Video QoE Analysis and ImprovementsIJTET Journal
Abstract— Systematically study a large number of Internet paths between popular video destinations and clients to create an empirical understanding of the location, existence, and repetition of failures. Finding ways to lower a providers costs for real-time, Internet protocol television services through a Internet protocol television architecture and through intelligent destination-shifting of selected services investigate ways to recover from Quality of Experience degradation. Using Live Television and Video on Demand as examples, we can take advantage of the different deadlines associated with each service to effectively obtain these services. Designing and implementing a prototype packet forwarding module called source initiated frame restoration. We implemented source initiated frame restoration on nodes and compared the performance of source initiated frame restoration to the default Internet routing. We found that source initiated frame restoration outperforms IP path selection by providing higher on-screen perceptual quality. These failures are mapped to the desired video quality in need by reconstructing video clips and by conducting user surveys. We can then examine ways to recover from Quality of Experience degradation by choosing one hop detour paths that preserve application specific policies. Path ranking methodology is used to find the path which contain high quality videos with low cost and occupies very low memory space. By ranking videos according to their quality, size, and cost, the top ranking videos can be retrieved by the client.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
The Effect of Seeking Operation on QoE of HTTP Adaptive Streaming ServicesIJCNCJournal
In this paper, we assess multidimensional QoE (Quality of Experience) of HTTP-based streaming services
in seeking operation to evaluate the effect of two transmission schemes: adaptive bitrate streaming and
progressive download. We perform a subjective experiment with two contents and various network load
conditions. In the experiment, subjects find pre-specified scenes by means of seeking the video as they want
to see the scenes right now. We also perform the principal component analysis for the assessment result of
multidimensional QoE. We then find that the adaptive bitrate streaming is not necessarily effective for QoE
enhancement; the effectiveness of the scheme depends on the usage of the system and network conditions.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the development of distributed P2P block schedulers for content exchange among the participating peers and on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed monitoring and control architectures that use resources from the cloud in order to enhance QoS and achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network congestion, and v) is friendly to traditional TCP generated traffic.The proposed P2P congestion control has been implemented, tested and evaluated through a series of real experiments powered across the BonFIRE infrastructure.
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...paperpublications3
Abstract: Smart phone provides many multimedia services for mobile users. Most of these smart phones are equipped with multiple wireless network interfaces (that support real time video processing. How to use efficiently and cost-effectively utilize multiple links to improve video streaming quality over multiple wireless access networks . In order to maintain high video streaming quality while reducing the wireless service cost, In Video quality-adaptive streaming, the optimal video streaming process with multiple links is formulated as a Markov Decision Process (MDP). The reward function is designed to consider the quality of service (QoS) requirements for video traffic, such as the startup latency, playback fluency, average playback quality, playback smoothness and wireless service cost. To solve the MDP in real time, Quality-adaptive streaming propose an Adaptive search Depth algorithm to obtain a sub-optimal solution.
Enrich multi-channel P2P VoD streaming based on dynamic replication strategyIJAAS Team
Peer-to-Peer Video-on-Demand (VoD) is a favorable solution which compromises thousands of videos to millions of users with completeinteractive video watching stream. Most of the profitable P2P streaming groupsPPLive, PPStream and UUSee have announced a multichannel P2P VoD system that approvals user to view extra one channel at a time. The present multiple channel P2P VoD system resonant a video at a low streaming rate due to the channel resource inequity and channel churn. In order to growth the streaming capacity, this paper highlights completely different effective helpers created resource balancing scheme that actively recognizes the supply-and-demand inequity in multiple channels. Moreover, peers in an extra channel help its unused bandwidth resources to peers in a shortage channel that minimizes the server bandwidth consumption. To provide a desired replication ratio for optimal caching, it develops a dynamic replication strategy that optimally tunes the number of replicas based on dynamic popularity in a distributed and dynamic routine. This work accurately forecasts the varying popularity over time using Auto-Regressive Integrated Moving Average (ARIMA) model, an effective time-series forecasting technique that supports dynamic environment. Experimental assessment displays that the offered dynamic replication strategy which should achieves high streaming capacity under reduced server workload when associated to existing replication algorithms.
Benefits across multiple dimensions:
Remove capacity bottlenecks in the streaming media workflows;
Flexibility to scale resources and associated operational costs with the demand;
Right-size encoding and streaming infrastructure;
Eliminate the necessity for capital investments in dedicated encoding systems;
Full flexibility to choose quality and speed of encoding; and
Reduce reliance on specific technical encoding/streaming expertise.
Some of the newer CDN technologies can address the logic level in a number of innovative ways. First, they can more intelligently cache information close to end users with mobile devices, and use the location as a cache-key. So, for example, a weather site can, with this type of logic, cache appropriate detailed weather information for a user in the CDN based on their initial GPS contact point. This weather data can be later served to other users located a few blocks away, eliminating the need for additional round trips.
Server-based and Network-assisted Solutions for Adaptive Video StreamingEswar Publications
Server-based adaptive video streaming is gaining popularity in recent years. This is because clients (client-based) and in-network devices (network or proxy-based) are not powerful enough to run state of the art adaptation algorithms, for example, traffic shaping and machine learning. When decision making is placed at the server new and exciting possibilities are obtained for next best segment selection. This work highlights server-based solutions to adaptive video streaming. It provides a taxonomy of current state of the art solutions. It then illustrates various approaches used for server-based adaptive video streaming. Advantages and disadvantages are discussed.
Network-assisted or in-network DASH solutions have certain advantages over traditional client-based approaches. It is proposed that the sharing of information would result in better network and client bandwidth estimations.
This measure would ensure better next segment selections. In this paper a novel network-assisted DASH taxonomy is proposed. It consists of cache-based, optimization, rate-quality model, and co-operative elements. Recent approaches using the elements of the taxonomy are illustrated. These approaches show the advantages of using network-assisted entities in DASH-based systems.
Over recent years there has been a considerable shift, from quality of service (QoS) to quality of experience (QoE), when evaluating video delivery across networks. Hence, we first explore the need for this shift towards user-QoE in the video delivery ecosystem. Further, we investigate major QoE metrics researchers use in the evaluation of DASH users. We point out a huge problem with DASH beginning with its transport layer protocol. DASH utilizes Transmission control protocol (TCP) as the transport layer protocol. Thus, we give an overview of the mechanism of Transmission Control Protocol (TCP) and two mechanisms greatly impacting the streaming process: (1) TCP
congestion mechanism and (2) TCP Fast Start. This leads us to investigate the impact of these TCP mechanisms on DASH players and consequently user-QoE.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
An SDN Based Approach To Measuring And Optimizing ABR Video Quality Of Experi...Cisco Service Provider
Reprinted with permission of NCTA, from the 2014 Cable Connection Spring Technical Forum Conference Proceedings. For more information on Cisco video solutions, visit: http://www.cisco.com/c/en/us/products/video/index.html
A NOVEL ADAPTIVE CACHING MECHANISM FOR VIDEO ON DEMAND SYSTEM OVER WIRELESS M...IJCNCJournal
Video on Demand (VOD) system over the wireless mobile network is a system that provides video services to mobile clients. The main problem with these systems is the high service delay where the mobile clients have to wait to view their favorite movie. The importance of this paper is based on finding a solution on how to reduce the delay time in the VOD system. This paper introduces a novel caching mechanism named
Proxy Server Cache mechanism to tackle the issue of service delay. This delay happens when the broadcasting phase that is related to the first segment is missed by a client from the current broadcasting channels. In this mechanism, the video’s first segment is stored on a server of a stationary proxy type. The
delayed clients will directly acquire the first segment from the proxy server instead of waiting for the following broadcasting channel pertaining to the first segment. The proposed scheme ensuresobtaining the first segment from mobile clients when they arrive. Additionally, the performance of the proposed scheme is validated by applying the VOD system, which can involve the balancing mechanism to retain particular requests through to the local proxy server to provide a fair dissemination for these requests. The obtained result confirms that the proposed scheme reduces the time delay of the system in comparison with the best existing schemes. The results of the average time delay in the Proxy-Cache scheme is 179.2505
milliseconds when 10 clients arrive each minute (Client/minute), the average time delay is 140 milliseconds when the video lengths are 30, 60 and 90. Meanwhile, the failure probability for obtaining the first segment of the video remains zero when the number of arrived requests is set to2, 4, 6, 8 and 10.
SAND and Cloud-based Strategies for Adaptive Video StreamingEswar Publications
A new architecture for defining network collaboration in DASH is called SAND. It aims to standardize communication amongst network agents participating in the streaming process. This work produces a novel taxonomy for SAND-based approaches. It places AVS solutions into four categories: (1) Management Architecture (2) Cache-based, (3) Optimization, and (4) Paradigm. Sub-categories of Management Architecture are (a)
Cognitive, (b) Prioritization, and (c) Encoding and Signaling, while sub-categories of Paradigm are (a) SDN-based,
(b) CDN-based, and (c) CCN-based. The approaches representing each category are presented. It is shown that
using the SANDs architecture proves beneficial to approaches adopting it. In recent years Cloud-based strategies for AVS have been an important area of research and industry. This paper elaborates on Cloud-based strategies.
It places current strategies into a taxonomy. The Cloud-based AVS strategies are categorized into (1) Social Awareness,
(2) Cloud-based CDN, (3) Cloud-based Gaming, (4) Cloud-based SDN, (5) File-hosting services, (6)
View synthesis techniques, and (7) Error Concealment techniques. The implementations that exist for the Cloudbased
strategies are discussed. Thus, the advantages of both SAND and Cloud-based approaches for use in DASH based
systems are illustrated.
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...paperpublications3
Abstract: Smart phone provides many multimedia services for mobile users. Most of these smart phones are equipped with multiple wireless network interfaces (that support real time video processing. How to use efficiently and cost-effectively utilize multiple links to improve video streaming quality over multiple wireless access networks . In order to maintain high video streaming quality while reducing the wireless service cost, In Video quality-adaptive streaming, the optimal video streaming process with multiple links is formulated as a Markov Decision Process (MDP). The reward function is designed to consider the quality of service (QoS) requirements for video traffic, such as the startup latency, playback fluency, average playback quality, playback smoothness and wireless service cost. To solve the MDP in real time, Quality-adaptive streaming propose an Adaptive search Depth algorithm to obtain a sub-optimal solution.
Enrich multi-channel P2P VoD streaming based on dynamic replication strategyIJAAS Team
Peer-to-Peer Video-on-Demand (VoD) is a favorable solution which compromises thousands of videos to millions of users with completeinteractive video watching stream. Most of the profitable P2P streaming groupsPPLive, PPStream and UUSee have announced a multichannel P2P VoD system that approvals user to view extra one channel at a time. The present multiple channel P2P VoD system resonant a video at a low streaming rate due to the channel resource inequity and channel churn. In order to growth the streaming capacity, this paper highlights completely different effective helpers created resource balancing scheme that actively recognizes the supply-and-demand inequity in multiple channels. Moreover, peers in an extra channel help its unused bandwidth resources to peers in a shortage channel that minimizes the server bandwidth consumption. To provide a desired replication ratio for optimal caching, it develops a dynamic replication strategy that optimally tunes the number of replicas based on dynamic popularity in a distributed and dynamic routine. This work accurately forecasts the varying popularity over time using Auto-Regressive Integrated Moving Average (ARIMA) model, an effective time-series forecasting technique that supports dynamic environment. Experimental assessment displays that the offered dynamic replication strategy which should achieves high streaming capacity under reduced server workload when associated to existing replication algorithms.
Benefits across multiple dimensions:
Remove capacity bottlenecks in the streaming media workflows;
Flexibility to scale resources and associated operational costs with the demand;
Right-size encoding and streaming infrastructure;
Eliminate the necessity for capital investments in dedicated encoding systems;
Full flexibility to choose quality and speed of encoding; and
Reduce reliance on specific technical encoding/streaming expertise.
Some of the newer CDN technologies can address the logic level in a number of innovative ways. First, they can more intelligently cache information close to end users with mobile devices, and use the location as a cache-key. So, for example, a weather site can, with this type of logic, cache appropriate detailed weather information for a user in the CDN based on their initial GPS contact point. This weather data can be later served to other users located a few blocks away, eliminating the need for additional round trips.
Server-based and Network-assisted Solutions for Adaptive Video StreamingEswar Publications
Server-based adaptive video streaming is gaining popularity in recent years. This is because clients (client-based) and in-network devices (network or proxy-based) are not powerful enough to run state of the art adaptation algorithms, for example, traffic shaping and machine learning. When decision making is placed at the server new and exciting possibilities are obtained for next best segment selection. This work highlights server-based solutions to adaptive video streaming. It provides a taxonomy of current state of the art solutions. It then illustrates various approaches used for server-based adaptive video streaming. Advantages and disadvantages are discussed.
Network-assisted or in-network DASH solutions have certain advantages over traditional client-based approaches. It is proposed that the sharing of information would result in better network and client bandwidth estimations.
This measure would ensure better next segment selections. In this paper a novel network-assisted DASH taxonomy is proposed. It consists of cache-based, optimization, rate-quality model, and co-operative elements. Recent approaches using the elements of the taxonomy are illustrated. These approaches show the advantages of using network-assisted entities in DASH-based systems.
Over recent years there has been a considerable shift, from quality of service (QoS) to quality of experience (QoE), when evaluating video delivery across networks. Hence, we first explore the need for this shift towards user-QoE in the video delivery ecosystem. Further, we investigate major QoE metrics researchers use in the evaluation of DASH users. We point out a huge problem with DASH beginning with its transport layer protocol. DASH utilizes Transmission control protocol (TCP) as the transport layer protocol. Thus, we give an overview of the mechanism of Transmission Control Protocol (TCP) and two mechanisms greatly impacting the streaming process: (1) TCP
congestion mechanism and (2) TCP Fast Start. This leads us to investigate the impact of these TCP mechanisms on DASH players and consequently user-QoE.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
An SDN Based Approach To Measuring And Optimizing ABR Video Quality Of Experi...Cisco Service Provider
Reprinted with permission of NCTA, from the 2014 Cable Connection Spring Technical Forum Conference Proceedings. For more information on Cisco video solutions, visit: http://www.cisco.com/c/en/us/products/video/index.html
A NOVEL ADAPTIVE CACHING MECHANISM FOR VIDEO ON DEMAND SYSTEM OVER WIRELESS M...IJCNCJournal
Video on Demand (VOD) system over the wireless mobile network is a system that provides video services to mobile clients. The main problem with these systems is the high service delay where the mobile clients have to wait to view their favorite movie. The importance of this paper is based on finding a solution on how to reduce the delay time in the VOD system. This paper introduces a novel caching mechanism named
Proxy Server Cache mechanism to tackle the issue of service delay. This delay happens when the broadcasting phase that is related to the first segment is missed by a client from the current broadcasting channels. In this mechanism, the video’s first segment is stored on a server of a stationary proxy type. The
delayed clients will directly acquire the first segment from the proxy server instead of waiting for the following broadcasting channel pertaining to the first segment. The proposed scheme ensuresobtaining the first segment from mobile clients when they arrive. Additionally, the performance of the proposed scheme is validated by applying the VOD system, which can involve the balancing mechanism to retain particular requests through to the local proxy server to provide a fair dissemination for these requests. The obtained result confirms that the proposed scheme reduces the time delay of the system in comparison with the best existing schemes. The results of the average time delay in the Proxy-Cache scheme is 179.2505
milliseconds when 10 clients arrive each minute (Client/minute), the average time delay is 140 milliseconds when the video lengths are 30, 60 and 90. Meanwhile, the failure probability for obtaining the first segment of the video remains zero when the number of arrived requests is set to2, 4, 6, 8 and 10.
SAND and Cloud-based Strategies for Adaptive Video StreamingEswar Publications
A new architecture for defining network collaboration in DASH is called SAND. It aims to standardize communication amongst network agents participating in the streaming process. This work produces a novel taxonomy for SAND-based approaches. It places AVS solutions into four categories: (1) Management Architecture (2) Cache-based, (3) Optimization, and (4) Paradigm. Sub-categories of Management Architecture are (a)
Cognitive, (b) Prioritization, and (c) Encoding and Signaling, while sub-categories of Paradigm are (a) SDN-based,
(b) CDN-based, and (c) CCN-based. The approaches representing each category are presented. It is shown that
using the SANDs architecture proves beneficial to approaches adopting it. In recent years Cloud-based strategies for AVS have been an important area of research and industry. This paper elaborates on Cloud-based strategies.
It places current strategies into a taxonomy. The Cloud-based AVS strategies are categorized into (1) Social Awareness,
(2) Cloud-based CDN, (3) Cloud-based Gaming, (4) Cloud-based SDN, (5) File-hosting services, (6)
View synthesis techniques, and (7) Error Concealment techniques. The implementations that exist for the Cloudbased
strategies are discussed. Thus, the advantages of both SAND and Cloud-based approaches for use in DASH based
systems are illustrated.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
International Journal of Peer to Peer Networks (IJP2P) Vol.6, No.2, August 20...ijp2p
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure.
Similar to Bandwidth Estimation Techniques for Relative ‘Fair’ Sharing in DASH (20)
Content-Based Image Retrieval (CBIR) systems have been used for the searching of relevant images in various research areas. In CBIR systems features such as shape, texture and color are used. The extraction of features is the main step on which the retrieval results depend. Color features in CBIR are used as in the color histogram, color moments, conventional color correlogram and color histogram. Color space selection is used to represent the information of color of the pixels of the query image. The shape is the basic characteristic of segmented regions of an image. Different methods are introduced for better retrieval using different shape representation techniques; earlier the global shape representations were used but with time moved towards local shape representations. The local shape is more related to the expressing of result instead of the method. Local shape features may be derived from the texture properties and the color derivatives. Texture features have been used for images of documents, segmentation-based recognition,and satellite images. Texture features are used in different CBIR systems along with color, shape, geometrical structure and sift features.
The cyber attacks have become most prevalent in the past few years. During this time, attackers have discovered new vulnerabilities to carry out malicious activities on the internet. Both the clients and the servers have been victimized by the attackers. Clickjacking is one of the attacks that have been adopted by the attackers to deceive the innocuous internet users to initiate some action. Clickjacking attack exploits one of the vulnerabilities existing in the web applications. This attack uses a technique that allows cross domain attacks with the help of userinitiated clicks and performs unintended actions. This paper traces out the vulnerabilities that make a website vulnerable to clickjacking attack and proposes a solution for the same.
Performance Analysis of Audio and Video Synchronization using Spreaded Code D...Eswar Publications
The audio and video synchronization plays an important role in speech recognition and multimedia communication. The audio-video sync is a quite significant problem in live video conferencing. It is due to use of various hardware components which introduces variable delay and software environments. The objective of the synchronization is used to preserve the temporal alignment between the audio and video signals. This paper proposes the audio-video synchronization using spreading codes delay measurement technique. The performance of the proposed method made on home database and achieves 99% synchronization efficiency. The audio-visual
signature technique provides a significant reduction in audio-video sync problems and the performance analysis of audio and video synchronization in an effective way. This paper also implements an audio- video synchronizer and analyses its performance in an efficient manner by synchronization efficiency, audio-video time drift and audio-video delay parameters. The simulation result is carried out using mat lab simulation tools and simulink. It is automatically estimating and correcting the timing relationship between the audio and video signals and maintaining the Quality of Service.
Due to the availability of complicated devices in industry, models for consumers at lower cost of resources are developed. Home Automation systems have been developed by several researchers. The limitations of home automation includes complexity in architecture, higher costs of the equipment, interface inflexibility. In this paper as we have proposed, the working protocol of PIC 16F72 technology is which is secure, cost efficient, flexible that leads to the development of efficient home automation systems. The system is operational to control various home appliances like fans, Bulbs, Tube light. The following paper describes about components used and working of all components connected. The home automation system makes use of Android app entitled “Home App” which gives
flexibility and easy to use GUI.
Semantically Enchanced Personalised Adaptive E-Learning for General and Dysle...Eswar Publications
E-learning plays an important role in providing required and well formed knowledge to a learner. The medium of e- learning has achieved advancement in various fields such as adaptive e-learning systems. The need for enhancing e-learning semantically can enhance the retrieval and adaptability of the learning curriculum. This paper provides a semantically enhanced module based e-learning for computer science programme on a learnercentric perspective. The learners are categorized based on their proficiency for providing personalized learning environment for users. Learning disorders on the platform of e-learning still require lots of research. Therefore, this paper also provides a personalized assessment theoretical model for alphabet learning with learning objects for
children’s who face dyslexia.
Agriculture plays an important role in the economy of our country. Over 58 percent of the rural households depend on the agriculture sector as their means of livelihood. Agriculture is one of the major contributors to Gross Domestic Product(GDP). Seeds are the soul of agriculture. This application helps in reducing the time for the researchers as well as farmers to know the seedling parameters. The application helps the farmers to know about the percentage of seedlings that will grow and it is very essential in estimating the yield of that particular crop. Manual calculation may lead to some error, to minimize that error, the developed app is used. The scientist and farmers require the app to know about the physiological seed quality parameters and to take decisions regarding their farming activities. In this article a desktop app for seed germination percentage and vigour index calculation are developed in PHP scripting language.
WLI-FCM and Artificial Neural Network Based Cloud Intrusion Detection SystemEswar Publications
Security and Performance aspects of cloud computing are the major issues which have to be tended to in Cloud Computing. Intrusion is one such basic and imperative security problem for Cloud Computing. Consequently, it is essential to create an Intrusion Detection System (IDS) to detect both inside and outside assaults with high detection precision in cloud environment. In this paper, cloud intrusion detection system at hypervisor layer is developed and assesses to detect the depraved activities in cloud computing environment. The cloud intrusion detection system uses a hybrid algorithm which is a fusion of WLI- FCM clustering algorithm and Back propagation artificial Neural Network to improve the detection accuracy of the cloud intrusion detection system. The proposed system is implemented and compared with K-means and classic FCM. The DARPA’s KDD cup dataset 1999 is used for simulation. From the detailed performance analysis, it is clear that the proposed system is able to detect the anomalies with high detection accuracy and low false alarm rate.
Spreading Trade Union Activities through Cyberspace: A Case StudyEswar Publications
This report present the outcome of an investigative research conducted to examine the modu-operandi of academic staff union of polytechnics (ASUP) YabaTech. The investigation covered the logistics and cost implication for spreading union activities among members. It was discovered that cost of management and dissemination of information to members was at high side, also logistics problem constitutes to loss of information in transit hence cut away some members from union activities. To curtail the problem identified, we proposed the
design of secure and dynamic website for spreading union activities among members and public. The proposed system was implemented using HTML5 technology, interface frameworks like Bootstrap and j query which enables the responsive feature of the application interface. The backend was designed using PHPMYSQL. It was discovered from the evaluation of the new system that cost of managing information has reduced considerably, and logistic problems identified in the old system has become a forgotten issue.
Identifying an Appropriate Model for Information Systems Integration in the O...Eswar Publications
Nowadays organizations are using information systems for optimizing processes in order to increase coordination and interoperability across the organizations. Since Oil and Gas Industry is one of the large industries in whole of the world, there is a need to compatibility of its Information Systems (IS) which consists three categories of systems: Field IS, Plant IS and Enterprise IS to create interoperability and approach the
optimizing processes as its result. In this paper we introduce the different models of information systems integration, identify the types of information systems that are using in the upstream and downstream sectors of petroleum industry, and finally based on expert’s opinions will identify a suitable model for information systems integration in this industry.
Link-and Node-Disjoint Evaluation of the Ad Hoc on Demand Multi-path Distance...Eswar Publications
This work illustrates the AOMDV routing protocol. Its ancestor, the AODV routing protocol is also described. This tutorial demonstrates how forward and reverse paths are created by the AOMDV routing protocol. Loop free paths formulation is described, together with node and link disjoint paths. Finally, the performance of the AOMDV routing protocol is investigated along link and node disjoint paths. The WSN with the AOMDV routing protocol using link disjoint paths is better than the WSN with the AOMDV routing protocol using node disjoint paths for energy consumption.
Bridging Centrality: Identifying Bridging Nodes in Transportation NetworkEswar Publications
To identify the importance of node of a network, several centralities are used. Majority of these centrality measures are dominated by components' degree due to their nature of looking at networks’ topology. We propose a centrality to identification model, bridging centrality, based on information flow and topological aspects. We apply bridging centrality on real world networks including the transportation network and show that the nodes distinguished by bridging centrality are well located on the connecting positions between highly connected regions. Bridging centrality can discriminate bridging nodes, the nodes with more information flowed through them and locations between highly connected regions, while other centrality measures cannot.
Now a days we are living in an era of Information Technology where each and every person has to become IT incumbent either intentionally or unintentionally. Technology plays a vital role in our day to day life since last few decades and somehow we all are depending on it in order to obtain maximum benefit and comfort. This new era equipped with latest advents of technology, enlightening world in the form of Internet of Things (IoT). Internet of things is such a specified and dignified domain which leads us to the real world scenarios where each object can perform some task while communicating with some other objects. The world with full of devices, sensors and other objects which will communicate and make human life far better and easier than ever. This paper provides an overview of current research work on IoT in terms of architecture, a technology used and applications. It also highlights all the issues related to technologies used for IoT, after the literature review of research work. The main purpose of this survey is to provide all the latest technologies, their corresponding
trends and details in the field of IoT in systematic manner. It will be helpful for further research.
Automatic Monitoring of Soil Moisture and Controlling of Irrigation SystemEswar Publications
In past couple of decades, there is immediate growth in field of agricultural technology. Utilization of proper method of irrigation by drip is very reasonable and proficient. A various drip irrigation methods have been proposed, but they have been found to be very luxurious and dense to use. The farmer has to maintain watch on irrigation schedule in the conventional drip irrigation system, which is different for different types of crops. In remotely monitored embedded system for irrigation purposes have become a new essential for farmer to accumulate his energy, time and money and will take place only when there will be requirement of water. In this approach, the soil test for chemical constituents, water content, and salinity and fertilizer requirement data collected by wireless and processed for better drip irrigation plan. This paper reviews different monitoring systems and proposes an automatic monitoring system model using Wireless Sensor Network (WSN) which helps the farmer to improve the yield.
Multi- Level Data Security Model for Big Data on Public Cloud: A New ModelEswar Publications
With the advent of cloud computing the big data has emerged as a very crucial technology. The certain type of cloud provides the consumers with the free services like storage, computational power etc. This paper is intended to make use of infrastructure as a service where the storage service from the public cloud providers is going to leveraged by an individual or organization. The paper will emphasize the model which can be used by anyone without any cost. They can store the confidential data without any type of security issue, as the data will be altered
in such a way that it cannot be understood by the intruder if any. Not only that but the user can retrieve back the original data within no time. The proposed security model is going to effectively and efficiently provide a robust security while data is on cloud infrastructure as well as when data is getting migrated towards cloud infrastructure or vice versa.
Impact of Technology on E-Banking; Cameroon PerspectivesEswar Publications
The financial services industry is experiencing rapid changes in services delivery and channels usage, and financial companies and users of financial services are looking at new technologies as they emerge and deciding whether or not to embrace them and the new opportunities to save and manage enormous time, cost and stress.
There is no doubt about the favourable and manifold impact of technology on e-banking as pictured in this review paper, almost all banks are with the least and most access e-banking Technological equipments like ATMs and Cards. On the other Hand cheap and readily available technology has opened a favourable competition in ebanking services business with a lot of wide range competitors competing with Commercial Banks in Cameroon in providing digital financial services.
Classification Algorithms with Attribute Selection: an evaluation study using...Eswar Publications
Attribute or feature selection plays an important role in the process of data mining. In general the data set contains more number of attributes. But in the process of effective classification not all attributes are relevant.
Attribute selection is a technique used to extract the ranking of attributes. Therefore, this paper presents a comparative evaluation study of classification algorithms before and after attribute selection using Waikato Environment for Knowledge Analysis (WEKA). The evaluation study concludes that the performance metrics of the classification algorithm, improves after performing attribute selection. This will reduce the work of processing irrelevant attributes.
Mining Frequent Patterns and Associations from the Smart meters using Bayesia...Eswar Publications
In today’s world migration of people from rural areas to urban areas is quite common. Health care services are one of the most challenging aspect that is must require to the people with abnormal health. Advancements in the technologies lead to build the smart homes, which contains various sensor or smart meter devices to automate the process of other electronic device. Additionally these smart meters can be able to capture the daily activities of the patients and also monitor the health conditions of the patients by mining the frequent patterns and
association rules generated from the smart meters. In this work we proposed a model that is able to monitor the activities of the patients in home and can send the daily activities to the corresponding doctor. We can extract the frequent patterns and association rules from the log data and can predict the health conditions of the patients and can give the suggestions according to the prediction. Our work is divided in to three stages. Firstly, we used to record the daily activities of the patient using a specific time period at three regular intervals. Secondly we applied the frequent pattern growth for extracting the association rules from the log file. Finally, we applied k means clustering for the input and applied Bayesian network model to predict the health behavior of the patient and precautions will be given accordingly.
Network as a Service Model in Cloud Authentication by HMAC AlgorithmEswar Publications
Resource pooling on internet-based accessing on use as pay environmental technology and ruled in IT field is the
cloud. Present, in every organization has trusted the web, however, the information must flow but not hold the
data. Therefore, all customers have to use the cloud. While the cloud progressing info by securing-protocols. Third
party observing and certain circumstances directly stale in flow and kept of packets in the virtual private cloud.
Global security statistics in the year 2017, hacking sensitive information in cloud approximately maybe 75.35%,
and the world security analyzer said this calculation maybe reached to 100%. For this cause, this proposed
research work concentrates on Authentication-Message-Digest-Key with authentication in routing the Network as
a Service of packets in OSPF (Open Shortest Path First) implementing Cloud with GNS3 has tested them to
securing from attackers.
Microstrip patch antennas are recently used in wireless detection applications due to their low power consumption, low cost, versatility, field excitation, ease of fabrication etc. The microstrip patch antennas are also called as printed antennas which is suffer with an array elements of antenna and narrow bandwidth. To overcome the above drawbacks, Flame Retardant Material is used as the substrate. Rectangular shape of microstrip patch antenna with FR4 material as the substrate which is more suitable for the explosive detection applications. The proposed printed antenna was designed with the dimension of 60 x 60 mm2. FR-4 material has a dielectric constant value of 4.3 with thickness 1.56 mm, length and width 60 mm and 60 mm respectively. One side of the substrate contains the ground plane of dimensions 60 x60 mm2 made of copper and the other side of the substrate contains the patch which have dimensions 34 x 29 mm2 and thickness 0.03mm which is also made of copper. RMPA without slot, Vertical slot RMPA, Double horizontal slot RMPA and Centre slot RMPA structures were
designed and the performance of the antennas were analysed with various parameters such as gain, directivity, Efield, VSWR and return loss. From the performance analysis, double horizontal slot RMPA antenna provides a better result and it provides maximum gain (8.61dB) and minimum return loss (-33.918dB). Based on the E-field excitation value the SEMTEX explosive material is detected and it was simulated using CST software.
A Survey on Mobile Sensing Technology and its PlatformEswar Publications
Now a days, mobile networks is increasingly becoming important part of everyday life due which there is a rapid evolution mobile phone. Mobile phone comes into a powerful sensing platform. There are many scientists which are engaged in the emerging field of mobile sensing from a variety of existing communities, such as, mobile systems, machine learning and human computer interaction. The research and development in this field is rapid resulting in indispensable carry-on of daily life. But with the increase in development, data integrity and security has also become an important factor to take into consideration. Importantly, today’s smart phones are programmable and come with a growing set of cheap powerful embedded sensors, which are enabling the emergence of personal, group, and community scale sensing applications. The mobile sensing platform provides many facilities like, it helps to communicate to Wireless sensor networks through a mobile sensor router Which attached to a users mobile phone. It helps in analysis of the sensed data which is derived from networks by cooperating with sensor middle- ware on a remote server to capture ones contexts. It also helps in providing context aware services for mobile users of cellular telephones. In this paper, we will discuss about
different mobile sensing platforms that provides context-aware services for mobile users by accessing the surrounding wireless sensor networks. Along with this, we will briefly discuss some of the emerging sensing paradigms.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Bandwidth Estimation Techniques for Relative ‘Fair’ Sharing in DASH
1. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3607
Bandwidth Estimation Techniques for Relative
‘Fair’ Sharing in DASH
Koffka Khan
Department of Computing and Information Technology The University of the West Indies, Trinidad and Tobago, W.I
Email: koffka.khan@gmail.com
Wayne Goodridge
Department of Computing and Information Technology The University of the West Indies, Trinidad and Tobago, W.I
Email: wayne.goodridge@sta.uwi.edu.com
-------------------------------------------------------------------ABSTRACT---------------------------------------------------------------
In the adaptive video streaming (AVS) literature the term fair sharing has been used to describe equal amounts of
bandwidth allocated to adaptive client players. However, we argue that even though bandwidth sharing is an
important aspect in some problems the same does not apply to AVS. Here the term relative ‘fair’ sharing is more
applicable. The reason is that videos have different quality levels and will require differing amounts of the
bandwidth to satisfy their needs. A 90% to 10% sharing may be sufficient for two players, one with high demands
and the other with low demands. A 50% sharing may lead the player with the high bandwidth demand to get too
little of the needed bandwidth resource. In addition, channel conditions may lead to players requiring different
amount of bandwidth. Again, the concept of fair sharing has to be extended to relative ‘fair’ sharing for such
scenarios. Hence, bandwidth estimation techniques players use to estimate the network bandwidth is very
important in segment selection. A player utilizes one of the many techniques to determine what share of the
bandwidth it can utilize among competing players. In this paper we explore some of the techniques used in state-
of-the-art players in their attempt to obtain a ‘fair’ share of the network bandwidth.
Keywords - Adaptive video streaming; bandwidth; demand; sharing.
--------------------------------------------------------------------------------------------------------------------------------------------------
Date of Submission: May 08, 2018 Date of Acceptance: May 19, 2018
--------------------------------------------------------------------------------------------------------------------------------------------------
I. INTRODUCTION
The concept of adaptive video streaming is based on
the idea to adapt the bandwidth required by the video
stream to the throughput available on the network path
from the stream source to the client[30]. These algorithms
can live at the server[24], at an intermediate network
device [18]or at the client[4]. With the client-side
approach it is the player that decides what bitrate to
request for any fragment, improving server-side
scalability. A benefit of this approach is that the player can
control its playback buffer size by dynamically adjusting
the rate at which new fragments are requested. The
adaptation is performed by varying the quality of the
streamed video. Multiple video segments constitute a
video stream lasting from as little as 2 seconds to as much
as having a 10 second chunk delivery rate. Segments are
encoded and stored on the server in numerous quality
versions, termed representations. Each version has a
unique resolution, bitrate and/or quality. A client
downloads segments using HTTP GET statements [12].
However, with adaptive streaming a client might request
subsequent segments at different quality levels to manage
varying network conditions, based on an estimation
bandwidth. To do this it uses a manifest file that contains
information about the video segments. Protocols and
standards such as MPEG Dynamic Adaptive Streaming
over HTTP (DASH)[13], Apple HTTP Live Streaming
(HLS)[20], Microsoft Smooth Streaming (MSS)[31] or
Adobe HTTP Dynamic Streaming (HDS) [10]typically use
a media playlist that contains a list of uniform resource
identifiers (URIs) that are addresses to media segments.
The process of determining the ideal representation for
each segment to enhance the user’s experience is pivotal to
adaptive streaming. The controller algorithm estimates the
network bandwidth and chooses the next bitrate level
corresponding to the available network bandwidth.
Variations in the available bandwidth will result in jerky
playback and disruption of the video playback if the
throughput falls below the bit rate requirement of the
video. This is the major challenge in adaptive video
streaming. Selecting appropriate bitrate levels helps to
maximize the user experience. Generally, higher bitrates
and resolutions will give better user experience. For
example, if a client approximates that there is 9.5Mb/s
available in the network, it might request the server to
stream video compressed to the highest video rate
available, 9.5Mb/s, or the next rate below, 9.3Mb/s. If the
client picks a video rate that is too high, the viewer will
experience annoying re-buffering events; if they pick a
streaming rate that is too low, the viewer will experience
poor video quality. In both cases, the experience
degrades[25], [17], [8]and user may take their viewing
elsewhere[14]. It is therefore important for a video
streaming service to select the highest safe video rate.
Figure 1: Conventional Adaptive Streaming
Adaptive streaming uses the HTTP/TCP protocol stack
to transmit video Web traffic. Thus, the development of
2. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3608
this wave of HTTP-based streaming applications is not
referred to as adaptive streaming over HTTP. The use of
HTTP/TCP protocols for video streaming is because of the
advantages that HTTP/TCP offers. It allows standard web
servers and caches to be used increasing its’ cost
effectiveness. Another advantage is that all firewalls are
configured to support HTTP connections[29]. In addition,
is allows better scaling as HTTP is stateless and the
streaming session is managed by the client, thus reducing
the load on the server. However, HTTP/TCP use reveals
further challenges as adaptation is on top of TCPs
congestion control algorithm, which forms nested control
loops. As the throughput of the TCP connection depends
on both the link capacity and the amount of congestion,
the throughput can vary significantly over time[28].
Video over IP is becoming more and more important as
we move further into the twenty-first century. The Internet
is still growing rapidly and more uses are being found for
video users. These include real-time online visual
assistance, video learning, live event streaming, smart
HDTVs, mobile phones, gaming devices, computers and
visual communication among others. As the content
quality is improving to meet end-user demands the
bandwidth requirement for such devices is rapidly
increasing. With increasing bandwidth demands and
profuse video content, it is becoming likely that two or
more adaptive streaming players may have to share a
network bottleneck. This will result in a competition for
available bandwidth. Example scenarios where this can
take place are, when a number of people in the same
household view similar or different videos simultaneously.
Here, the domestic broadband access link is the shared
bottleneck. Another instance of such competition is when
many users watch the same live event (such as World Cup
Soccer) online. The shared bottleneck may be an edge
network link in this scenario. It has been previously
observed that such competition can lead to performance
issues[5], [15], [9].
In the presence of competing HTTP-based adaptive
streaming (HAS) clients the TCP throughput does not
always faithfully represent the fair-share bandwidth [21].
Three performance issues that can take place when two or
more adaptive streaming players share a network
bottleneck and compete for available bandwidth are
instability, unfairness and utilization[16]. It is shown that
in the case of two competing video flows FESTIVE [9]and
ELASTIC [5]provide a received video rate that oscillates
around the fair share, but with an increased number of
video level switches. Depending on the temporal overlap
of the ON-OFF[5]periods among competing players, they
may not estimate their fair share correctly. In the case
where both players overestimate their fair share, they may
request a video representation with a higher bitrate than
the fair share, which causes network congestion.
Consequently, the players measure that their TCP
throughput is lower than their previous fair share estimate,
and so switch down to a lower video bitrate level. This
creates a repeating oscillatory scenario, so inducing
instability. A scenario can also occur where some players
are requesting chunks with lower bitrates than the other
players. This can occur as some players observe a
throughput lower than the fair share, while others observe a
throughput that is more than the fair share. This means that
some players overestimate its fair share. When some
players overestimate their fair share, it can be that the
system of players converge to a stable equilibrium, but
unfair. This occurs as the players with the larger fair share
estimates request higher bitrate video levels. Even in the
case where two players estimate their fair share correctly,
bandwidth underutilization can still be prevalent. This
occurs as both players request the same lower video bitrate
level, which causes underutilization, even though stability
and fairness still exist. In reality, several other factors can
play an important role in the appearance and extent of
instability, unfairness and underutilization, such as the
exact player adaptation algorithm, TCP dynamics,
bandwidth fluctuations, and the variability of the video
encoding rate[26]. We group these problems into three
categories: The first relates to the stability of the players in
terms of requested bitrates and video quality. The second
is the unfairness among competing players. The third is
the potential bandwidth underutilization when multiple
adaptive players compete.
In this paper we describe a novel sharing metric which
adequately quantifies fairness in adaptive video streaming
scenarios with multiple users. The metric will work if
either similar or different videos are being viewed by the
users. It is tested with the Conventional, ELASTIC,
PANDA, and SHARE[11] client-based adaptive streaming
algorithm.
This work consists of four sections. Section II discusses
and extends the concept of network fairness to adaptive
video streaming. Section III explores some fair share
measures that may be used by adaptive controllers. Section
IV reviews some of the state-of-the-art adaptive video
players. Section V shows the results of experiments with
three players: (1) FESTIVE, (2) PANDA and (3)
ELASTIC. Finally, the conclusion is given in section VI.
II. NETWORK FAIRNESS
Given three video represented by vectors x, y, and z,
where xi,q1, yj,q2 and zk,q3 are qi quality levels (q1=1, 2, … ,
n; q2=1, 2, … , m; q3=1, 2, … , p) allocated to user i, j,
and k, how fair is it? Consider two allocations (Mbps)
among three users sharing a 5Mbps bottleneck: x = [2; 2;
1] and y = [3; 1; 1]. In adaptive streaming scenarios with
multiple users what would qualify a quantitative metric of
fairness?
Various fairness measures have been proposed throughout
the years. These range from simple ones, e.g., the ratio
between the smallest and the largest entries of x, to more
sophisticated functions, e.g., Jain’s index and the entropy
function. Some of these fairness measures map x to a
normalized range between 0 and 1, where 0 denotes the
minimum fairness, 1 denotes the maximum fairness (often
corresponding to an x where all xi are the same), and a
larger value indicates more fairness. For example, min-
max ratio is given by the maximum ratio of any two user’s
resource allocation, while Jain’s index computes a
normalized square mean. The research question explored
3. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3609
in this work is: In adaptive streaming scenarios with
multiple users what measures of fairness might be useful?
When a user looks at a streaming video the quality level is
important. In DASH users may be watching different
videos and each video will have different quality levels.
This means that in a multi-user DASH environment each
user may require different quality levels to satisfy their
QoE requirements. Thus, a user viewing a video with
lower quality levels will require less resources than one
who demands high quality levels. In this case the fairness
is not adequately quantified by equal sharing of resources.
Though this may occur if users are viewing the same
video.
In DASH-based adaptive video multi-streaming scenarios
the fairness of a player can be used as a parameter which
determines the next segment selection, for example, Jain
fairness index. A player can optimize on the fairness
metric during streaming or use the metric after the
streaming to simply find out the fairness allocated to the
player during streaming.
Due to the widespread use of home routers in recent years,
we focus on adaptive video streaming players at a single
bottleneck link. Players compete at this bottleneck link for
video data. Hence, in a scenario where players download
different videos it is very important for each player to get a
fair share of network resources. TCP is now the favored
transport layer protocol for adaptive video streaming. TCP
contains its’ own rules, which adaptive players have to
cope with.
One of the main objectives of TCP is to control the
congestionin the Internet [11]. This control is not
efficientif it does not ensure a fair sharing of network
resources[2].A major problem of TCP is its bias against
connectionswith long round-trip times (RTT) [3, 9, 12].
These connectionsare not able to achieve the same
throughputas the other connections sharing the same path
andhaving a smaller RTT. This is caused by the
windowincrease algorithm adopted by TCP. Indeed, TCP
usesan additive-increase multiplicative-decrease strategy
forcongestion control [11, 17]. It is known that such
kindof strategies leads to fairness when all the
connectionsincrease their rates at the same rate [6]. In case
of TCP and in presence of connections of different RTT, a
fairness cannot be ensured since the window increase rate
is inversely proportional to RTT (one packet per RTT in
the congestion avoidance mode [17]) leading to an
increase in the transmission rate at a rate inversely
proportional to RTT.
Note that the transmission rate of a window-based
protocol as TCP can be approximated at any moment by
the window size divided by RTT. The connections with
small RTT increase quickly their windows and grab most
of the available bandwidth.
III. FAIR SHARE MEASURES
A.Interval measurement fairness
An interval measure takes into considerationthe idea of
units. Thus, we can make absolute, rather than
simplecomparative statements about the similarity or
differencebetween measurements.Hence, we can state the
number of units by which observations aremeasured to be
different. In addition, meaningful comparisons can be
made, such as greater than or less than.
B.Harmonic mean
The Harmonic Mean is used with inverse relationships.
For example, speed and time are inversely related: for a
fixed distance, increasing the speed results in a quicker
journey time and vice versa. Suppose we have an out and
back journey of 100 km each way with the speed 25 kph
out and 50 kph back (think peak hour / non-peak hour, a
cyclist cycling into wind and then with the wind, a vessel
sailing against the current then with the current). The
outward journey takes 100 divided by 25 = 4 hours and the
return only 100 divided by 50 = 2 hours. The total distance
is 200km in 6 hours, giving an average speed of 200
divided by 6 = 33.3 kph. This is the Harmonic Mean (of
two numbers is twice the multiplication of the two
numbers divided by the addition of the two numbers) and
can be calculated from as 2×25×50 divided by 25+50 =
2500 divided by 75 = 33.3 kph. (It is necessary for the
numerators in the inverse relationship, here 100km, to be
the same).
C. Arithmetic mean
The Arithmetic Mean is commonly referred to as the
average and has many applications, for example, the
average exam mark for a group of students, the average
maximum temperature in a calendar month, the average
number of calls to a call center between 8am and 9am
[27]. To get the arithmetic mean we add up the numbers
and divide by how many numbers we have. Another term
we can use is balance point. This means the sum of the
differences between A and all the numbers greater than A
equals the sum of the differences between A and all the
numbers less than A. For example, suppose we have the
numbers 2, 5, 10 and 19 for which A = 9. The differences
between the numbers and 9 are 7, 4, 1 and 10. The sum of
the differences to the numbers less than 9 is 7 + 4 = 11 and
the sum of the differences to the numbers greater than 9 is
1 + 10 = 11.
D.Max-Min Fairness
In communication networks with the division of scarce
resources, max-min fairness is said to be achieved by an
allocation if and only if the allocation is feasible and an
attempt to increase the allocation of any participant
necessarily results in the decrease in the allocation of some
other participant with an equal or smaller allocation. We
are talkinghere about a fairness in the sharing of the
bandwidthof the bottleneck link regardless of the volume
of resourcesconsumed by a connection on the other linksof
the network. A max-min fair allocationgives the most
poorly treated user (i.e., the user who receivesthe lowest
4. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3610
rate) the largest possible share, while not wasting
anynetwork resources.
E.Weighted Max-Min Fairness
When users (applications) have different service
requirements, then the network may not want to share
bandwidth equally among users. Instead, the network
could assign weights (priorities) to users and allocate
bandwidth accordingly [24].
F.Proportional Fairness
A compromise-based scheduling algorithm based upon
maintaining a balance between two competing interests:
Trying to maximize total throughput while allowing all
users at least a minimal level of service.
IV. LITERATURE REVIEW
The literature review is divided into the three most popular
methods for video adaptive streaming, proxy-based,
server-based and client-based. It has been shown that
today’s adaptive streaming techniques underperform when
multiple clients consume video at the same time, due to
fairness issues among clients. Concretely, this means that
different clients negatively influence each other as they
compete for shared network resources. FINEAS (Fair In-
Network Enhanced Adaptive Streaming) is
proposed[22]which is capable of increasing clients’
Quality of Experience (QoE) and achieving fairness in a
multi-client setting. A key element of their approach is an
in-network system of coordination proxies in charge of
facilitating fair resource sharing among clients. They
claim that fairness is achieved without explicit
communication among clients. In addition viewers using
HTTP Adaptive Streaming (HAS) without sufficient
bandwidth undergo frequent quality switches that hinder
their watching experience. This situation, known as
instability, is produced when HAS players are unable to
accurately estimate the available bandwidth. Moreover,
when several players stream over a bottleneck link, their
individual adaptation techniques may result in an unfair
share of the channel. These are two detrimental issues in
HAS technology, which is otherwise very attractive. The
authors [23] describe an implementation in the form of an
HTTP proxy server and show that both stability and
fairness are strongly improved. In [6] several network-
assisted streaming approaches which rely on active
cooperation between video streaming applications and the
network are explored. They use a Video Control Plane
which enforces Video Quality Fairness among concurrent
video flows generated by heterogeneous client devices. A
max-min fairness optimization problem is solved at run-
time. They compare two approaches to actuate the optimal
solution in an SDN network: the first one allocating
network bandwidth slices to video flows, the second one
guiding video players in the video bitrate selection.
In [24] the bandwidth estimate generated at the server is
used for server-side adaptive bit encoding of digital
media streams. The server application measures the
network bandwidth available to the individual client for
TCP/IP downloads of media and accordingly adjusts
stream bit rate and composition to allow the client to
retrieve the media stream with sufficient time margin to
minimize the occurrence of underflow of client playback
buffers. The root cause of the instability problem is that, in
Steady-State, a player goes through an ON-OFF activity
pattern in which it overestimates the available bandwidth
[24]. They propose a server-based traffic shaping
procedure that can considerably lower such oscillations.
Their procedure is only triggered when oscillations are
identified, and so the shaping rate is dynamically adjusted.
This ensures that the player receives the highest available
video profile without being unstable. Using HTTP for
video streaming significantly increases the request
overhead due to the segmentation of the video content into
HTTP resources [19]. This overhead becomes even more
substantial when non-multiplexed video and audio
segments are deployed. The authors investigate the request
overhead problem by employing the server push
technology in the new HTTP 2.0 protocol. They develop a
set of push strategies that actively deliver video and audio
content from the HTTP server without requiring a request
for each individual segment.
Chunk scheduling with stateless bitrate selection causes
feedback loops, bad bandwidth estimation, bitrate switches
and unfair bitrate choices [9]. This paper, which portrays
the FESTIVE control algorithm, confirms that numerous
problems occur when multiple bitrate-adaptive players
(adaptation over HTTP) share a bottleneck link [1]. It
uncovers the fact that the feedback signals the player
receives is not a true reflection of the network state
because of overlaying the adaptation logic over several
layers. HTTP-based video delivery issues are elucidated:
(1) the granularity of the control decisions, (2) the
timescales of adaptation, (3) the nature of feedback from
the network and (4) the interactions with other
independent control loops in lower layers of the
networking stack. FESTIVE uses an abstract player state
to analyze commercial players: (1) schedule a video chunk
for download, (2) select bitrate for chunk, and (3) estimate
bandwidth. It identifies root causes of undesirable
interactions with abstract state player framework and saw
the need to guide the tradeoffs between stability, fairness
and efficiency. As a result, the authors created a robust
video adaptation algorithm, which tried to achieve: (1)
Fairness – equal allocation of network resources, (2)
Efficiency – get highest bitrates for maximum user
experience, and (3) Stability – avoid needless bitrate
switches. The eventual contributions were a family of
adaptation algorithms using the following approaches: (1)
Randomized chunk scheduling: to avoid sync biases in
network state sampling, (2) Stateful bitrate selection: to
compensate between biased bitrate and estimated
bandwidth interaction, (3) Delayed update: to account for
stability and efficiency tradeoff, and (4) Bandwidth
estimator: to increase robustness to outliers.
FESTIVE [9]utilizes a bandwidth estimator that uses the
harmonic mean of download speed. This harmonic mean is
calculated over last 20 chunks. Authors claim the
harmonic mean is more appropriate when computing the
average of rates which is the case with throughput
5. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3611
estimation and it is also more robust to larger outliers.
They show experimentally how the harmonic mean
provides reliable bandwidth estimates on which future
bitrate update decisions can be made.
The authors in[15], who proposed the PANDA algorithm,
noted that since TCP throughput observed by a client
would indicate the available network bandwidth, it could
be used as a reliable reference for video bitrate selection.
However, this is no longer true when HTTP Adaptive
Streaming (HAS) [1] becomes a substantial fraction of the
total network traffic or when multiple HAS clients
compete at a network bottleneck. It was observed that the
discrete nature of the video bitrates results in difficulty for
a client to correctly perceive its fair-share bandwidth.
Hence, this fundamental limitation would lead to video
bitrate oscillation and other undesirable behaviors that
negatively impact the video viewing experience. They
offered a design at the application layer using a “probe and
adapt” principle for video bitrate adaptation (where
“probe” refers to trial increment of the data rate, instead of
sending auxiliary piggybacking traffic), which is akin, but
also orthogonal to the transport-layer TCP congestion
control. The authors illustrate a four-step state for an HAS
rate adaptation algorithm: (1) Estimating: the algorithm
starts by estimating the network bandwidth that can
legitimately be used, (2) Smoothing: is then noise-filtered
to yield the smoothed version, with the aim of removing
outliers, (3) Quantizing: the continuous is then mapped to
the discrete video bitrate, possibly with the help of side
information such as client buffer size etc, and (4)
Scheduling: the algorithm selects the target interval until
the next download request. The advantages of PANDA are
as follows. Firstly, as the bandwidth estimation by probing
is quite accurate, one does not need to apply strong
smoothing. Secondly, since after a bandwidth drop, the
video bitrate reduction is made proportional to the TCP
throughput reduction, PANDA is very sensitive to
bandwidth drops.
In step (1) of PANDA’s rate adaptation algorithm, instead
of directly tuning the video bitrate, the algorithm probes
the bandwidth based on the average data rate, which in
turn determines the selected video bitrate and the fine-
granularity inter-request time. In other words, by probing,
PANDA determines a target average data rate. This
average data rate is subsequently used to determine the
video bitrate. The target average data rate estimated by the
probing mechanism is neither biased nor have a large
variation, enabling the subsequent operations to easily
pick a video bitrate without sacrificing responsiveness
when network bandwidth changes.
ELASTIC [5]proposes an approach that uses one
controller to throttles the video level (𝑡). This drives the
playout buffer length (𝑡) to a set-point 𝑞 𝑇, which
eliminates the ON-OFF traffic pattern. The player is
always in ON phase unless (t) is the highest level and q
>Qmax (>qT). The basic concept is based on the playout
buffer state, design a feedback control system that
computes l(t) to steer q(t) to a threshold qT. The received
rate r(t), is considered as a (measurable) disturbance since
it cannot be manipulated. ELASTIC provides a received
video rate that oscillates around the fair share, with an
increased number of video level switches. However, the
main result involved long-lived TCP flows [19][3], where
experimental evaluation showed that ELASTIC can get the
fair share when competing with TCP long-lived
flows.ELASTIC estimates the received rate by passing the
last segment download rate through a harmonic filter over
the last download 5 samples.
V. EXPERIMENTS AND RESULTS
A. TAPAS
In communication TAPAS is an open-source Tool for
rApid Prototyping of Adaptive Streaming control
approaches, De Cicco et al. (2014). This flexible and
extensible video streaming player tool is written in python.
It allows researchers to easily design and carry out
experimental performance evaluations of adaptive
streaming controllers. There is no need to write code for
the download of video segments, to parse manifest files,
and decode video. TAPAS's design minimizes CPU and
memory footprint. Thus, experiments involving many
concurrent video flows can be carried out. Table 1 shows
the main variables kept during streaming with a brief
explanation of each one.
TABLE I. TAPAS DATA LOGS
Variable Explanation
q(t) the amount of data (in bytes) in the
playout buffer
b(t) the amount of data (in seconds) in the
playout buffer
B(t) last estimated available bandwidth in
B/s
Lr(t) current video quality level rate in B/s
cq(t) index of current level starting from 0
for the lowest video quality level
cqmax(t) index of maximum level starting from
0 for the lowest video quality level
mp(t) when the media engine is 'onPlaying'
or 'onPaused'
p(t) time spent on pause
D(t) total downloaded bytes in B
sp(t) timestamp when starts the download
of the last segment
sq(t) timestamp when stops the download
of the last segment
B. Experimental Setup
The following experiments use the conventional DASH
controller and measures five DASH-based performance
metrics. All experiments are hosted on a Windows 10
machine, with the following specifications: Intel(R)
Core(TM) i7-5500U CPU 2.40GHz processor, 16.00
GBphysical memory and an Intel(R) HD Graphics
processor. A virtual networkis setup on the Windows 10
machine for the emulation test bed. Our setupconsists of a
6. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3612
video server running Ubuntu (HTTP server), a router
running FreeBSD (Home Router) and two real network
players (HAS client) hosted on Ubuntu, cf. Figure 1.
Apache HTTP Server Router
TAPAS Video Player
TAPAS Video Player
...
TCP Sender
TCP Receiver
TCP ReceiverUbuntu
Ubuntu
Ubuntu
DummyNet
FreeBSD
Fig. 1. Experiment testbed setup.
The 647 seconds long MPEG-DASH video sequence
Elephant 's Dream4 is stored at the server. The video
sequence is pre-encoded at eight different bitrates, ranging
from 46 kbps to 4200 kbps. Further, it is divided into 2
second segments and exists in five different screen
resolutions, ranging from 320x240 to 1920x1080. This is
shown in Table II. The media type for the video is MP4.
The video is encoded at 24 frames per second (fps) using
the AVC1 (version 42c032) codec5. The Media
Presentation Description (MPD) files are generated with
GPAC version 0.5.1-DEV-rev53796.
TABLE II. VIDEO LEVELS, BITRATES AND RESOLUTIONS
Video level Bitrate (kbps) Resolution
1 46.0 320x240
2 131.0 320x240
3 222.0 480x360
4 328.0 480x360
5 523.0 854x480
6 796.0 1280x720
7 1200.0 1280x720
8 2100.0 1920x1080
We set up two players per experiment. The first
experiment test fairness of an adaptive agent using the
arithmeticmean (PANDA), and harmonic mean
(ELASTIC and FESTIVE).
C. Results
The results are shown on Figures 1, 2, 3, 4, 5 and 6.
FESTIVE does well. It is able to better than PANDA and
ELASTIC. ELASTIC comes in last of the three
approaches compared. Adaptive players using this
technique are unable to get fair share of quality many
times during the experiment. This can be attributed to the
harmonic mean being taken over a 5 segment download
sample rate interval compared to the 20 segment download
sample rate of FESTIVE. The 20 segment download
sample rate of FESTIVE gives a better accuracy in next
segment selection []. The result here shows that the
average data rate utilized by PANDA gives better
performance than the 5 sample harmonic mean utilized by
ELASTIC, but it is not good enough to better
FESTIVE.Finally, the Conventional players, which is used
as a benchmark does the worst.
Fig. 1. Quality levels for two competing adaptive
FESTIVE players sharing a bottleneck link.
Fig. 2. Quality levels for two competing adaptive PANDA
players sharing a bottleneck link.
7. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3613
Fig. 3. Quality levels for two competing adaptive
ELASTIC players sharing a bottleneck link.
Fig.4. Quality levels for two competing adaptive
Conventional players sharing a bottleneck link.
Fig. 5. Buffer levels for two competing adaptive FESTIVE
players sharing a bottleneck link.
Fig. 6. Buffer levels for two competing adaptive PANDA
players sharing a bottleneck link.
Fig. 7. Buffer levels for two competing adaptive
ELASTIC players sharing a bottleneck link
Fig.8. Buffer levels for two competing adaptive
Conventional players sharing a bottleneck link
VI. CONCLUSION
This paper demonstrates the need for better bandwidth
estimation techniques for adaptive video streaming
players. Current state-of-the-art players are unable to
accurately predict bandwidth, and this results in
inadequate fair sharing among players. Of the three
players tested, FESTIVE performs best, with ELASTIC
the worst. However, PANDA is able to obtain better
estimates when compared to ELASTIC. Future work can
involve using scales among players that takes into
consideration relative fair share, such as Simple Additive
Weighting Method (SAW).
REFERENCES
[1] Akhshabi, Saamer, Lakshmi Anantakrishnan, Ali C.
Begen, and Constantine Dovrolis. "What happens
when HTTP adaptive streaming players compete for
bandwidth?." In Proceedings of the 22nd international
workshop on Network and Operating System Support
for Digital Audio and Video, pp. 9-14. ACM, 2012.
[2] Altman, Eitan, Chadi Barakat, Emmanuel Laborde,
Patrick Brown, and Denis Collange. "Fairness
analysis of TCP/IP." In Decision and Control, 2000.
Proceedings of the 39th IEEE Conference on, vol. 1,
pp. 61-66. IEEE, 2000.
8. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3614
[3] Alvarez-Horine, Rafael, and Melody Moh.
"Experimental evaluation of Linux TCP for adaptive
video streaming over the cloud." In Globecom
Workshops (GC Wkshps), 2012 IEEE, pp. 747-752.
IEEE, 2012.
[4] Claeys, Maxim, Steven Latre, Jeroen Famaey, and
Filip De Turck. "Design and evaluation of a self-
learning HTTP adaptive video streaming
client." IEEE communications letters18, no. 4 (2014):
716-719.
[5] De Cicco, Luca, Vito Caldaralo, Vittorio Palmisano,
and Saverio Mascolo. "Elastic: a client-side controller
for dynamic adaptive streaming over http (dash)."
In Packet Video Workshop (PV), 2013 20th
International, pp. 1-8. IEEE, 2013.
[6] Georgopoulos, Panagiotis, Yehia Elkhatib, Matthew
Broadbent, Mu Mu, and Nicholas Race. "Towards
network-wide QoE fairness using openflow-assisted
adaptive video streaming." In Proceedings of the 2013
ACM SIGCOMM workshop on Future human-centric
multimedia networking, pp. 15-20. ACM, 2013.
[7] Goel, Ashvin, Charles Krasic, Kang Li, and Jonathan
Walpole. "Supporting low latency TCP-based media
streams." In Quality of Service, 2002. Tenth IEEE
International Workshop on, pp. 193-203. IEEE, 2002.
[8] Huang, Weiwei, Yipeng Zhou, Xueyan Xie, Di Wu,
Min Chen, and Edith Ngai. "Buffer State is Enough:
Simplifying the Design of QoE-Aware HTTP
Adaptive Video Streaming." IEEE Transactions on
Broadcasting (2018).
[9] Jiang, Junchen, Vyas Sekar, and Hui Zhang.
"Improving fairness, efficiency, and stability in http-
based adaptive videostreaming with
festive." IEEE/ACM Transactions on Networking
(TON) 22, no. 1 (2014): 326-340.
[10]Kesavan, Selvaraj, and J. Jayakumar. "Network
performance analysis of cloud based multimedia
streaming service." International Journal of New
Computer Architectures and their Applications
(IJNCAA) 4, no. 3 (2014): 156-166.
[11]Koffka Khan, Wayne Goodridge, “Markov Decision
Processes for bitrate harmony in adaptive video
streaming”, 2017 Future Technologies Conference
(FTC), Vancouver, Canada, unpublished.
[12]Kong, Fanxin, Xingjian Lu, Mingyuan Xia, Xue Liu,
and Haibing Guan. "Distributed optimal datacenter
bandwidth allocation for dynamic adaptive video
streaming." In Proceedings of the 23rd ACM
international conference on Multimedia, pp. 531-540.
ACM, 2015.
[13]Kua, Jonathan, Grenville Armitage, and Philip
Branch. "A survey of rate adaptation techniques for
dynamic adaptive streaming over HTTP." IEEE
Communications Surveys & Tutorials 19, no. 3
(2017): 1842-1866.
[14]Li, Mingfu, Chien-Lin Yeh, and Shao-Yu Lu. "Real-
time QoE monitoring system for video streaming
services with adaptive media playout." International
Journal of Digital Multimedia Broadcasting 2018
(2018).
[15]Li, Zhi, Xiaoqing Zhu, Joshua Gahm, Rong Pan, Hao
Hu, Ali C. Begen, and David Oran. "Probe and adapt:
Rate adaptation for HTTP video streaming at
scale." IEEE Journal on Selected Areas in
Communications 32, no. 4 (2014): 719-733.
[16]Mansy, Ahmed, Marwan Fayed, and Mostafa Ammar.
"Network-layer fairness for adaptive video streams."
In IFIP Networking Conference (IFIP Networking),
2015, pp. 1-9. IEEE, 2015.
[17]Mori, Shungo, and Masaki Bandai. "QoE-aware
quality selection method for adaptive video streaming
with scalable video coding." In Consumer Electronics
(ICCE), 2018 IEEE International Conference on, pp.
1-4. IEEE, 2018.
[18]Mu, Mu, Matthew Broadbent, Arsham Farshad,
Nicholas Hart, David Hutchison, Qiang Ni, and
Nicholas Race. "A scalable user fairness model for
adaptive video streaming over SDN-assisted future
networks." IEEE Journal on Selected Areas in
Communications 34, no. 8 (2016): 2168-2184.
[19]Oyman, Ozgur, and Sarabjot Singh. "Quality of
experience for HTTP adaptive streaming services."
IEEE Communications Magazine 50, no. 4 (2012).
[20]Pantos, Roger, and William May. "HTTP live
streaming." (2017).
[21]Petrangeli, Stefano, Jeroen Famaey, Maxim Claeys,
Steven Latré, and Filip De Turck. "QoE-driven rate
adaptation heuristic for fair adaptive video
streaming." ACM Transactions on Multimedia
Computing, Communications, and Applications
(TOMM) 12, no. 2 (2016): 28.
[22]Petrangeli, Stefano, Jeroen Famaey, Maxim Claeys,
Steven Latré, and Filip De Turck. "QoE-driven rate
adaptation heuristic for fair adaptive video
streaming." ACM Transactions on Multimedia
Computing, Communications, and Applications
(TOMM) 12, no. 2 (2016): 28.
[23]Ramakrishnan, Sangeeta, Xiaoqing Zhu, Frank Chan,
and Kashyap Kambhatla. "SDN based QoE
optimization for HTTP-based adaptive video
9. Int. J. Advanced Networking and Applications
Volume: 09 Issue: 06 Pages: 3607-3615 (2018) ISSN: 0975-0290
3615
streaming." In Multimedia (ISM), 2015 IEEE
International Symposium on, pp. 120-123. IEEE,
2015.
[24]Schmidt, Mark S., Praveen N. Moorthy, Ajay Luthra,
and Paul Moroney. "Server side adaptive bit rate
control for HTTP streaming clients." U.S. Patent
9,769,235, issued September 19, 2017.
[25]Seufert, Michael, Sebastian Egger, Martin Slanina,
Thomas Zinner, Tobias Hossfeld, and Phuoc Tran-
Gia. "A survey on quality of experience of HTTP
adaptive streaming." IEEE Communications Surveys
& Tutorials 17, no. 1 (2015): 469-492.
[26]Tanwir, Savera, and Harry Perros. "Modeling live
adaptive streaming over HTTP." Computer
Communications 85 (2016): 74-88.
[27]Weisstein, Eric W. CRC concise encyclopedia of
mathematics. CRC press, 2002.
[28]Xie, Xiufeng, Xinyu Zhang, Swarun Kumar, and Li
Erran Li. "pistream: Physical layer informed adaptive
video streaming over lte." In Proceedings of the 21st
Annual International Conference on Mobile
Computing and Networking, pp. 413-425. ACM,
2015.
[29]Ye, Zakaria, Rachid El-Azouzi, Tania Jimenez, Eitan
Altman, and Stefan Valentin. "Backward-shifted
strategies based on SVC for HTTP adaptive video
streaming." In IFIP Networking Conference (IFIP
Networking) and Workshops, 2016, pp. 494-502.
IEEE, 2016.
[30]Yin, Xiaoqi, Abhishek Jindal, Vyas Sekar, and Bruno
Sinopoli. "A control-theoretic approach for dynamic
adaptive video streaming over HTTP." In ACM
SIGCOMM Computer Communication Review, vol.
45, no. 4, pp. 325-338. ACM, 2015.
[31]Zambelli, A. "The microsoft ISS smooth streaming
(MSS) client." (2015).
AUTHOR DETAILS
Koffka Khan received the M.Sc., and
M.Phil. degrees from the University of the
West Indies. He is currently a PhD student
and has up-to-date, fpublished numerous
papers in journals & proceedings of
international repute. His research areas are computational
intelligence, routing protocols, wireless communications,
information security and adaptive streaming controllers.
Wayne Goodridge is a Lecturer in the
Department of Computing and Information
Technology, The University of the West
Indies, St. Augustine. He did is PhD at
Dalhousie University and his research
interest includes computer communications and security.