基于CATV网MPEG-2 TS复用器包调度算法

研究用于CATV网MPEG-2 TS复用器的包调度算法。提出了调度矩阵的概念，分别描述了传统的恒定速率（CBR）调度算法和本文所提出的可变速率（VBR）调度算法。VBR调度算法采用基于输入流统计特性的实时带宽分配策略，可获得较好的延时性能和较高的信道利用率。     

A timestamp-sensitive scheduling algorithm for MPEG-II multiplexersin CATV networks

To achieve smooth display of MPEG-II programs in the residential cable TV networks, we present a timestamp-sensitive scheduling algorithm for MPEG-II multiplexers. The deadline-driven scheduler maintains, for each program stream, a counter and a timestamp to record and determine how many transport stream (TS) packets should be transmitted before the current scheduling cycle ends. The decoding timestamp (DTS) of TS packets is used to update the counter in order to prevent deadline violation. This algorithm is compared numerically with the timestamp-insensitive algorithm which runs constant-bit-rate (CBR) scheduling. The trace-driven simulation shows that the deadline violation of our timestamp-sensitive scheduling is much lower than CBR's and well controlled for programs with various degrees of burstiness. We also show that the algorithm can be further improved by adding a scheme to prevent buffer underflow and overflow at multiplexers and set-top-boxes, respectively     

基于VBR视频流量预测技术的DVB-H复用器调度算法

DVB-H采用的时间分片技术对现有的复用器算法提出了挑战.本文在VBR视频流量预测技术的基础上提出了基于VBR视频流量预测技术的DVB-H网络复用器调度算法.本算法根据VBR视频码率的预测值,预先分配下一调度周期的带宽,满足了时间分片技术对复用器调度算法的要求.与CBR调度算法相比,本算法具有较小的时延和较高的带宽利用率.     

Buffer losses vs. deadline violations for ABR traffic in an ATM switch: A computational approach

The B‐ISDN will carry a variety of traffic types: the Variable Bit Rate traffic (VBR), of which compressed video is an example, Continuous Bit Rate traffic (CBR), of which telemetry is an example, Data traffic, and Available Bit Rate traffic (ABR) that represents aggregate data traffic with very limited guarantees on quality. Of these, VBR and CBR have timing constraints and need synchronous bandwidth; data traffic is relatively delay insensitive. In this paper, we consider the VBR, Data and ABR traffic types and obtain the cumulative distribution function (cdf) of the queueing delay experienced by a burst of ABR traffic in the output buffer of an ATM switch. The cdf is used to trade off buffer loss probabilities against deadline violation probabilities through adjusting the buffer size and (delay) deadline values. Large buffers result in low losses but queueing delays can become excessive and cause a high level of deadline violations. Both losses and violations are detrimental and an operating point must be chosen to achieve a balance. In this paper we study the nature of the trade off. We develop a stochastic Petri net model assuming periodic burst arrivals for VBR and Poisson arrival processes for the Data and ABR traffic types at the burst level, and solve the model analytically (numerically) using a decomposition approach. This decomposition, along with the inherent decomposability of the tagged customer approach for obtaining the cdf opens up a possibility of carrying out fast computations using a parallel machine for selecting the operating point each time that a call is admitted. This revised version was published online in June 2006 with corrections to the Cover Date.     

Implementation of SDTV Video Encoder with Real-Time Constant and Variable Bit-Rate Control

The digital standard definition television (SDTV) encoder is a very important part of the digital TV broadcast chain. Most real-time MPEG-2 encoders are designed to perform in a constant bit-rate (CBR) mode. But an even better compressed stream can be created by employing a variable bit-rate (VBR) encoding algorithm. VBR can be exploited as a means of achieving statistical multiplexing for digital broadcast satellites. This paper suggests an implementation procedure of an SDTV video encoder and proposes a novel VBR bit-allocation strategy that could be implemented in this encoder system. First, using a rate-quantization model and rate-quantization perceptual model, a real-time VBR bit-allocation strategy is deduced. In this strategy, more (or fewer) bits are allocated to "difficult-to-encode" (or "easy-to-encode") groups of pictures (GOPs), which are distinguished according to the estimated encoding complexity of the GOPs. After allocating an appropriate number of bits to each GOP by using this VBR bit-allocation strategy, we use a CBR rate control algorithm to allocate a number of bits and select a quantization scaler for each picture of a GOP. Then smooth visual quality is achieved not only in a GOP but also in the whole video sequence. Second, the system implementation of an SDTV video encoder including a video input module, a video encoding module, a system control and rate control module (SCRCM), and a PES packetizing module is described. We also discuss in detail how to implement our real-time VBR bit-allocation strategy in the SCRCM. Finally, experimental results demonstrate that our proposed VBR encoder displays a better performance than the CBR encoder.     

Flexible optical fiber CDMA networks using strict opticalorthogonal codes for multimedia broadcasting and distributionapplications

Flexible optical fiber code-division multiple-access (CDMA) networks are proposed to support real-time multimedia communication services of constant bit rate (CBR) and variable bit rate (VBR)/multiple bit rate (MBR). Since strict optical orthogonal codes (OOCs) are employed in incoherent optical fiber CDMA networks, their use can strictly guarantee the correlation constraint λ to be the minimum value (i.e., an unit “1”) for multimedia applications. This is achieved without increasing any system complexity compared with the use of conventional OOCs. Moreover, optimal strict OOCs can have the same length as optimal conventional OOCs or a slightly longer length than the latter. It is shown that the proposed optical fiber CDMA networks have a distinguishing feature of high bit-rate flexibility and fast access tunability. Consequently, this can effectively support both VBR and CBR video communications as well as multimedia broadcasting/distributions in a given network without any violation of the minimum correlation constraint λ=1. The proposed network can be also used as a backbone to interconnect various local-area networks with different data bit rates. However, conventional OOC-based optical CDMA networks do not possess such characteristics because of violation of λ=1 for VBR or MBR communications     

Joint selection of source and channel rate for VBR videotransmission under ATM policing constraints

Variable bit-rate (VBR) transmission of video over ATM networks has long been said to provide substantial benefits, both in terms of network utilization and video quality, when compared with conventional constant bit-rate (CBR) approaches. However, realistic VBR transmission environments will certainly impose constraints on the rate that each source can submit to the network. We formalize the problem of optimizing the quality of the transmitted video by jointly selecting the source rate (number of bits used for a given frame) and the channel rate (number of bits transmitted during a given frame interval). This selection is subject to two sets of constraints, namely, (1) the end-to-end delay has to be constant to allow for real-time video display and (2) the transmission rate has to be consistent with the traffic parameters negotiated by user and network. For a general class of constraints, including such popular ones as the leaky bucket, we introduce an algorithm to find the optimal solution to this problem. This algorithm allows us to compare VBR and CBR under the same end-to-end delay constraints. Our results indicate that variable-rate transmission can increase the quality of the decoded sequences without increases in the end-to-end delay. Finally, we show that for the leaky-bucket channel, the channel constraints can be combined with the buffer constraints, such that the system is identical to CBR transmission with an additional, infrequently imposed constraint. Therefore, video quality with a leaky-bucket channel can achieve the same quality of a CBR channel with larger physical buffers, without adding to the physical delay in the system     

Provisioning of Parameterized Quality of Service in 802.11e Based Wireless Mesh Networks

There has been a growing interest in the use of wireless mesh networks. Today’s wireless technology enables very high data rate up to hundreds of Megabits per second, which creates the high demand of supporting real-time multimedia applications over wireless mesh networks. Hence it is imperative to support quality of service (QoS) in wireless mesh networks. In this paper, we design a framework to provide parameterized QoS in 802.11e based wireless mesh networks. Our framework consists of admission control algorithms and scheduling algorithms, which aim at supporting constant bit-rate (CBR) traffic flows, as well as variable bit-rate (VBR) traffic flows. We first present deterministic end-to-end delay bounds for CBR traffic. We then prove that the delay of VBR traffic can be bounded if the traffic flow conforms to a leaky-bucket regulator. We further study different admission control algorithms for VBR traffic. Our simulation results show that, by taking advantage of statistical multiplexing, much more traffic flows can be admitted.     

A Multi-objective Optimal Task Scheduling in Cloud Environment Using Cuckoo Particle Swarm Optimization

In cloud computing, varied demands are placed on the constantly changing resources. The task scheduling place very vital role in cloud computing environments, this scheduling process needs to schedule the tasks to virtual machine while reducing the makespan and cost. The task scheduling problem comes under NP hard category. Efficient scheduling method makes cloud computing services better and faster. In general, optimization algorithms are used to solve the scheduling issues in cloud. So, in this paper we combined two optimization algorithms namely called as Cuckoo Search (CS) and Particle Swarm Optimization (PSO).The new proposed hybrid algorithm is called as, CS and particle swarm optimization (CPSO). Our main purpose of the proposed paper is to reduce the makespan, cost and deadline violation rate. The performance of the proposed CPSO algorithm is evaluated using cloudsim toolkit. From the simulation results our proposed works minimize the makespan, cost, deadline violation rate, when compared to PBACO, ACO, MIN–MIN, and FCFS.

     

A statistical framework for EDF scheduling

Earliest deadline first (EDF) has become one of the most promising scheduling schemes for providing quality-of-service differentiation over high speed networks. In this letter, we study the deadline violation (loss) probability at an EDF scheduling switch. An analytical framework has been developed for estimating the loss probabilities for the aggregated traffic and the individual flows. This enables us to determine whether a given flow can meet its deadline with the required loss probability. As illustrated from the simulation results using real network traffic, the asymptotic approximations presented are accurate enough to predict the real metrics.     

Resource allocation using adaptive linear prediction in WDM/TDM EPONs

This letter discusses dynamic-wavelength and bandwidth-allocation (DWBA) algorithm for differentiated services in hybrid WDM/TDM EPONs (Ethernet passive optical networks). We integrate the traffic estimation for variable-bit-rate (VBR) video traffic with the resource allocation to satisfy the increasing demand of video streaming services. A new DWBA algorithm using an adaptive linear prediction model is proposed to estimate the bandwidth required by VBR video traffic arriving during the next waiting period, so that the DWBA algorithm can assign wavelength and bandwidth more effectively. Simulation results show that the proposed DWBA-ALP algorithm can significantly improve the delay jitter performance for both CBR and VBR services.     

QoS Performance Bounds and Efficient Connection Admission Control for Heterogeneous Services in Wireless Cellular Networks

Quality-of-Service (QoS) performance and connection admission control (CAC) for heterogeneous services in wireless multiple access networks are investigated. The heterogeneous services include constant bit rate (CBR), variable bit rate (VBR) and available bit rate (ABR) services. Multiple access control is handled by a polling-based scheme with non-preemptive priority. Tight delay variation (jitter) bounds for CBR connections and delay bounds for VBR connections are derived. A CAC scheme based on the derived bounds is developed. The CAC makes use of user mobility information to reserve an appropriate amount of system resources for potential handoff connections to achieve low handoff connection dropping rate (HCDR). Simulation results show that the proposed CAC scheme can achieve both low HCDR and high resource utilization.     

A multiple access scheme for multimedia traffic in wireless ATM

This paper proposes a multiple access scheme for the forthcoming wireless ATM (Asynchronous Transfer Mode) system. Such ATM compatible wireless systems are motivated by the rapidly increasing demand for wireless extensions to broadband networks, which are expected to support mixed broadband services including Constant Bit Rate (CBR), Variable Bit Rate (VBR), and Available Bit Rate (ABR) traffic. Since these different traffics have very different performance requirements, the multiple access scheme design is very challenging. In this paper, we propose a multiple access scheme called Dynamic Time Division Multiple Access with Piggybacked Reservation (DTDMA/PR), attempting to achieve higher statistical multiplexing efficiency in the mixed VBR/CBR/ABR traffic scenario. The basic idea is to exploit two levels of reservation. The first level deals with the isochronous nature of CBR and VBR traffic and the bursty nature of ABR traffic by using the ALOHA reservation procedure. The second level exploits the piggybacked reservation approach to cope with the dynamic feature of VBR traffic in order to increase the multiplexing efficiency. An analytical model is also developed in this paper and verified by simulation. Numerical examples are given to gain some insight into the protocol itself.     

Optimal bit allocation for coding of video signals over ATMnetworks

We consider optimal encoding of video sequences for ATM networks. Two cases are investigated. In one, the video units are coded independently (e.g., motion JPEG), while in the other, the coding quality of a later picture may depend on that of an earlier picture (e.g., H.26x and MPEGx). The aggregate distortion-rate relationship for the latter case exhibits a tree structure, and its solution commands a higher degree of complexity than the former. For independent coding, we develop an algorithm which employs multiple Lagrange multipliers to find the constrained bit allocation. This algorithm is optimal up to a convex-hull approximation of the distortion-rate relations in the case of CBR (constant bit-rate) transmission. It is suboptimal in the case of VBR (variable bit-rate) transmission by the use of a suboptimal transmission rate control mechanism for simplicity. For dependent coding, the Lagrange-multiplier approach becomes rather unwieldy, and a constrained tree search method is used. The solution is optimal for both CBR and VBR transmission if the full constrained tree is searched. Simulation results are presented which confirm the superiority in coding quality of the encoding algorithms. We also compare the coded video quality and other characteristics of VBR and CBR transmission     

Application of network calculus to guaranteed service networks

We use previous network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of results that apply min-plus algebra to packet networks. We provide a simple proof that shaping a traffic stream to conform to a burstiness constraint preserves the original constraints satisfied by the traffic stream. We show how all rate-based packet schedulers can be modeled with a simple rate latency service curve. Then we define a general form of deterministic effective bandwidth and equivalent capacity. We find that call acceptance regions based on deterministic criteria (loss or delay) are convex, in contrast to statistical cases where it is the complement of the region which is convex. We thus find that, in general, the limit of the call acceptance region based on statistical multiplexing when the loss probability target tends to 0 may be strictly larger than the call acceptance region based on lossless multiplexing. Finally, we consider the problem of determining the optimal parameters of a variable bit rate (VBR) connection when it is used as a trunk, or tunnel, given that the input traffic is known. We find that there is an optimal peak rate for the VBR trunk, essentially insensitive to the optimization criteria. For a linear cost function, we find an explicit algorithm for the optimal remaining parameters of the VBR trunk     

Providing deterministic packet delays and packet losses in multimedia wireless networks

‘Anytime, anywhere’ communication, information access and processing are much cherished in modern societies because of their ability to bring flexibility, freedom and increased efficiency to individuals and organizations. Wireless communications, by providing ubiquitous and tetherless network connectivity to mobile users, are therefore bound to play a major role in the advancement of our society. Although initial proposals and implementations of wireless communications are generally focused on near‐term voice and electronic messaging applications, it is recognized that future wireless communications will have to evolve towards supporting a wider range of applications, including voice, video, data, images and connections to wired networks. This implies that future wireless networks must provide quality‐of‐service (QoS) guarantees to various multimedia applications in a wireless environment. Typical traffic in multimedia applications can be classified as either Constant‐Bit‐Rate (CBR) traffic or Variable‐Bit‐Rate (VBR) traffic. In particular, scheduling the transmission of VBR multimedia traffic streams in a wireless environment is very challenging and is still an open problem. In general, there are two ways to guarantee the QoS of VBR multimedia streams, either deterministically or statistically. In particular, most connection admission control (CAC) algorithms and medium access control (MAC) protocols that have been proposed for multimedia wireless networks only provide statistical, or soft, QoS guarantees. In this paper, we consider deterministic QoS guarantees in multimedia wireless networks. We propose a method for constructing a packet‐dropping mechanism that is based on a mathematical framework that determines how many packets can be dropped while the required QoS can still be preserved. This is achieved by employing: (1) An accurate traffic characterization of the VBR multimedia traffic streams; (2) A traffic regulator that can provide bounded packet loss and (3) A traffic scheduler that can provide bounded packet delay. The combination of traffic characterization, regulation and scheduling can provide bounded loss and delay deterministically. This is a distinction from traditional deterministic QoS schemes in which a 0% packet loss are always assumed with deterministically bounding the delay. We performed a set of performance evaluation experiments. The results will demonstrate that our proposed QoS guarantee schemes can significantly support more connections than a system, which does not allow any loss, at the same required QoS. Moreover, from our evaluation experiments, we found that the proposed algorithms are able to out‐perform scheduling algorithms adopted in state‐of‐the‐art wireless MAC protocols, for example Mobile Access Scheme Based on Contention and Reservation for ATM (MASCARA) when the worst‐case traffic is being considered. Copyright © 2002 John Wiley & Sons, Ltd.     

Design and evaluation of an efficient traffic control scheme for integrated voice,video, and data over asynchronous transfer mode networks: Explicit allowed rate algorithm

Asychronous transfer mode (ATM) networks are high‐speed networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of physical bandwidth. Unlike constant bit‐rate (CBR) traffic, the bandwidth reserved by variable bit‐rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit‐rate (ABR) traffic. As the bandwidth used by VBR traffic changes, available bandwidth for ABR traffic varies; i.e., available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate‐based congestion control algorithm, Explicit Allowed Rate Algorithm (EARA), is presented in this paper. EARA is compared with Proportional Rate Control Algorithm (PRCA) and Explicit Rate Indication Congestion Avoidance Algorithm (ERICA), in both LAN and WAN environments. Simulations of all three algorithms are conducted under both congestion and fairness configurations with simultaneous generation of CBR, rt‐VBR, nrt‐VBR and ABR traffic. The results show that, with very small over‐head on the switch, EARA significantly decreases the required buffer space and improves the network throughput. Copyright © 1999 John Wiley & Sons, Ltd.     

突发业务下的移动自组织网DSR协议仿真性能分析

移动自组织网络是一组由移动节点组成的无线网络。它的性能已经被广泛的进行了研究,但是这些研究主要是针对节点的移动性和网络的规模来展开的。近年来,移动自组织网在传输视频、音频、数据、图像等多媒体上的应用越来越多,因此自组织网在传输不同业务模型时的性能分析也引起了人们的广泛关注。本文中,我们主要研究分析了移动自组织网DSR协议在传输VBR业务时的性能,并且将仿真结果和传输CBR业务时的结果进行了比较。通过进一步的分析,我们得出与传输VBR业务相比,在传输CBR业务时,移动自组织网DSR协议性能明显提高。     

Scheduling of real-time messages in optical broadcast-and-selectnetworks

We consider broadcast-and-select networks based on optical passive stars. In these single-hop networks, communicating pairs can exchange messages directly, without the need to store information at intermediate nodes for later forwarding. Messages are transmitted in a packetized way, and each message has an associated deadline. In order to guarantee the message reception timeliness, we ask that all the messages are received within their corresponding deadline. We show that this scheduling problem is strong NP-complete, even in a very restricted case. Then, we turn our attention to fast approximating heuristics. We present four of them, assess their average performance by means of computer simulation, and give their worst-case performance bounds. Such bounds can be effectively used to test the success of the schedule before generating it     

Traffic shaping, bandwidth allocation, and quality assessment forMPEG video distribution over broadband networks

This article provides an overview of residential video delivery systems and presents the applications, benefits, and challenges of using VBR MPEG video encoding in broadband video distribution networks. The network resources required to transmit stored variable-rate MPEG can be reduced by properly analyzing and smoothing the video stream before transmission. A scheduling technique is presented which selects a traffic contract for a pre-encoded MPEG video stream with the criteria of minimizing network resources and maintaining video quality. Several effective bandwidth metrics are discussed and used to model the potential savings in network resources for the shaped streams