Traffic shaping for MPEG video transmission over the next generation internet

The Internet Engineering Task Force (IETF) has defined the integrated services model for supporting real-time services. Guaranteed service is one of these services with firm delay and bandwidth guarantees. Before setting up a guaranteed service flow, traffic parameters of the source have to be specified in terms of token bucket traffic descriptors. The source must conform to these descriptors by shaping its traffic. In this paper, we study the effects of a token bucket traffic shaper at the source on the transmission characteristics of Motion Picture Experts Group (MPEG) video streams over the guaranteed service. For different types of MPEG video sequences, the effects of the shaper parameters on the transmission performance are studied. We develop an analytical model of the traffic shaper, and also carry out numerical simulation of the transmission performance to verify the analytical model. Our study also provides a technique to analyze stored MPEG video sequences to determine the token bucket traffic descriptors that have to be specified during flow set up.

In this paper, we describe MPEGTool, an X window-based tool that can be used to generate a motion picture expert group (MPEG) encoded bit stream for video sequences and to study the statistical properties of the encoded data. The tool was designed to study the characteristics of variable bit rate video sources for transmission over asynchronous transfer mode (ATM) based broadband integrated services digital network (B-ISDN). The tool, which has a window-based graphic user interface, allows a user to specify several of the MPEG parameters such as the intraframe-to-interframe ratio and the quantizer scale. The tool also includes a statistical package that allows the user to plot graphs of various statistics including bit distributions, ATM cell distributions, time se ries, autocorrelation functions and cell interarrival times.

IEEE 802.11e Medium Access Control (MAC) is a supplement to the IEEE 802.11 Wireless Network (WLAN) standard to support Quality of Service (QoS). The 802.11e MAC defines a new coordination function, namely Hybrid Coordination Function (HCF), which takes the QoS requirements of flows into account and allocates Transmission Opportunity (TXOP) to stations. On the basis of mean sending rate, delay of Variable Bit Rate (VBR) traffic cannot be bounded with the reference HCF scheduling algorithm proposed in this supplement. In this paper, we propose a new Connection Admission Control (CAC) and a scheduling algorithm that utilize the token bucket and a modified Latency-Rate (LR) scheduling algorithm to guarantee a bounded delay for HCF Controlled Channel Access (HCCA). The new Service Interval (SI) is calculated to optimize the number of stations accommodated and takes into account delay bound and token bucket parameters. We show that it is possible to obtain worst-case performance guarantees on delay. First, we analyze the behavior of the new scheduler with a loss free wireless channel model and after this, with a burst loss model and we explain how it is possible to extend this scheduler for a multi-rate scheme. Properties of the proposal are investigated both theoretically and using ns-2 simulations. We present a set of simulations with both Constant Bit Rate (CBR) and VBR flows and performance comparisons with HCF scheduling algorithm. The results show that the delay upper bound can be achieved for a large range of networks load with bandwidth optimization.

Wireless sensor networks (WSNs) have gained much attention in today’s research domain for supporting a wide variety of applications including the multimedia applications. Multimedia applications that are regarded as the quality-of-service (QoS)-aware, delay sensitive, and bandwidth hungry applications require enough energy and communication resources. WSNs being the energy-scarce network have now been designed in such a way that they can support these delay-sensitive and time-critical applications. In this paper, we propose an energy-efficient routing protocol for heterogeneous WSNs to support the delay sensitive, bandwidth hungry, time-critical, and QoS-aware applications. The proposed QoS-aware and heterogeneously clustered routing (QHCR) protocol not only conserves the energy in the network, but also provides the dedicated paths for the real-time and delay sensitive applications. The inclusion of different energy-levels for the heterogeneous WSNs also provides the stability in the networks while minimizing the delay for the delay-sensitive applications. Extensive simulations have been performed to validate the effectiveness of our proposed scheme. Our proposed routing scheme outperforms other state-of-the-art schemes in terms of the delay performances.

Flexible three-band motion-compensated temporal filtering for scalable video coding

Available bit rate (ABR) service may be used by applications which expect cell loss guarantees, but can control their data dynamically as demanded by the network. The introduction of variable bit rate (VBR) background traffic makes ABR capacity variable. A video aggregation system can adapt the traffic from several Moving Picture Expert Group (MPEG) sources as a bundle to the ABR on the network, obtaining an homogeneous image quality among all the video sequences, discarding the less-relevant information of each source according to image quality.

The modern communication system has made the world a “Global Village” in true sense. However, as the number of users of this communication system is increasing, the challenges are mounting as well. The users send different types of traffic to the network, however it is necessary that the traffic must conform to the specified network parameters otherwise it will be troublesome. In case the sent traffic violates the agreement between the network and the user, then there is a need to regulate it. Traffic shaping plays an important part in the provision of Quality of Service (QoS) guarantee. Token Bucket Shaper, based on Token Bucket Algorithm is used to shape the bursty and random data in order to provide the QoS guarantee. This paper presents the performance analysis of a Token Bucket Shaper for real world data such as MPEG4 video and Real Audio signal. The effect of varying various Token Bucket Shaper parameters on its performance is also discussed.

We study the buffer requirements for N identical token bucket streams that are fed to a multiplexor. If the token bucket streams are synchronized the buffer size requirement at the multiplexor is N/spl middot/B, where B is the size of the token bucket. We introduce a new variant of token bucket schemes that we call randomized token bucket schemes that insert random delays to prevent the streams from becoming (and remaining) synchronized. We show, using a combination of analysis and simulation that the buffer size is reduced to at most 3/spl radic/NB with fixed small (10/sup -6/) probability of buffer overflow. Because of the randomization, this result does not depend on assumptions about input traffic patterns. While our analysis has been focused on a simple multiplexor, our research is motivated by the possible use of randomized leaky bucket as a traffic shaping mechanism to reduce buffer size and end-to-end delays across multiple hops in a network.

The trend of consolidating network functions from specialized hardware to software running on virtualization servers brings significant advantages for reducing costs and simplifying service deployment. However, virtualization techniques have significant limitations when it comes to networking as there is no support for guaranteeing that network functions meet their service requirements. In this paper, we present a design for providing service guarantees to virtualized network functions based on rate control. The design is a combination of rate regulation through token bucket filters and the regular scheduling mechanisms in operating systems. It has the attractive property that traffic profiles are maintained throughout a series of network functions, which makes it well suited for service function chaining. We discuss implementation alternatives for the design and demonstrate how it can be implemented on two virtualization platforms: LXC containers and the KVM hypervisor. To evaluate the design, we conduct experiments where we measure throughput and latency using IP forwarders (routers) as examples of virtual network functions. Two significant factors for performance are investigated: the design of token buckets and the packet clustering effect that comes from scheduling. Finally, we demonstrate how performance guarantees are achieved for rate-controlled virtual routers under different scenarios.

Video cameras are widely deployed along city streets, interstate highways, traffic lights, stop signs and toll booths by entities that perform traffic monitoring and law enforcement. The videos captured by these cameras are typically compressed and stored in large databases. Performing a rapid search for a specific vehicle within a large database of compressed videos is often required and can be a time-critical life or death situation. In this paper, we propose video compression and decompression algorithms that enable fast and efficient vehicle or, more generally, event searches in large video databases. The proposed algorithm selects reference frames (i.e., I-frames) based on a vehicle having been detected at a specified position within the scene being monitored while compressing a video sequence. A search for a specific vehicle in the compressed video stream is performed across the reference frames only, which does not require decompression of the full video sequence as in traditional search algorithms. Our experimental results on videos captured in a local road show that the proposed algorithm significantly reduces the search space (thus reducing time and computational resources) in vehicle search tasks within compressed video streams, particularly those captured in light traffic volume conditions.

A scalable architecture for end-to-end QoS provisioning

Tspec enforcement for MPEG video transmission over the next generation Internet: an analytical framework

This paper contributes in detecting temporal tampering in the Moving Picture Experts Group-4 (MPEG-4) digital video using passive blind forensic scheme. In temporal tampering attack, one or more frames are copied from video and pasted at some other location in the same video to hide or highlight particular activity. Sometimes the original frames are modified and then pasted at some other location. This tampering activity is carried out so smartly that it is difficult to identify with naked eyes. The proposed forensic scheme uses two-step algorithm to detect the tampering. First, the suspicious frame is detected and then this frame is compared with others frames in the sequence to find the duplicate frame. Comparison of the frames is carried out with the help of Scale Invariant Feature Transform (SIFT) key-points. Random Sample Consensus (RANSAC) is used to take the final decision on the matching of the frames. The simulation results show that the proposed scheme is able to detect and locate the tampered frame with 100% accuracy regardless of how many number of frames of the video sequence are duplicated.

Nowday, UAV is new technologie among the next generation monitoring system which has the following properties: efficient, real time, secure and reliable. UAV occupied a great importance in many fileds especially national defense in order to protect the human. In fact, the size of transferred data is a basic demand for realtime video communication, partically for military service since the bandwidth limitation in UAV networks.Exprimental results show that the H264 standard outperforms MPEG 4 (Motion Picture Expert Group) encoder in termes of PSNR (Peak signal to noise ratio). The H264’PSNR gain is 6.88% better than MPEG 4. In addition, the H264 standard did not exceed 20 Mbit\s for wireless video transmission.

Networks-on-chip (NoC) for general-purpose multiprocessors require quality of service mechanisms to allow realtime streaming applications to be executed along with latency-sensitive general purpose processing tasks. In this paper, we propose a NoC link arbitration technique that supports bandwidth guarantees along with best effort latency optimizations. In contrast to many existing quality of service mechanisms, our technique prioritizes best effort over guaranteed bandwidth traffic for optimal latency. Distributed traffic shaping is used to offer bandwidth guarantees over previously reserved connections, which are established dynamically using control messages. Initial simulation results show that our arbitration scheme can provide tight bandwidth guarantees for streaming traffic under network overload conditions. At the same time, the average latency of best effort traffic is improved compared to a simple prioritization of streaming traffic.