Given the strict Quality of Service (QoS) requirements of video streaming, this paper proposes a novel
solution for simultaneous streaming of multiple video sessions over a mobile cellular system. The proposed
solution combines a buffer management strategy with a packet scheduling algorithm. The buffer
management strategy selectively discards packets of a user from base station buffer whereas the packet
scheduling algorithm schedules packets of a user according to its instantaneous channel quality, average
throughput and playback buffer information. Simulation results demonstrate that the proposed solution is
effective in providing a continuous video playback with good perceptual quality for more users. If at least a
good perceptual quality is to be satisfied for all users (QoS constraint of video streaming), then the
proposed solution improves the system capacity by 40% over a conventional packet scheduling algorithm.
Priority scheduling for multipath video transmission in wmsnsIJCNCJournal
In video data transmission over Wireless Multimedia Sensor Networks (WMSNs), in which network
congestion and link failures are main characteristics, providing Quality-of-Service (QoS) is challenging. In
such situation, using multipath routing protocols along with efficient packet scheduling can improve the
performance of video delivery over sensor networks. In this paper we propose a new packet scheduling
mechanism for multipath video transmission over WMSN. Since, different video frame types in a
compressed video stream have different impact on the perceived video at the receiver; our proposed
scheme for video packet scheduling is content aware that schedules transmission of different video packets
over different paths. For this purpose, condition of each routing path is periodically evaluated and the high
priority video packets are transmitted through high quality paths. Simulation results show that our
proposed scheduling improves the quality of the perceived video at the receiver, considerably.
(Paper) MTcast: Robust and Efficient P2P-based Video Delivery for Heterogeneo...Naoki Shibata
In this paper, we propose a new video delivery method called MTcast (Multiple Transcode based video multicast) which achieves efficient simultaneous video delivery to multiple users with different quality requirements by relying on user nodes to transcode and forward video to other user nodes. In MTcast, each user specifies a quality requirement for a video consisting of bitrate, picture size and frame rate based on the user’s environmental resource limitation. All users can receive video with the specified quality (or near this quality) along a single delivery tree. The main characteristics of MTcast are in its scalability, high user satisfaction degree in received video quality, short startup latency and robustness against node failure. Through simulations, we have confirmed that MTcast can achieve much higher user satisfaction degree and robustness against node failure than the layered multicast method.
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.
Chaining Algorithm and Protocol for Peer-to-Peer Streaming Video on Demand Sy...ijwmn
As the various architectures and protocol have been implemented a true VoD system has great demand in the global users. The traditional VoD system does not provide the needs and demands of the global users. The major problem in the traditional VoD system is serving of video stream among clients is duplicated and streamed to the different clients, which consumes more server bandwidth and the client uplink bandwidth is not utilized and the performance of the system degrades. Our objective in this paper is to send one server stream sufficient to serve the many clients without duplicating the server stream. Hence we have proposed a protocol and algorithm that chains the proxy servers and subscribed clients utilize client’s uplink bandwidth such that the load on the server is reduced. We have also proved that less rejection ratio of the clients and better utilization of the buffer and bandwidth for the entire VoD system.
FLEXIBLE FEC AND FAIR SELECTION OF SCALABLE UNITS FOR HIGH QUALITY VOD STREAM...IJMIT JOURNAL
Providing high quality video on demand (VoD) streaming service over wireless networks is very
challenging due to the limited capacity and error-proneness of the wireless environment. We propose a
flexible forward error correction (FEC) and a fair selection scheme of scalable units that utilize a layered
coding structure of H.264/SVC (scalable video coding). Three error-resilient techniques (e.g., unequal
error protection, FEC, and retransmission) are adapted to minimize the total distortion of VoD streaming
service. For flexible FEC, a rateless FEC code is adopted. The FEC code rates are based on the possible
number of retransmission, the condition of the wireless channel and the layered coding structure of
H.264/SVC for each packet. A theoretical study is performed to show how to utilize the possible number of
retransmission for an adaptive FEC code rate. With fair selection, regular and retransmission-requested
packets compete for resources without fixing the retry limit. Thus, excessive retransmission is prevented and
the proposed scheme effectively provides capacity-limited and delay-constrained VoD streaming services.
For this fair selection of scalable units, we formulate the problem using binary integer programming and
propose an effective low complexity selection algorithm based on a priority index. The proposed algorithm
prioritizes packets according to the priority index and the H.264/SVC structure. We show that the proposed
scheme can minimize the total video distortion compared to other heuristic procedures. Other effects of the
various factors are also considered for the performance of the new scheme
Flexible fec and fair selection of scalable units for high quality vod stream...IJMIT JOURNAL
Providing high quality video on demand (VoD) streaming service over wireless networks is very challenging due to the limited capacity and error-proneness of the wireless environment. We propose a flexible forward error correction (FEC) and a fair selection scheme of scalable units that utilize a layered
coding structure of H.264/SVC (scalable video coding). Three error-resilient techniques (e.g., unequal
error protection, FEC, and retransmission) are adapted to minimize the total distortion of VoD streaming
service. For flexible FEC, a rateless FEC code is adopted. The FEC code rates are based on the possible
number of retransmission, the condition of the wireless channel and the layered coding structure of H.264/SVC for each packet. A theoretical study is performed to show how to utilize the possible number of retransmission for an adaptive FEC code rate. With fair selection, regular and retransmission-requested
packets compete for resources without fixing the retry limit. Thus, excessive retransmission is prevented and
the proposed scheme effectively provides capacity-limited and delay-constrained VoD streaming services.
For this fair selection of scalable units, we formulate the problem using binary integer programming and
propose an effective low complexity selection algorithm based on a priority index. The proposed algorithm
prioritizes packets according to the priority index and the H.264/SVC structure. We show that the proposed
scheme can minimize the total video distortion compared to other heuristic procedures. Other effects of the
various factors are also considered for the performance of the new scheme.
Priority scheduling for multipath video transmission in wmsnsIJCNCJournal
In video data transmission over Wireless Multimedia Sensor Networks (WMSNs), in which network
congestion and link failures are main characteristics, providing Quality-of-Service (QoS) is challenging. In
such situation, using multipath routing protocols along with efficient packet scheduling can improve the
performance of video delivery over sensor networks. In this paper we propose a new packet scheduling
mechanism for multipath video transmission over WMSN. Since, different video frame types in a
compressed video stream have different impact on the perceived video at the receiver; our proposed
scheme for video packet scheduling is content aware that schedules transmission of different video packets
over different paths. For this purpose, condition of each routing path is periodically evaluated and the high
priority video packets are transmitted through high quality paths. Simulation results show that our
proposed scheduling improves the quality of the perceived video at the receiver, considerably.
(Paper) MTcast: Robust and Efficient P2P-based Video Delivery for Heterogeneo...Naoki Shibata
In this paper, we propose a new video delivery method called MTcast (Multiple Transcode based video multicast) which achieves efficient simultaneous video delivery to multiple users with different quality requirements by relying on user nodes to transcode and forward video to other user nodes. In MTcast, each user specifies a quality requirement for a video consisting of bitrate, picture size and frame rate based on the user’s environmental resource limitation. All users can receive video with the specified quality (or near this quality) along a single delivery tree. The main characteristics of MTcast are in its scalability, high user satisfaction degree in received video quality, short startup latency and robustness against node failure. Through simulations, we have confirmed that MTcast can achieve much higher user satisfaction degree and robustness against node failure than the layered multicast method.
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.
Chaining Algorithm and Protocol for Peer-to-Peer Streaming Video on Demand Sy...ijwmn
As the various architectures and protocol have been implemented a true VoD system has great demand in the global users. The traditional VoD system does not provide the needs and demands of the global users. The major problem in the traditional VoD system is serving of video stream among clients is duplicated and streamed to the different clients, which consumes more server bandwidth and the client uplink bandwidth is not utilized and the performance of the system degrades. Our objective in this paper is to send one server stream sufficient to serve the many clients without duplicating the server stream. Hence we have proposed a protocol and algorithm that chains the proxy servers and subscribed clients utilize client’s uplink bandwidth such that the load on the server is reduced. We have also proved that less rejection ratio of the clients and better utilization of the buffer and bandwidth for the entire VoD system.
FLEXIBLE FEC AND FAIR SELECTION OF SCALABLE UNITS FOR HIGH QUALITY VOD STREAM...IJMIT JOURNAL
Providing high quality video on demand (VoD) streaming service over wireless networks is very
challenging due to the limited capacity and error-proneness of the wireless environment. We propose a
flexible forward error correction (FEC) and a fair selection scheme of scalable units that utilize a layered
coding structure of H.264/SVC (scalable video coding). Three error-resilient techniques (e.g., unequal
error protection, FEC, and retransmission) are adapted to minimize the total distortion of VoD streaming
service. For flexible FEC, a rateless FEC code is adopted. The FEC code rates are based on the possible
number of retransmission, the condition of the wireless channel and the layered coding structure of
H.264/SVC for each packet. A theoretical study is performed to show how to utilize the possible number of
retransmission for an adaptive FEC code rate. With fair selection, regular and retransmission-requested
packets compete for resources without fixing the retry limit. Thus, excessive retransmission is prevented and
the proposed scheme effectively provides capacity-limited and delay-constrained VoD streaming services.
For this fair selection of scalable units, we formulate the problem using binary integer programming and
propose an effective low complexity selection algorithm based on a priority index. The proposed algorithm
prioritizes packets according to the priority index and the H.264/SVC structure. We show that the proposed
scheme can minimize the total video distortion compared to other heuristic procedures. Other effects of the
various factors are also considered for the performance of the new scheme
Flexible fec and fair selection of scalable units for high quality vod stream...IJMIT JOURNAL
Providing high quality video on demand (VoD) streaming service over wireless networks is very challenging due to the limited capacity and error-proneness of the wireless environment. We propose a flexible forward error correction (FEC) and a fair selection scheme of scalable units that utilize a layered
coding structure of H.264/SVC (scalable video coding). Three error-resilient techniques (e.g., unequal
error protection, FEC, and retransmission) are adapted to minimize the total distortion of VoD streaming
service. For flexible FEC, a rateless FEC code is adopted. The FEC code rates are based on the possible
number of retransmission, the condition of the wireless channel and the layered coding structure of H.264/SVC for each packet. A theoretical study is performed to show how to utilize the possible number of retransmission for an adaptive FEC code rate. With fair selection, regular and retransmission-requested
packets compete for resources without fixing the retry limit. Thus, excessive retransmission is prevented and
the proposed scheme effectively provides capacity-limited and delay-constrained VoD streaming services.
For this fair selection of scalable units, we formulate the problem using binary integer programming and
propose an effective low complexity selection algorithm based on a priority index. The proposed algorithm
prioritizes packets according to the priority index and the H.264/SVC structure. We show that the proposed
scheme can minimize the total video distortion compared to other heuristic procedures. Other effects of the
various factors are also considered for the performance of the new scheme.
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.
RESOURCE ALLOCATION ALGORITHMS FOR QOS OPTIMIZATION IN MOBILE WIMAX NETWORKSijwmn
WiMAX is based on the standard IEEE 802.16e-2009 for wireless access in Metropolitan Area Networks. It
is one of the solutions for 4G IP based wireless technology. WiMAX utilizes Orthogonal Frequency
Division Multiple Access which also supports Multicast and Broadcast Service with appropriate
Modulation and Coding Scheme. Presently, Scheduling and Resource allocation algorithm in Opportunistic
Layered Multicasting provides multicasting of layered video over mobile WiMAX to ensure better QoS.
Initially, the knowledge based allocation of subcarriers is used for scheduling. In addition, to reduce the
burst overhead, delay and jitter, SWIM (Swapping Min-Max) algorithm is utilized. Another promising
technology that can greatly improve the system performance by exploring the broadcasting nature of
wireless channels and the cooperation among multiple users is the Cooperative Multicast Scheduling
(CMS) technique. The simulation results show, Swapping Min-Max performs better with lesser number of
bursts, Zero jitter and with optimal throughput. The results with Cooperative Multicast Scheduling show
the enhanced throughput for each member in the Multicasting Scenario.
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.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
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.
Mpls vpn using vrf virtual routing and forwardingIJARIIT
Multi-Protocol Label Switching (MPLS) which was introduced by Internet Engineering Task Force (IETF) is
usually used in communication networks which started attracting all the internet service provider(ISP) networks with its
brilliant and excellent features that provide quality of services (QOS)and guarantees to traffic which carries data from one
network to another network directly through labels.
Virtual Private Network (VPN) is one of the highly useful MPLS applications which allow a service provider or a large enterprise
network to offer network Layer VPN services that guarantee and carries traffic securely and privately from customer’s one to
another through the service provider’s network. To support multiple customers that Customers Request for secure, reliable,
private and ultrafast connections over the internet MPLS VPN standards include the concept of a virtual router. This feature
called a VRF table. VRF or Virtual Routing and Forwarding technology that permit a router to have various routing table or
multiple VPN at the same time that they are located in the same router but they are independent and also the VRF feature in
VPN now allows different customers to use same IP addresses connected to the same ISP. A VRF exists inside a single MPLS
router and typically routers need at least one VRF for each customer attached to that particular router.
Efficient management of bandwidth in wireless networks is a critical factor for a successful communication system. Special features of wireless networks such user mobility and growth of wireless applications and their high bandwidth intensity create a major challenge to utilize bandwidth resources optimally. In this research, we propose a model for an adaptable network bandwidth management method that combines bandwidth reservation and bandwidth adaptation to reduce call blocking and dropping probabilities. The model is an integer program that determines whether or not to accept new calls and decides how to allocate bandwidth optimally in a way to maximize user satisfaction. The results of a simulation study show that the proposed method outperforms an existing method with respect to key performance measures such as call blocking and dropping probabilities and call time survivability. This survivability indicator is a new measure that is introduced for the first time in this paper. We also present a second tradeoff model to allow the network manager to control call dropping probability. The results of a second simulation study show that network users are better off if a zero call dropping policy is adopted as proposed in the first model.
Fingerprinting Based Indoor Positioning System using RSSI Bluetoothijsrd.com
Positioning is basis for providing location information to mobile users, however, with the growth of wireless and mobile communications technologies. Mobile phones are equipped with several radio frequency technologies for driving the positioning information like GSM, Wi-Fi or Bluetooth etc. In this way, the objective of this thesis was to implement an indoor positioning system relying on Bluetooth Received Signal Strength (RSS) technology and it integrates into the Global Positioning Module (GPM) to provide precise information inside the building. In this project, we propose indoor positioning system based on RSS fingerprint and footprint architecture that smart phone users can get their position through the assistance collections of Bluetooth signals, confining RSSs by directions, and filtering burst noises that can overcome the server signal fluctuation problem inside the building. Meanwhile, this scheme can raise more accuracy in finding the position inside the building.
Analyzing Video Streaming Quality by Using Various Error Correction Methods o...IJERA Editor
Transmission video over ad hoc networks has become one of the most important and interesting subjects of study for researchers and programmers because of the strong relationship between video applications and frequent users of various mobile devices, such as laptops, PDAs, and mobile phones in all aspects of life. However, many challenges, such as packet loss, congestion (i.e., impairments at the network layer), multipath fading (i.e., impairments at the physical layer) [1], and link failure, exist in transferring video over ad hoc networks; these challenges negatively affect the quality of the perceived video [2].This study has investigated video transfer over ad hoc networks. The main challenges of transferring video over ad hoc networks as well as types of errors that may occur during video transmission, various types of video mechanisms, error correction methods, and different Quality of Service (QoS) parameters that affect the quality of the received video are also investigated.
Optimal Streaming Protocol for VoD Using Clients' Residual BandwidthIDES Editor
A true VoD system has tremendous demand in the
market. The existing VoD system does not cater the needs
and demands of the market. The major problem in the VoD
system is serving of clients with expected QoS is difficult. In
this paper, we proposed a protocol and algorithm that
chains the proxy servers and subscribed clients. Our
objective is to send one server stream and this stream should
be served to N asynchronous clients. The server bandwidth
is scarcity and on the client uplink bandwidth is
underutilized. In this protocol, we are using client’s residual
bandwidth such that the load on the server bandwidth is
reduced. We have proved that optimal utilization of the
buffer and bandwidth for the entire VoD system and also
less rejection ratio of the clients.
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
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.
RESOURCE ALLOCATION ALGORITHMS FOR QOS OPTIMIZATION IN MOBILE WIMAX NETWORKSijwmn
WiMAX is based on the standard IEEE 802.16e-2009 for wireless access in Metropolitan Area Networks. It
is one of the solutions for 4G IP based wireless technology. WiMAX utilizes Orthogonal Frequency
Division Multiple Access which also supports Multicast and Broadcast Service with appropriate
Modulation and Coding Scheme. Presently, Scheduling and Resource allocation algorithm in Opportunistic
Layered Multicasting provides multicasting of layered video over mobile WiMAX to ensure better QoS.
Initially, the knowledge based allocation of subcarriers is used for scheduling. In addition, to reduce the
burst overhead, delay and jitter, SWIM (Swapping Min-Max) algorithm is utilized. Another promising
technology that can greatly improve the system performance by exploring the broadcasting nature of
wireless channels and the cooperation among multiple users is the Cooperative Multicast Scheduling
(CMS) technique. The simulation results show, Swapping Min-Max performs better with lesser number of
bursts, Zero jitter and with optimal throughput. The results with Cooperative Multicast Scheduling show
the enhanced throughput for each member in the Multicasting Scenario.
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.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
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.
Mpls vpn using vrf virtual routing and forwardingIJARIIT
Multi-Protocol Label Switching (MPLS) which was introduced by Internet Engineering Task Force (IETF) is
usually used in communication networks which started attracting all the internet service provider(ISP) networks with its
brilliant and excellent features that provide quality of services (QOS)and guarantees to traffic which carries data from one
network to another network directly through labels.
Virtual Private Network (VPN) is one of the highly useful MPLS applications which allow a service provider or a large enterprise
network to offer network Layer VPN services that guarantee and carries traffic securely and privately from customer’s one to
another through the service provider’s network. To support multiple customers that Customers Request for secure, reliable,
private and ultrafast connections over the internet MPLS VPN standards include the concept of a virtual router. This feature
called a VRF table. VRF or Virtual Routing and Forwarding technology that permit a router to have various routing table or
multiple VPN at the same time that they are located in the same router but they are independent and also the VRF feature in
VPN now allows different customers to use same IP addresses connected to the same ISP. A VRF exists inside a single MPLS
router and typically routers need at least one VRF for each customer attached to that particular router.
Efficient management of bandwidth in wireless networks is a critical factor for a successful communication system. Special features of wireless networks such user mobility and growth of wireless applications and their high bandwidth intensity create a major challenge to utilize bandwidth resources optimally. In this research, we propose a model for an adaptable network bandwidth management method that combines bandwidth reservation and bandwidth adaptation to reduce call blocking and dropping probabilities. The model is an integer program that determines whether or not to accept new calls and decides how to allocate bandwidth optimally in a way to maximize user satisfaction. The results of a simulation study show that the proposed method outperforms an existing method with respect to key performance measures such as call blocking and dropping probabilities and call time survivability. This survivability indicator is a new measure that is introduced for the first time in this paper. We also present a second tradeoff model to allow the network manager to control call dropping probability. The results of a second simulation study show that network users are better off if a zero call dropping policy is adopted as proposed in the first model.
Fingerprinting Based Indoor Positioning System using RSSI Bluetoothijsrd.com
Positioning is basis for providing location information to mobile users, however, with the growth of wireless and mobile communications technologies. Mobile phones are equipped with several radio frequency technologies for driving the positioning information like GSM, Wi-Fi or Bluetooth etc. In this way, the objective of this thesis was to implement an indoor positioning system relying on Bluetooth Received Signal Strength (RSS) technology and it integrates into the Global Positioning Module (GPM) to provide precise information inside the building. In this project, we propose indoor positioning system based on RSS fingerprint and footprint architecture that smart phone users can get their position through the assistance collections of Bluetooth signals, confining RSSs by directions, and filtering burst noises that can overcome the server signal fluctuation problem inside the building. Meanwhile, this scheme can raise more accuracy in finding the position inside the building.
Analyzing Video Streaming Quality by Using Various Error Correction Methods o...IJERA Editor
Transmission video over ad hoc networks has become one of the most important and interesting subjects of study for researchers and programmers because of the strong relationship between video applications and frequent users of various mobile devices, such as laptops, PDAs, and mobile phones in all aspects of life. However, many challenges, such as packet loss, congestion (i.e., impairments at the network layer), multipath fading (i.e., impairments at the physical layer) [1], and link failure, exist in transferring video over ad hoc networks; these challenges negatively affect the quality of the perceived video [2].This study has investigated video transfer over ad hoc networks. The main challenges of transferring video over ad hoc networks as well as types of errors that may occur during video transmission, various types of video mechanisms, error correction methods, and different Quality of Service (QoS) parameters that affect the quality of the received video are also investigated.
Optimal Streaming Protocol for VoD Using Clients' Residual BandwidthIDES Editor
A true VoD system has tremendous demand in the
market. The existing VoD system does not cater the needs
and demands of the market. The major problem in the VoD
system is serving of clients with expected QoS is difficult. In
this paper, we proposed a protocol and algorithm that
chains the proxy servers and subscribed clients. Our
objective is to send one server stream and this stream should
be served to N asynchronous clients. The server bandwidth
is scarcity and on the client uplink bandwidth is
underutilized. In this protocol, we are using client’s residual
bandwidth such that the load on the server bandwidth is
reduced. We have proved that optimal utilization of the
buffer and bandwidth for the entire VoD system and also
less rejection ratio of the clients.
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
http://inarocket.com
Learn BEM fundamentals as fast as possible. What is BEM (Block, element, modifier), BEM syntax, how it works with a real example, etc.
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
Content personalisation is becoming more prevalent. A site, it's content and/or it's products, change dynamically according to the specific needs of the user. SEO needs to ensure we do not fall behind of this trend.
Lightning Talk #9: How UX and Data Storytelling Can Shape Policy by Mika Aldabaux singapore
How can we take UX and Data Storytelling out of the tech context and use them to change the way government behaves?
Showcasing the truth is the highest goal of data storytelling. Because the design of a chart can affect the interpretation of data in a major way, one must wield visual tools with care and deliberation. Using quantitative facts to evoke an emotional response is best achieved with the combination of UX and data storytelling.
Succession “Losers”: What Happens to Executives Passed Over for the CEO Job?
By David F. Larcker, Stephen A. Miles, and Brian Tayan
Stanford Closer Look Series
Overview:
Shareholders pay considerable attention to the choice of executive selected as the new CEO whenever a change in leadership takes place. However, without an inside look at the leading candidates to assume the CEO role, it is difficult for shareholders to tell whether the board has made the correct choice. In this Closer Look, we examine CEO succession events among the largest 100 companies over a ten-year period to determine what happens to the executives who were not selected (i.e., the “succession losers”) and how they perform relative to those who were selected (the “succession winners”).
We ask:
• Are the executives selected for the CEO role really better than those passed over?
• What are the implications for understanding the labor market for executive talent?
• Are differences in performance due to operating conditions or quality of available talent?
• Are boards better at identifying CEO talent than other research generally suggests?
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.
PERFORMANCE COMPARISON OF PACKET SCHEDULING ALGORITHMS FOR VIDEO TRAFFIC IN L...ijmnct
In this paper we have studied downlink packet scheduling algorithms proposed for LTE cellular networks.
The study emphasize on three most promising scheduling algorithms such as: FLS, EXP rule and LOG rule.
The performance of these three algorithms is conducted over video traffic in a vehicular environment using
LTE-Sim simulator. The simulation was setup with varying number of users from 10 - 60 in fixed bounded
regions of 1 km radius. The main goal this study is to provide results that will help in the design process of
packet scheduler for LTE cellular networks, aiming to get better overall performance users. Simulation
results show that, the FLS scheme outperforms in terms of average system throughput, average packet
delay, PLR; and with a satisfactory level of fairness index.
Video contents prior storing server forIJCNCJournal
One of the most important multimedia applications is Internet protocol TV (IPTV) for next-generation
networks. IPTV provides triple-play services that require high-speed access networks with the functions of
multicasting and quality of service (QoS) guarantees. Among optical access networks, Ethernet passive
optical networks (EPONs) are regarded as among the best solutions to meet higher bandwidth demands. In
this paper, we propose a new architecture for multicasting live IPTV traffic in optical access network. The
proposed mechanism involves assigning a unique logical link identifier to each IPTV channel. To manage
multicasting, a prior storing server in the optical line terminal (OLT) and in each optical network unit
(ONU) is constructed. In this work, we propose a partial prior storing strategy that considers the changes
in the popularity of the video content segments over time and the access patterns of the users to compute
the utility of the objects in the prior storage. We also propose to partition the prior storage to avoid the
eviction of the popular objects (those not accessed frequently) by the unpopular ones which are accessed
with higher frequency. The popularity distribution and ageing of popularity are measured from two online
datasets and use the parameters in simulations. Simulation results show that our proposed architecture can
improve the system performance and QoS parameters in terms of packet delay, jitter and packet loss.
A Real-Time Adaptive Algorithm for Video Streaming over Multiple Wireless Acc...Priti Kana
JP INFOTECH, offering bulk 2014 and 2015 IEEE Project titles for CSE, IT, ECE, EEE final year students. We are guide to give a best projects for your academic and future career.
Stabilization of Variable Bit Rate Video Streams Using Linear Lyapunov Functi...ijait
Streaming videos over wireless networks suffers from low video quality due to network ability limitations. The quality of the channel and the characteristics of source play the major role in transmitting video stream over mobile environments. On failure of wireless video transmission, retransmission method was employed to improve the reliability of wireless link. However, retransmission of video leads to significant impact on energy consumption and bounded average waiting time is also increased. The longer waiting time on retransmission results in buffer starvation. Therefore, it is desirable to reduce the variable bit rate of transmitted video signal and increase the stability level when buffer starvation is occurs. In order to overcome such limitation, a technique named Response based Stabilization Analysis (RSA) using Distributed Optimality Bit Rate Allocation (RSA-DOBRA) is proposed in this paper. Initially, video stream is segregated into frames of different classes (i.e., size). Each frame is transmitted based on the variable bit rate response using Optimal Quantization process. Secondly, Linear Lyapunov Functions is employed with RSA to prove the stability of different bit rates on wireless video streaming. The application of Linear Lyapunov Function maintains the stability level of bit rate on different class of frame transmission on wireless link. Finally, Distributed Optimality Bit Rate Allocation uses the time slicing procedure to reduce the bounded average waiting time. RSA performs the time slicing based on multiplexed wireless video transmission on variable bit rate to avoid buffer starvation. RSA at the final stage reduces the energy consumption by improving the reliability of wireless link. Experiment is conducted on factors such as buffered starvation rate, waiting time on video frame transmission, and energy consumption rate.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
In this paper, we have proposed a hybrid push-pull protocol for peer-to-peer live video streaming. The
main goal of this research is to minimize the network end-to-end delay in comparison to pure mesh
networks. Hybrid protocols, in most cases, suffer from complex construction and maintenance. Therefore,
our proposed protocol uses a pure mesh topology and a single layer video coding. In summary, our pushpull
protocol has two parts. The pull-based part which is done on the mesh network, and the push-based
part which consists of two phases: parent selection and tree construction. When a push procedure appears,
it is very important to prevent data redundancy. To satisfy this condition, we have introduced a parent
selection method. In this method, by parent selection based on the minimum arrival time, the most stable
node will be selected. This node has the advantage of maximizing the expected service time of the tree.
Using this method, there is no need for maintaining any extra information and topology control data.
Finally, we do performance evaluation using OMNeT++ simulator. The simulation results show that the
proposed architecture has better performance in start-up delay, end-to-end delay, and distortion than pure
mesh-based network.
A Distortion-Resistant Routing Framework for Video Traffic in Wireless Multih...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
MODELLING AND PREFORMANCE ANALYSIS FOR VIDEO ON DEMAND PRIOR STORING SERVER ijwmn
To handle the demand for mobile video is increased in the future. The mobile carriers should improve
Video-on-Demand (VoD) System in order to increase video data transfer rate, then improve the system
performance and quality of service (QoS). In this project, we suggest a new architecture for online video
content in 4G LTE networks. The proposed structure includes a prior storing serve in the eNode Base
Station. It applies in every mobile network unit and mobile phone. In this work, we suggest a partial prior
storing strategy. The Prior Storage Server is divided into Prior Storage 1 and Prior Storage 2. The video
content depend on the popularity and value of utility to determine to store in Prior Storage 1 or Prior
Storage 2. The partial prior storage can avoid eject the popular video content by the unpopular video
content. In the project, we use RT-PEPA to model the behaviour of LTE Network and analyse the
performance of LTE Network. Simulation results show that our proposed architecture can improve the
system performance and QoS parameters in terms of packet loss, packet delay and jitter.
A HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMINGijp2p
In this paper, we have proposed a hybrid push-pull protocol for peer-to-peer live video streaming. The
main goal of this research is to minimize the network end-to-end delay in comparison to pure mesh
networks. Hybrid protocols, in most cases, suffer from complex construction and maintenance. Therefore,
our proposed protocol uses a pure mesh topology and a single layer video coding. In summary, our pushpull protocol has two parts. The pull-based part which is done on the mesh network, and the push-based
part which consists of two phases: parent selection and tree construction. When a push procedure appears,
it is very important to prevent data redundancy. To satisfy this condition, we have introduced a parent
selection method. In this method, by parent selection based on the minimum arrival time, the most stable
node will be selected. This node has the advantage of maximizing the expected service time of the tree.
Using this method, there is no need for maintaining any extra information and topology control data.
Finally, we do performance evaluation using OMNeT++ simulator. The simulation results show that the
proposed architecture has better performance in start-up delay, end-to-end delay, and distortion than pure
mesh-based network.
A HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMINGijp2p
In this paper, we have proposed a hybrid push-pull protocol for peer-to-peer live video streaming. The
main goal of this research is to minimize the network end-to-end delay in comparison to pure mesh
networks. Hybrid protocols, in most cases, suffer from complex construction and maintenance. Therefore,
our proposed protocol uses a pure mesh topology and a single layer video coding. In summary, our pushpull protocol has two parts. The pull-based part which is done on the mesh network, and the push-based
part which consists of two phases: parent selection and tree construction. When a push procedure appears,
it is very important to prevent data redundancy. To satisfy this condition, we have introduced a parent
selection method. In this method, by parent selection based on the minimum arrival time, the most stable
node will be selected. This node has the advantage of maximizing the expected service time of the tree.
Using this method, there is no need for maintaining any extra information and topology control data.
Finally, we do performance evaluation using OMNeT++ simulator. The simulation results show that the
proposed architecture has better performance in start-up delay, end-to-end delay, and distortion than pure
mesh-based network.
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.
Decision Making Analysis of Video Streaming Algorithm for Private Cloud Compu...IJECEIAES
The issue on how to effectively deliver video streaming contents over cloud computing infrastructures is tackled in this study. Basically, quality of service of video streaming is strongly influenced by bandwidth, jitter and data loss problems. A number of intelligent video streaming algorithms are proposed by using different techniques to deal with such issues. This study aims to propose and demonstrate a novel decision making analysis which combines ISO 9126 (international standard for software engineering) and Analytic Hierarchy Process to help experts selecting the best video streaming algorithm for the case of private cloud computing infrastructure. The given case study concluded that Scalable Streaming algorithm is the best algorithm to be implemented for delivering high quality of service of video streaming over the private cloud computing infrastructure.
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.
Broadcasting protocols has the ability to improve the efficiency of VOD service by minimizing the bandwidth required to transfer video’s to client as requested. Harmonic broadcasting protocol is the most protocol among this those protocols. Here I present the characteristics and functionalities of Poly-harmonic Broadcast- ing Protocol. At the end of this paper , i also established a hypothesis to modify this Poly-harmonic Protocol so that client can receive the requested data at less waiting time along with less buffer storage.
The main problem is to avoid the complexity of retrieving the video content without streaming problem in multi network clients. The proposed work is to improve Collaboration among streaming contents on server resources in order to improve the network performance. Implementing network collaboration on a content delivery scenario, with a strong reduction of data transferred via servers. Audio and video files are transmitted in blocks to clients through the peer using the Network Coding Equivalent Content Distribution scheme. The objective of the system is to tolerate out-of-order arrival of blocks in the stream and is resilient to transmission losses of an arbitrary number of intermediate blocks, without affecting the verifiability of remaining blocks in the stream. To formulate the joint rate control and packet scheduling problem as an integer program where the objective is to minimize a cost function of the expected video distortion. Suggestions of cost functions are proposed in order to provide service differentiation and address fairness among users.
Similar to Opportunistic and playback sensitive scheduling for video streaming (20)
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
"Impact of front-end architecture on development cost", Viktor Turskyi
Opportunistic and playback sensitive scheduling for video streaming
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
DOI : 10.5121/ijwmn.2014.6101 01
OPPORTUNISTIC AND PLAYBACK-SENSITIVE
SCHEDULING FOR VIDEO STREAMING
Huda Adibah Mohd Ramli1
and Kumbesan Sandrasegaran2
1
Department of Electrical and Computer Engineering, International Islamic University
Malaysia (IIUM), Kuala Lumpur, Malaysia
2
Faculty of Engineering and Information Technology, University of Technology,
Sydney, Australia
ABSTRACT
Given the strict Quality of Service (QoS) requirements of video streaming, this paper proposes a novel
solution for simultaneous streaming of multiple video sessions over a mobile cellular system. The proposed
solution combines a buffer management strategy with a packet scheduling algorithm. The buffer
management strategy selectively discards packets of a user from base station buffer whereas the packet
scheduling algorithm schedules packets of a user according to its instantaneous channel quality, average
throughput and playback buffer information. Simulation results demonstrate that the proposed solution is
effective in providing a continuous video playback with good perceptual quality for more users. If at least a
good perceptual quality is to be satisfied for all users (QoS constraint of video streaming), then the
proposed solution improves the system capacity by 40% over a conventional packet scheduling algorithm.
KEYWORDS
Packet scheduling, video streaming, Long-Term Evolution, Quality of Service, Orthogonal Frequency
Division Multiple Access.
1. INTRODUCTION
Long Term Evolution (LTE), which is now referred to as 3.9G, is the latest commercially
available Third Generation Partnership Project (3GPP) standard. The LTE is envisaged to provide
a better quality of multimedia communications by providing higher data rates (50 Mbps in uplink
and 100 Mbps in downlink), reduced latency and increased capacity and coverage. The LTE is a
multi-carrier mobile cellular system. It uses Orthogonal Frequency Division Multiple Access
(OFDMA) for downlink transmission. The bandwidth in the downlink LTE is divided into
multiple equally spaced and mutually orthogonal sub-carriers. The minimum downlink LTE
transmission unit that can be allocated to a user is referred to as a Resource Block (RB). An RB is
made up of 12 sub-carriers of 1 ms duration [1].
Recent trends have shown an increase in popularity of video streaming application among mobile
cellular users [2]. For transport over mobile cellular channels, a video stream is encoded
(compressed) into frames of different properties (namely I, P and B frames) in order to reduce the
bandwidth requirements [3]. There are multiple Group of Pictures (GoPs) within an encoded
video stream. A GoP starts with an I frame and all frames prior to the subsequent I frame [4].
Each frame within a GoP has a different priority and is highly co-related. The I frame has the
highest priority followed by the P and B frames. It should be noted that decoding of a P frame
within a GoP is dependent upon an I frame within the same GoP and decoding of a B frame
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
2
within a GoP is dependent upon an I and P frames within the same GoP. The loss of a higher
priority frame within a GoP results in the loss of other dependent frames within the same GoP [5].
Even when the video stream is compressed, it still requires large bandwidth. Simultaneous
transmissions of this bandwidth-hungry video streaming application is challenging as it may lead
to a mobile cellular congestion if the expensive radio resources are not properly scheduled.
Another challenge is that streaming of multiple video sessions simultaneously requires a
continuous video playback at the highest perceptual quality at each user (Quality of Service, QoS,
constraint of video streaming) [6].
Numerous studies have been discussed in the literature so as to address the stated challenges. For
example, the authors in [7] developed a buffer management strategy that selectively discard
packets of video users at the base station according to their priority and deadline. Note that packet
is a segment of a video frame. This strategy ensures that the limited radio resources are efficiently
used for transmission of packets that can be used for decoding and video playback and hence
improving the perceptual quality experience at the users. Frequent interruptions during video
playback may cause major annoyance to the video users. As such, a buffer management strategy
that attempts to improve video playback continuity by minimizing the number of interruptions
during video playback was developed in [8].
Besides the buffer management strategy, packet scheduling is another area of research interest
when dealing with simultaneous transmission of multiple video users. Packet scheduling is
responsible to efficiently select a user’s packets for (re)transmission at a given time using an
available radio resource so as to provide a satisfactory QoS, guarantee fairness and optimize
system performance. Proportional Fair (PF) [9] is one of the well-known packet scheduling
algorithms in the legacy single-carrier mobile cellular systems. This algorithm takes channel
quality and average throughput of each user into consideration when making scheduling decision.
In addition to that, a packet scheduling algorithm that delays transmission of the least important
packets and allocates more radio resources for transmission to more important packets was
developed in [10]. The algorithm was developed in order to avoid mobile cellular congestion and
ensure a continuous video playback.
Other studies in the literature combined a buffer management strategy with packet scheduling
algorithm. It should be noted that the following discussions refers the combination of a buffer
management strategy with packet scheduling algorithm as a packet scheduling solution. To ensure
timely arrival of video packets at a user, the authors in [11] developed a packet scheduling
algorithm that schedules packets of a user on the basis of its channel quality and frame delay. This
packet scheduling algorithm is then combined with a buffer management strategy that discards
packet and other dependent packets if they are likely to arrive at the user end after the playback
deadline. The playback deadline is the time when a frame is needed for video playback and each
frame is attributed with this deadline. A packet scheduling solution that aimed to improve the
perceptual quality among all video users was developed in [12]. The developed packet scheduling
algorithm schedules packets of a user according to its perceptual quality, channel quality and
decoding deadline. Decoding deadline is the time when a frame is needed for decoding at a user
end. The buffer management strategy developed in this study discards a packet and other
dependent packets at base station if the time when the packet is needed for decoding at a user end
has passed. Similarly, the authors in [13] developed a solution that attempts to improve perceptual
quality across all video users. The packet scheduling algorithm developed in the study determines
priority of a user’s packets according to its channel quality, average throughput, priority of a
frame, playback buffer information (the playback buffer is located at Application Layer at a user
end) and whether any packets have been transmitted to the user or not. If a packet is discarded at a
user for playback deadline violation, the developed buffer management strategy discards all
packets that are dependent to the discarded packet at the base station.
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
3
The aforementioned studies mostly focus in satisfying either the perceptual quality or video
playback continuity, but not both. A continuous video playback does not mean that an excellent
perceptual quality is experienced at the user (i.e. the video playback may be continuous but with a
poor perceptual quality as a number of frames in a video stream is lost). Similarly, a user may
experience a good perceptual quality but has to tolerate with a large number of playback
interruptions (i.e. a video playback is interrupted if a frame is not available when it is needed for
playback or due to playback buffer underflow). To address this situation, this paper proposes a
novel packet scheduling solution known as Opportunistic and Playback-Sensitive Scheduling
(OPSS) for usage in the downlink LTE. OPSS is a combination of a buffer management strategy
and a packet scheduling algorithm. It aims to optimize the system capacity (number of users)
without compromising the QoS constraint of video streaming (i.e. a continuous video playback at
the highest perceptual quality for each user).
The remaining sections of this paper are organized as follows: Section 2 gives an overview of the
video streaming followed by a detailed description of the proposed packet scheduling solution in
Section 3. Section 4 contains environment of the simulation while Section 5 evaluates
performance of the OPSS against a well-known packet scheduling algorithm. Finally, Section 6
concludes the paper.
2. VIDEO STREAMING OVERVIEW
As previously discussed in Section 1, simultaneous streaming of multiple video sessions requires
a continuous video playback at the highest perceptual quality at each user. Generally, the
perceptual quality is measured on the basis of Peak-Signal-to-Noise-Ratio (PSNR) [14] or Mean
Opinion Score (MOS) [15] metrics. Note that the PSNR of a user can be mapped to a MOS value
to give a qualitative representation of the perceptual quality. The MOS contains a scaled value
from 1 to 5 that implies a bad to an excellent perceptual quality (as illustrated in Table 1).
Table 1. Average PSNR to MOS mapping [16]
Lowest
Average
PSNR (dB)
Minimum
MOS
Perceptual
Quality
< 20 1 Bad
20 – 25 2 Poor
25 – 31 3 Fair
31 – 37 4 Good
> 37 5 Excellent
Video streaming allows a user to start a video playback without receiving an entire video stream.
A typical approach for ensuring a continuous playback is to delay the start of a video playback
until the total number of frames in the playback buffer exceeds a buffering threshold [17]. The
buffering threshold is defined as the maximum number of frames required to be filled in the
playback buffer at a user end before the user can start or resume a video playback.
The video streaming properties and the mobile cellular channels characteristics may lead to
interruptions during the video playback [18, 19]. Interruption occurs when the total number of
frames in the playback buffer is less than a playback buffer underflow threshold. The playback
buffer underflow threshold is defined as the maximum number of frames required to be available
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
4
in the playback buffer for a continuous playback. The video playback resumes at the same
position where the interruption occurs after the total number of frames in the playback buffer
exceeds the specified buffering threshold.
A user will not be satisfied if it has to wait longer to start or resume its video playback. Freezing
Delay Ratio (FDR) metric [6] which gives a total delay experienced by each user throughout its
video session is used to measure the video playback continuity. Note that a low FDR implies that
all users are likely to experience continuous video playback throughout their sessions. A high
FDR indicates that a number of users are likely to have waited for an amount of time before they
can start their video playback or there a number of interruptions occurred throughout these users’
video sessions.
An example of the freezing delay where it takes ε ms for the first bit of the video stream to arrive
and being stored in the playback buffer after a user requests for a video session is illustrated in
Figure 1. The video playback starts after it has been delayed for α ms. This delay is used to fill in
the playback buffer such that the total number of frames in the playback buffer exceeds the
buffering threshold. The video playback is interrupted if the total number of frames is less than
the playback buffer underflow threshold. The video playback resumes after β ms. This time
duration is used to re-fill in the playback buffer such that the total number of frames in the
playback buffer exceeds the buffering threshold.
Figure 1. Example of freezing delay during a video session
A frame needs to be decoded first before it can be played back. Some frames cannot be decoded if
a higher priority frame is lost. These frames are discarded at the user. A number of studies (i.e. [7,
11, 12]) considered a scenario that discards a frame and other dependent frames if the frame
arrives at the playback buffer after its decoding or playback deadline. These studies generally
aimed to minimize frame loss ratio as the loss of frames due to frame discards degrades the
perceptual quality experienced at the users. However, this paper considers a scenario that does not
discard packets/frames for decoding/playback deadline violation.
3. OPPORTUNISTIC AND PLAYBACK SENSITIVE SCHEDULING
This section presents a novel packet scheduling solution called OPSS so as to ensure a continuous
video playback at the highest perceptual quality for more users. This solution is proposed for
usage in the multi-carrier downlink LTE. Detailed descriptions of the buffer management strategy
and packet scheduling algorithm of the OPSS are discussed in the following sections.
3.1 Buffer Management Strategy
All packets arriving at the user end are delivered in sequence towards the playback buffer through
the use of re-sequencing buffer. Whenever a TB (with a known Transmission Sequence Number -
TSN) is erroneously received at the user, all subsequent TBs with higher TSNs that are correctly
received by the user are stored in the re-sequencing buffer and a re-sequencing timer is started.
The packets of out-of-sequence TBs are delivered towards the playback buffer upon a correct
reception of the erroneous TB or upon expiry of the re-sequencing timer [20]. In this paper,
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
5
packets of a TB are discarded and considered as lost packets only if the TB has exceeded
maximum number of retransmissions or the re-sequencing timer associated with the TB has
expired.
The loss of video packets will degrade video quality. Degradation will be significant if higher
priority packets that are to be used for decoding other dependent packets are lost. Whenever a
packet is lost, there may be one or more packets belonging to the same frame to the lost packet or
are dependent to the lost packet are still residing in the base station buffer. These packets should
not be transmitted to the user as the packets cannot be used for decoding or video playback (due
to their dependency to the lost packet). Therefore, the buffer management strategy of the OPSS
discards these packets from the base station buffer such that the available radio resources are
efficiently used for (re)transmission of packets that can be used for decoding and video playback.
All packets are stored in a transmission buffer at the base station upon transmission. The time
duration that each packet has been residing in the transmission buffer is known to the base station.
Moreover, the maximum duration that a packet can reside in a re-sequencing buffer at the user is
also known at the base station. One or more packets may have resided long enough within the
transmission buffer such that, if they are retransmitted, they are likely to arrive at the user end
after the re-sequencing timer expires. To avoid this situation, the buffer management strategy
discards these packets from the transmission buffer.
The buffer management strategy proposed in this paper is almost similar to the strategies
discussed in [7, 11-13] that discard packets at the base station (i) due to packets dependency or
(ii) if the packets are likely to arrive at the user after the deadline. Additionally, similar to [13],
the playback buffer information is considered in the proposed packet scheduling algorithm as it
plays a role in ensuring a continuous video playback [19]. Note that the playback buffer is only
updated when all packets belonging to a frame have correctly arrived at the playback buffer. On
the contrary, the OPSS differs from other solutions as the proposed packet scheduling algorithm
uses different formulation when determining priority of each user for packets transmission.
Detailed description of the proposed packet scheduling algorithm is described next.
3.2 Packet Scheduling Algorithm
In each scheduling interval and on each RB, the packet scheduling algorithm of the OPSS
schedules a user that maximizes µi,j(t) in the following equation:
( )
−
=
pb
i
i
ji
ji
tPB
tR
tr
t
α
µ
)(
1*
)(
)(
)( 2
,
,
(1)
)1(*
1
)(
1
1)1( ++
−=+ trtot
t
tR
t
tR i
c
i
c
i
(2)
∑=
+=+
max
1
, )1()1(
RB
j
jii trtrtot
(3)
where µi,j(t) is the priority of user i on RB j at scheduling interval t, ri,j(t) is the instantaneous data
rate of user i on RB j at scheduling interval t, Ri(t) is the average throughput of user i at
scheduling interval t, PBi(t) is the total number of frames in playback buffer of user i at
scheduling interval t, αpb is the playback buffer weighting factor (it scales the second multiplicand
in Equation (1) to be between 0 and 1), tc is a time constant, rtoti(t+1) is the total data rate being
used to transmit packets to user i at scheduling interval t+1, and RBmax is the maximum available
number of RBs. Note that the playback buffer weighting factor is used to avoid the scheduling
decision to be dependent upon playback buffer information only as the value for the first
multiplicand in Equation (1) is between 0 and 1.
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
6
The proposed algorithm is more likely to give scheduling opportunity to a user with the least
number of frames in its playback buffer if the channel quality and the average throughput of each
user are similar. If one or more TBs are erroneously received at the user, it will take a longer time
to update the playback buffer as all subsequent TBs with higher TSNs than the erroneous TBs that
may have been correctly arrived at the user are stored in the re-sequencing buffer. The packets of
out-of-sequence TBs are only delivered to the playback buffer upon correct reception of the
erroneous TBs or upon expiry of the re-sequencing timer. Scheduling opportunity is highly likely
to be given to this user in subsequent scheduling intervals if its playback buffer is not updated.
The average throughput is used in the proposed algorithm to compensate for the effect of the
delay in playback buffer update. In this case, the user priority decreases in subsequent scheduling
intervals as more packets are transmitted to the user. After a number of scheduling intervals, even
if the user has the least number of frames in its playback buffer, scheduling opportunity is highly
likely to be given to other users due to the transmission history of this user.
It can be observed in Equation (1) that the formulation of the proposed packet scheduling
algorithm is dependent upon three variables namely channel quality, average throughput and
playback buffer information. The relevance of each variable is justified next. A number of studies
(i.e. [21-24]) have shown that scheduling opportunity that considers channel quality can
significantly improve the system performance. Therefore, this variable is considered in the
proposed algorithm. However, even though the packets of each selected user can be transmitted
with a better modulation and coding scheme, the packet scheduling algorithm that is dependent
upon channel quality alone is inefficient in fairness as it deprives users located at the cell edge
from receiving their packets.
To address the fairness problem, the average throughput variable is taken into consideration in the
proposed algorithm. The update of the average throughput increases the priority of users whose
packets are not scheduled in the previous scheduling intervals. Therefore, the packets of these
users are likely to be scheduled in the sub-sequent scheduling intervals. Additionally, this variable
is used to compensate for the effect of delay in playback buffer update (as discussed previously in
this section). Finally, the playback buffer information is considered in order to ensure that all
users are given an equal opportunity for video playback. This allows the OPSS to minimize the
delay before the users can start or resume their video playback. Moreover, this variable attempts
to maintain a continuous video playback by giving a higher priority for packets transmission to
the users with least number of frames in their playback buffer (if the channel quality and the
average throughput of each user are similar) so as to avoid the video playback from being
interrupted due to playback buffer underflow.
4. SIMULATION ENVIRONMENT
The performance of the OPSS was evaluated within a single hexagonal cell scenario of 5 MHz
bandwidth with 25 RBs and 2 GHz carrier frequency. The base station has a fixed location at the
centre cell and it was assumed that equal transmit power (43.01 dBm total base station transmit
power) is used on each RB. Each user moves at a constant speed of 3 km/h. These users are
uniformly located within the cell. The Cost-231 HATA model for an urban environment [25], a
Gaussian log-normal distribution with 0 mean and 8 dB standard deviation [26] and a frequency-
flat Rayleigh fading model [27] are used to model the radio propagation channel. The probability
that the channel quality information report is in error was fixed at 1% and this report is only
available for use by the base station after a 4 ms delay [28]. It was assumed that besides the CQI
and Hybrid Automatic Repeat Request (HARQ) information, the feedback from a user also
contains playback buffer information.
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
7
Three video streams which were downloaded from a publicly available video traces [4] were
used. The video streams were encoded with a frame rate of 30 fps (frames per second). One GoP
contains 16 frames with IBBBPBBBPBBBPBBB sequence. Each frame has a number, type (I, P
or B frame), decoding/playback deadline, size and PSNR value of the luminance component. A
user randomly requests one video stream throughout its session and the request arrives at the base
station at the beginning of the simulation. It was assumed in this performance study that: (i) a
video playback is interrupted if a frame is not available when it is needed for playback (i.e. the
frame is not discarded if it arrives at the playback buffer after the playback deadline [18, 19]), (ii)
the playback buffer capacity of each user is infinite and (iii) the playback buffer underflow
threshold is fixed at 5 frames.
Minimum MOS and FDR metrics are used for performance evaluation. In this paper, the
minimum MOS evaluates the perceptual quality where a user with the lowest average PSNR
among other video users is considered. In this case, a low minimum MOS (i.e. minimum MOS=1,
see Table 1) indicates that at least one user is experiencing a bad perceptual quality whereas a
high minimum MOS (i.e. minimum MOS=4) indicates that all users are experiencing at least a
good perceptual quality. The FDR is defined in this paper as the average of the ratio of total
freezing delay of each user to the total simulation time. Equation (4) gives the mathematical
expression of the FDR [29]:
∑
=
=
=
Ni
i
i
T
Df
N
FDR
1
1 (4)
where Dfi is the total freezing delay of user i, T is the total simulation time and N is the total
number of users.
The results obtained via computer simulation of the OPSS solution were evaluated and compared
with the well-known PF algorithm. The PF was chosen as it is one of the packet scheduling
algorithms that provides considerably good performance in the legacy single-carrier mobile
cellular systems. Moreover, due to its efficiency, the authors in [30-33] all extended the PF
algorithm into multi-carrier mobile cellular systems. Packet scheduling in the single-carrier
mobile cellular systems allocates all of the available radio resources to a single user in each
scheduling interval. As such, the PF equations that support packet scheduling in the downlink
LTE system as described [33] is used in this performance evaluation.
5. PERFORMANCE RESULTS AND DISCUSSIONS
The following sections compare the performance of the OPSS with the PF algorithm for different
system capacities and buffering threshold.
5.1 Performance Comparison with Increasing System Capacity
Figure 2 and Figure 3 show the minimum MOS and FDR of the OPSS solution and PF algorithm
with increasing system capacity. The buffering threshold of each user was fixed at 200 ms in this
performance comparison. It can be observed that the minimum MOS and FDR degrade with
increasing system capacity as there are insufficient RBs to schedule the video packets from the
users. Table 2 shows that if at least a good perceptual quality has to be satisfied for all users, then
the maximum system capacities that the OPSS and PF can simultaneously support are 35 and 25
users respectively. This is equivalent to 40% improvement in the system capacity achieved in the
OPSS over the PF algorithm. Moreover, it can be observed in Table 3 that when the system
capacity is at 35 users, the OPSS significantly minimizes the FDR by 42.6% compared to the PF
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
8
algorithm. This indicates that the OPSS solution is superior to the PF algorithm in providing a
continuous playback for all video users.
Figure 2. Minimum MOS vs. system capacity
Figure 3. FDR vs. system capacity
Table 2. Maximum system capacities to support a range of minimum MOS
Minimum
MOS
Perceptual
Quality
Maximum
System capacity
OPSS PF
1 Bad >40 40
2 Poor 40 30
3 Fair 37.5 27.5
4 Good 35 25
5 Excellent 20 20
9. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
9
Table 3. FDR at 35 users
FDR
Improvement in
OPSS over PF (%)
PF 0.143571
42.6
OPSS 0.082446
The improvements in the minimum MOS and FDR performances in OPSS compared to the PF
algorithm can be attributed to the following factors. The buffer management strategy enables the
OPSS to efficiently utilize the available RBs by selectively (re)transmitting packets that can be
used for decoding and video playback. Furthermore, OPSS integrates the playback buffer
information in the packet algorithm so as to ensure a continuous video playback for each user.
5.2 Impact of Buffering Threshold on Performance
The impact of buffering threshold on the OPSS solution and PF algorithm are studied in this
section. In this performance comparison, the system capacity was fixed at 25 users (i.e. the
system capacity where all users experience at least a good perceptual quality in OPSS and PF – as
shown in Figure. 2). As previously discussed in Section 2, the start or resume of a video playback
is delayed with increasing buffering threshold because more frames need to be filled in the
playback buffer. As there is insufficient time to playback all of the video frames of a user (i.e. the
maximum duration of a video session is fixed at T ms for each user), one or more frames of the
user may not be able to be played back at the end of its session and this leads to degradations of
the minimum MOS and FDR with increasing buffering threshold (as shown in Figure 4 and
Figure 5).
Figure 4 shows that the OPSS minimizes degradation due to the impact of the buffering threshold
because it is capable of providing an excellent perceptual quality (minimum MOS=5) for all users
for up to 600 ms buffering threshold. On the other hand, at least one user in the PF algorithm
experienced a bad perceptual quality (minimum MOS=1) at the 600 ms buffering threshold. This
implies that the majority of the frames of a number of users cannot be played back when their
video sessions end due to the time taken to start or resume the video playback.
When compared with the PF algorithm, it can be observed in Figure 5 that the OPSS significantly
minimizes the FDR at a lower buffering threshold. The packet scheduling algorithm of the OPSS
gives a higher priority for a user with the least number frames to receive its packets. At a lower
buffering threshold, the users in the OPSS can fill their playback buffer with sufficient number of
frames earlier than the PF algorithm and hence allowing OPSS to minimize the delay to start or
resume the video playback. Table 4 shows that the OPSS minimizes the FDR by 58.7% compared
to the PF algorithm at 200 ms buffering threshold.
10. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
10
Figure 4. Minimum MOS vs. buffering threshold
Figure 5. FDR vs. buffering threshold
The PF algorithm is likely to outperform the OPSS in terms minimizing the FDR when the
buffering threshold is over 800 ms. This is because there is only a limited number of frames that
can be played back in the PF algorithm (i.e. minimum MOS=1 in the PF at 800 ms buffering
threshold). Note that the freezing delay is only computed for the frames that can be played back at
the users. On the other hand, even if the FDR in the OPSS is likely to be worse than the PF
algorithm when the buffering threshold increases above 800 ms, the OPSS guarantees that
majority of the frames can be played back throughout each user’s session and hence improving
the perceptual quality experienced at the users.
Table 4. FDR at 200 ms buffering threshold
FDR
Improvement in
OPSS over PF (%)
PF 0.082552
58.7
OPSS 0.034056
11. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
11
6. CONCLUSION
Simultaneous streaming of multiple video sessions is a challenging task due to the QoS constraint
of video streaming as well as unreliable and resource-constrained of the downlink LTE. A
number of studies that attempted to address this challenge by improving the perceptual quality or
ensuring video playback continuity have been developed. This paper proposes a novel solution
that combines the buffer management strategy with packet scheduling algorithm to improve video
streaming performance in the downlink LTE. It was demonstrated via computer simulation that
the proposed solution is particularly effective in providing a continuous video playback with good
perceptual quality for more users. If at least a good perceptual quality is to be satisfied for all
users (QoS constraint of video streaming), then the proposed solution improves the system
capacity by 40% over the PF algorithm. Moreover, it minimizes the video playback interruption
by 42.6% as compared to the PF algorithm. The proposed solution has a low computational
complexity and hence suited for implementation in the downlink LTE and other multi-carrier
mobile cellular systems without additional hardware cost.
ACKNOWLEDGMENT
This work is supported by International Islamic University Malaysia (IIUM) Endowment Fund
Type B (EDW B11-198-0676).
REFERENCES
[1] Holma, H. & Toskala, A. (2009) LTE for UMTS: OFDMA and SC-FDMA Based Radio Access. John
Wiley & Sons Ltd.
[2] Fan, L., Guizhong, L. & Lijun, H. (2009) Application-Driven Cross-Layer Approaches to Video
Transmission over Downlink OFDMA Networks. in IEEE Global Telecommunications Workshops,
1-6.
[3] Sun, H. Vetro, A. & Xin, J. (2007)An Overview of Scalable Video Streaming. Wireless
Communications and Mobile Computing, 7(2), 159-172.
[4] Seeling, P., Reisslein, M. & Kulapala, B. (2004) Network Performance Evaluation Using Frame Size
and Quality Traces of Single-Layer and Two-Layer Video: A Tutorial. IEEE Communications
Surveys & Tutorials, 6(3), 58-78.
[5] Haghani, E. Shyam, P. Doru, C. Eunyoung, K. & Ansari, N. (2009) A Quality-Driven Cross-Layer
Solution for MPEG Video Streaming Over WiMAX Networks. IEEE Transactions on Multimedia,
11(6), 1140-1147.
[6] Ozcelebi, T., Sunay, M.O., Tekalp, A.M. & Civanlar, M.R. (2005) Cross-Layer Design for Real-Time
Video Streaming over 1xEV-DO using Multiple Objective Optimization, in IEEE Global
Telecommunications Conference, 2761-2766.
[7] Haghani, E., Ansari, N., Shyam, P. & Doru, C. (2010) Traffic-Aware Video Streaming in Broadband
Wireless Networks. in IEEE Wireless Communications and Networking Conference, 1-6.
[8] Yongjin, C. Kuo, C.C.J., Renxian, H. & Lima, C. (2009) Cross-Layer Design for Wireless Video
Streaming. in IEEE Global Telecommunications Conference, 1-5.
[9] Jalali, A., Padovani, R. & Pankaj, R. (2000) Data Throughput of CDMA-HDR a High Efficiency-
High Data Rate Personal Communication Wireless System. in IEEE 51st Vehicular Technology
Conference Proceedings, 1854-1858.
12. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
12
[10] Boggia, G., Camarda, P., Fortuna, R. & Grieco, L.A. (2009) A Scheduling Strategy to Avoid Playout
Interruptions in Video Streaming Systems. in Proceedings of 18th Internatonal Conference on
Computer Communications and Networks. 1-6.
[11] Junhua, T., Liren, Z. & Chee-Kheong, S. (2006) An Opportunistic Scheduling Algorithm for MPEG
Video Over Shared Wireless Downlink. in IEEE International Conference on Communications. 872-
877.
[12] Honghai, Z., Yanyan, Z., Khojastepour, M.A. & Rangarajan, S. (2009) Scalable Video Streaming
over Fading Wireless Channels. in IEEE Wireless Communications and Networking Conference. 1-6.
[13] Tupelly, R.S., Zhang, J. & Chong, E.K.P. (2003) Opportunistic Scheduling for Streaming Video in
Wireless Networks. in Conference on Information Sciences and Systems. 1-6.
[14] Seeling, P., Reisslein, M. & Fitzek, F.H.P. (2006) Layered Video Coding Offset Distortion Traces for
Trace-Based Evaluation of Video Quality after Network Transport. in 3rd IEEE Consumer
Communications and Networking Conference, 292-296.
[15] Zhenzhong, C., Maodong, L. & Yap-Peng, T. (2010) Perception-Aware Multiple Scalable Video
Streaming Over WLANs. IEEE Signal Processing Letter. 17(7), 675-678.
[16] Klaue, J., Rathke, B. & Wolisz, A. (2003) Evalvid - A Framework for Video Transmission and
Quality Evaluation. in 13th International Conference on Modelling Techniques and Tools for
Performance Evaluation. 1-5.
[17] Guanfeng, L. & Ben, L. (2008) Effect of Delay and Buffering on Jitter-Free Streaming Over Random
VBR Channels. IEEE Transactions on Multimedia, 10(6), 1128-1141.
[18] Vukadinovic, V. & Karlsson, G. (2010) Video Streaming Performance under Proportional Fair
Scheduling. IEEE Journal on Selected Areas in Communications, 28(3),399-408.
[19] Ozcelebi, T., Oguz, S.M., Murat, T.A. & Reha, C.M. (2007) Cross-Layer Optimized Rate Adaptation
and Scheduling for Multiple-User Wireless Video Streaming. IEEE Journal on Selected Areas in
Communications, 25(4), 760-769.
[20] Larmo, A., Lindstrom, M., Meyer, M., Pelletier, G., Torsner, J. & Wiemann, H. (2009) LTE Link-
Layer Design. IEEE Communications Magazine, 47(4), 52-59.
[21] Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Whiting, P. & Vijayakumar, R. (2001)
Providing Quality of Service over a Shared Wireless Link. IEEE Communications Magazine, 39(2),
150-154.
[22] Tsybakov, B.S. (2002) File Transmission over Wireless Fast Fading Downlink. IEEE Transactions on
Information Theory, 48(8), 2323-2337.
[23] Ramli, H. A. M. & Sandrasegaran, K. (2013) Robust Scheduling Algorithm for Guaranteed Bit Rate
Services. International Journal of Mobile Communications, 11(1), 71-88.
[24] Pokhariyal, A., Monghal, G., Pedersen, K.i., Mogensen, P.E., Kovacs, I.Z., Rosa, C. & Kolding, T.E.
(2007) Frequency Domain Packet Scheduling Under Fractional Load for the UTRAN LTE Downlink.
in IEEE Vehicular Technology Conference, 699-703.
[25] Rappaport, T.S. (2003) Wireless Communications: Principles and Practice. Prentice Hall.
[26] Gudmundson, M. (1991) Correlation Model for Shadow Fading in Mobile Radio Systems. Electronics
Letters, 2145-2146.
[27] Komninakis, C. (2003) A Fast and Accurate Rayleigh Fading Simulator. in IEEE Globecom, 3306-
3310.
[28] Pedersen, K.I., Monghal, G., Kovacs, I.Z., Kolding, T.E., Pokhariyal, A., Frederiksen, F. &
Mogensen, P. (2007) Frequency Domain Scheduling for OFDMA with Limited and Noisy Channel
Feedback. in Vehicular Technology Conference, 1792-1796.
[29] Ramli, H.A.M. Sandrasegaran, K., Basukala, R., Patachaianand, R. & Afrin, T.S (2011) Video
Streaming Performance under Well-Known Packet Scheduling Algorithms. International Journal of
Wireless & Mobile Networks (IJWMN), 3(1), 25-38.
13. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 6, No. 1, February 2014
13
[30] Ruangchaijatupon, N. & Ji, Y. (2008) Simple Proportional Fairness Scheduling for OFDMA Frame-
Based Wireless Systems. in IEEE Wireless Communications and Networking Conference, 1593-1597.
[31] Mugen, P. & Wenbo, W. (2004) Advanced HARQ and Scheduler Schemes in TDD-CDMA HSDPA
Systems. in Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th
International Symposium on Multi-Dimensional Mobile Communications, 67-70.
[32] Wang, Y. & Yang, H. (2003) Retransmission Priority Scheduling Algorithm for Forward Link Packet
Data Service. in International Conference on Communication Technology Proceedings, 926-930.
[33] Ramli, H.A.M., Basukala, R., Sandrasegaran, K. & Patachaianand, R. (2009) Performance of Well
Known Packet Scheduling Algorithms in the Downlink 3GPP LTE System. in IEEE 9th Malaysia
International Conference on Communications (MICC), 815-820.
Authors
Huda Adibah Mohd Ramli received her PhD in Engineering from University of
Technology, Sydney (Australia) (2012), MSc in Software Engineering from the University
of Technology Malaysia (Malaysia) (2006) and BEng in Electrical and Computer
Engineering from International Islamic University Malaysia (Malaysia) (2003). Her
current research interest generally focuses on radio resource management in the mobile
communication systems specifically on packet scheduling and component carrier selection
Kumbesan Sandrasegaran holds a PhD in Electrical Engineering from McGill University
(Canada) (1994), a Masters of Science Degree in Telecommunication Engineering from
Essex University (UK) (1988) and a Bachelor of Science (Honours) Degree in Electrical
Engineering (First Class) (UZ) (1985). He was a recipient of the Canadian Commonwealth
Fellowship (1990-1994) and British Council Scholarship (1987-1988). He is a Professional
Engineer (Pr.Eng) and has more than 20 years experience working either as a practitioner, researcher,
consultant and educator in telecommunication networks. During this time, he has focused on the planning,
modeling, simulation, optimisation, security, and management of telecommunication networks