Analysis of bandwidth allocation strategies with accessrestrictions in broadband ISDN

Bandwidth allocation strategies with access restrictions for the integration of wideband (WB) and narrowband (NB) traffic in a broadband integrated services digital network (BISDN) are studied. Access restrictions are placed on both types of traffic to meet the grade of service required for each. The WB traffic is assumed nonqueuable, whereas the NB traffic may be queued. As an improved strategy, an access strategy which allows each type of traffic to use its bandwidth in the access-restricted region with the risk of being preempted by an arriving call for which the overflowed region is reserved is considered. Under this strategy, the preempted NB calls are queued at the head of a waiting room, and preempted WB calls are queued in another finite waiting room. The performance of these strategies is analyzed in terms of access delay for NB traffic and blocking probability for WB traffic by the matrix-geometric solution method. It is shown numerically that these strategies can easily be adapted to varying traffic loads by changing the restriction levels     

Bandwidth allocation strategy with state-dependent Bernoulli access and pre-emptive priority

A study is presented of a bandwidth allocation strategy with state-dependent Bernoulli access and pre-emptive priority to serve wideband and narrowband traffic in an integrated services digital network. By varying the Bernoulli access probability, this proposed allocation strategy shows better performance than other strategies.<>     

Analysis of Traffic Access Control Strategies in Integrated Service Networks

A common digital transmission facility provides service to a community of heterogeneous users generating traffic with differing intensity, message length, and bit rate. In order for this type of integrated communication system to handle its traffic demands with high efficiency and flexibility, close control of access and switching at the input node is required. We propose, analyze, and compare two different strategies for managing the access of two types of traffic, a blockable wide-band (WB) type of traffic and a queueable narrow-band (NB) type of traffic, sharing the transmission resource dynamically. The first strategy assigns preemptive priority to the WB traffic over the NB traffic, whereas the second strategy employs a wide-band to narrow-band bit rate compression mechanism. Exact analytic models are developed, and solution methods are presented and implemented. It is shown that the best combined performance is obtained when the two strategies are adaptively combined according to the offered load.     

Radio Resource Allocation for Scalable Video Services Over Wireless Cellular Networks

Good quality video services always require higher bandwidth. Hence, to provide the video services e.g., multicast/broadcast services (MBSs) and unicast services along with the existing voice, internet, and other background traffic services over the wireless cellular networks, it is required to efficiently manage the wireless resources in order to reduce the overall forced call termination probability, to maximize the overall service quality, and to maximize the revenue. Fixed bandwidth allocation for the MBS sessions either reduces the quality of the MBS videos and bandwidth utilization or increases the overall forced call termination probability and of course the handover call dropping probability as well. Scalable video coding (SVC) technique allows the variable bit rate allocation for the video services. In this paper, we propose a bandwidth allocation scheme that efficiently allocates bandwidth among the MBS sessions and the non-MBS traffic calls (e.g., voice, unicast, internet, and other background traffic). The proposed scheme reduces the bandwidth allocation for the MBS sessions during the congested traffic condition only to accommodate more calls in the system. Instead of allocating fixed bandwidths for the MBS sessions and the non-MBS traffic, our scheme allocates variable bandwidths for them. However, the minimum quality of the videos is guaranteed by allocating minimum bandwidth for them. Using the mathematical and numerical analyses, we show that the proposed scheme maximizes the bandwidth utilization and significantly reduces the overall forced call termination probability as well as the handover call dropping probability.     

Class Dependent Traffic Allocation in a LEO Satellite Network

Traffic allocation strategy becomes a significant factor in optimization of bandwidth usage of telecommunication resources, especially with increasing use of broadband applications. Allocation strategy in dynamic LEO (Low Earth Orbital) satellite communication network is studied, to improve their Quality of Service (QoS). Traffic allocation control is performed to provide a near optimal utilization of their Inter Satellite Links (ISLs). A combination of two algorithms is used to allocate traffic in ISLs. Empirical analysis is performed to examine performance of the proposed algorithm, GALPEDA. Result shows that the proposed algorithm is useful for traffic allocation of multiclass traffic in LEO satellite communication.     

Bandwidth extension of speech signals: a catalyst for the introduction of wideband speech coding?

The restricted audio quality of today's telephone networks is mainly due to the narrowband (NB) limitation to the frequency range from about 300 Hz to 3.4 kHz. Meanwhile, codecs for wideband (WB) telephony (50 Hz to 7 kHz) exist with significantly improved speech intelligibility and naturalness. However, the broad introduction of wideband speech coding requires strong efforts of both network operators and their customers because many elements of the networks (i.e., terminals and network nodes) have to be modified. An intermediate step to overcome the narrowband limitation can be achieved by applying artificial bandwidth extension (BWE) in the receiver. In this article we review the basic principles of bandwidth extension, and discuss several application scenarios in which both wideband coding and BWE complement each other. The introduction of BWE methods in terminals and networks may help to speed up the introduction of true wideband speech coding in the near future.     

MPEG4视频流量预测自适应算法的研究

为了保证用户的服务质量(QOS),宽带分组网在传送视频信息时需要进行动态带宽分配,而视频流量预测在动态带宽分配中发挥着重要的作用。本文从自相关性、自相似性的Hurst参数两个方面,阐明GOP时间尺度上的流量能够体现原始帧序列的流量特性,并在固定步长的LMS自适应算法(FSSA)的基础上提出的一种新的可变步长自适应算法(VSSA),在GOP的大时间尺度上预测MPEG4视频流量,通过大量的仿真实验表明,VSSA算法可以明显地改善预测性能。     

Design of a fair bandwidth allocation policy for VBR traffic in ATMnetworks

Since real-time variable bit rate (VBR) traffic is inherently bursty, dynamic bandwidth allocation is necessary for ATM streams that carry VBR traffic. In order to provide quality-of-services (QoS) guarantees and to reduce the computational complexity, an hybrid of guaranteed and dynamic adaptive allocation scheme requires to be implemented. Typical dynamic allocations to competing streams are done in the form of linear proportions to the bandwidth requirements. We show that during temporary link congestion such proportional arrangements can give rise to unequal queue growth and, subsequently, degraded QoS. This is found to be true even for streams that belong to the same VBR class and share identical long term traffic characteristics and QoS requirements. In this paper, four allocation algorithms are presented and analyzed in terms of their fairness and QoS potential for real-time VBR traffic. We propose and show that a novel allocation strategy, termed Minmax, solves the mentioned problem of unfairness within a class. By maintaining a fair distribution of buffer length across the streams of a class, the proposed policy can achieve better and fairer QoS performance compared to the traditional methods. We present analytical results, proofs and a simulation study of the described algorithms. Four allocation policies for handling MPEG VBR video streams are simulated in the context of a wireless ATM (WATM) medium access control. The results show that in certain scenarios, the Minmax strategy can reduce losses by an order of magnitude, while decreasing delays substantially     

Design and analysis of a bandwidth management framework forATM-based broadband ISDN

When designing and configuring an ATM-based B-ISDN, it remains difficult to guarantee the quality of service (QoS) for different service classes, while still allowing enough statistical sharing of bandwidth so that the network is efficiently utilized. These two goals are often conflicting. Guaranteeing QoS requires traffic isolation, as well as allocation of enough network resources (e.g., buffer space and bandwidth) to each call. However, statistical bandwidth sharing means the network resources should be occupied on demand, leading to less traffic isolation and minimal resource allocation. The authors address this problem by proposing and evaluating a network-wide bandwidth management framework in which an appropriate compromise between the two conflicting goals is achieved. Specifically, the bandwidth management framework consists of a network model and a network-wide bandwidth allocation and sharing strategy. Implementation issues related to the framework are discussed. For real-time applications the authors obtain maximum queuing delay and queue length, which are important in buffer design and VP (virtual path) routing     

A Novel Bandwidth Allocation Algorithm for IEEE 802.16 TDD Mode Wireless Access Networks

In this paper, we propose a novel bandwidth allocation algorithm for a two-tier hierarchy in IEEE 802.16 time division duplex mode wireless access networks under symmetric and/or asymmetric uplink and downlink traffic input. We demonstrate the performance of the new bandwidth allocation algorithm in terms of accumulated throughput (cumulative bandwidth) and fairness in both infinite and finite buffer cases compared with others by simulations. The simulation results show that the proposed algorithm not only can provide much better fairness and maintain satisfactory QoS support and high cumulative bandwidth but also in the case of finite buffer depth is less buffer-consuming than the others, meaning that the hardware cost can be reduced by employing the proposed algorithm.     

Dynamic bandwidth allocation for quality-of-service over Ethernet PONs

Ethernet-based passive optical network (EPON) technology is being considered as a promising solution for next-generation broadband access networks due to the convergence of low-cost Ethernet equipment and low-cost fiber infrastructures. A major feature for this new architecture is the use of a shared transmission media between all users; hence, medium access control arbitration mechanisms are essential for the successful implementation of EPON: i.e., to ensure a contention-free transmission and provide end users with equal access to the shared media. We propose to use the multipoint control protocol defined by the IEEE 802.3ah task force to arbitrate the transmission of different users, and we present different dynamic bandwidth allocation (DBA) algorithms to allocate bandwidths effectively and fairly between end users. These DBA algorithms are also augmented to support differentiated services, a crucial requirement for a converged broadband access network with heterogeneous traffic. We show that queueing delays under strict bandwidth allocation algorithms result in an unexpected behavior for certain traffic classes, and we suggest the use of DBA with appropriate local queue management to alleviate this inappropriate behavior. We conduct detailed simulation experiments to study the performance and validate the effectiveness of the proposed protocols.     

一种基于无线多媒体业务的可升降级QoS动态带宽分配与优化策略

无线多媒体网络中的业务包括话音、流媒体、交互类和背景类业务4种,除话音业务外其余3种业务都是可变比特速率业务。对该网络用户资源分配(主要是带宽的分配)若采用传统的固定分配方法,必定陷入资源利用率低下和用户QoS得不到保障的两难境地。该文提出了一种基于无线多媒体业务的动态带宽分配与优化策略,在保证用户QoS的前提下,尽可能提高资源利用率。该文分别从网络和用户两个角度考虑,通过系统容量、业务阻塞率、数据延迟、流媒体的实际传输比和VBR业务综合服务等级等参数,对可升降级QoS无线多媒体网络进行了仿真分析,结果表明,对比传统的网络资源管理策略,该策略大大改善了系统的性能,提高了系统资源利用率。     

Impact of an Additional All-Optical Decision Element in Band-Limited Receivers for RZ Systems

We investigate both theoretically and experimentally how the use of an all-optical decision element (ODE) in front of a conventional receiver improves, in return-to-zero (RZ) systems, the receiver performance when the signal bandwidth exceeds the bandwidth of the available optoelectronic components. A theoretical analysis of the ODE behavior shows the field of applicability of the investigated solution. The experimental evaluation of the performance improvement in an RZ system is realized using an ODE based on two cascaded nonlinear optical loop mirrors. Benefits in terms of bit error rate for different signal bandwidths and for a different received optical signal-to-noise ratio are presented. Substantial agreement of the experimental results with the theoretical analysis is obtained. The impact of the ODE in the presence of relevant thermal noise at the receiver is also considered. The ODE can extend the use of common band-limited receivers to wide-bandwidth signals and can be an alternative solution to the development of wideband receivers.     

An Advanced Traffic Engineering Approach Based on the Approximate Invariance of Effective Bandwidths

We present a novel shaping algorithm, called effective bandwidth shaper (EBS), which limits passing data streams' effective bandwidths to a pre-defined upper bound. The shaping algorithm is part of the proposed traffic engineering approach for providing quality of service guarantees to the network users. The traffic engineering approach relies on the property, that effective bandwidths do not change when passing a network node, the so called “invariance property” of effective bandwidths. The algorithm's functionality is verified by application to MPEG video traces. Furthermore, the shaping performance is investigated in different network scenarios with reactive TCP traffic. Our performance studies focus on the dependencies of delays and throughputs upon the number of competing connections, the choice of the space parameter, different TCP protocol variants, and buffer sizes. Moreover we show that the effective bandwidths' invariance when passing a switch, as proven for the case of the many limiting regime (infinitely many sources), holds already for a surprisingly small number of competing flows even in the presence of aggressive TCP traffic.     

Characterization of delay-sensitive traffic

Resource allocation is necessary for a network which guarantees quality of service (QoS). In this paper we first present a definition for a traffic stream to be burstier than another traffic stream. The definition is based on the loss probability of a bufferless multiplexer and thus is appropriate for delay-sensitive traffic which cannot tolerate queueing delay caused by buffering. An optimum quantization algorithm is then derived for source characterization. The optimally quantized version achieves minimum loss rate for all possible allocated bandwidths under the condition that it is burstier than the real traffic. The quantized source is called a pseudosource and can be used by the network for resource allocation. Some numerical examples are studied. Results show that, for a bufferless multiplexer, the allocated bandwidth based on optimally quantized pseudosources is only slightly greater than the minimum bandwidth required to meet the requested QoS     

Effective bandwidths for multiclass Markov fluids and other ATMsources

The authors show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely, it is shown that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a linear constraint on the number of sources. That is, for a small loss probability one can assume that each source transmits at a fixed rate called its effective bandwidth. When traffic parameters are known, effective bandwidths can be calculated and may be used to obtain a circuit-switched style call acceptance and routing algorithm for ATM networks. The important feature of the effective bandwidth of a source is that it is a characteristic of that source and the acceptable loss probability only. Thus, the effective bandwidth of a source does not depend on the number of sources sharing the buffer or the model parameters of other types of sources sharing the buffer     

Worst-case performance of a buffer with independent shaped arrivalprocesses

In both asynchronous transfer mode (ATM) standards and evolving Internet guidelines, deterministic shaping has two principle objectives: (1) to facilitate the allocation of a suitable amount of resources (buffer memory, bandwidth) to a connection to achieve its required quality of service and (2) to easily police traffic and assure “fair” access to a shared resource. We take an ATM context and use fluid modeling, which is appropriate because ATM uses small fixed-length (53-byte) packets called cells. A buffer in a network access node with independent and identically distributed shaped arrival processes is considered. A worst-case performance bound is derived that relies only on the traffic shaping parameters     

Fixed and dynamic bandwidth allocation strategies for wireless mobile integrated services networks

Performance evaluation of two bandwidth allocation strategies in wireless mobile integrated services networks is carried out. Performances of the proposed strategies are compared with those of the traditional guard channels and threshold strategies. In the study, a single wireless cell which is accessed by voice and non-voice traffic types producing, respectively narrowband and wideband calls is considered. In the proposed strategies a number of channels are reserved in a fixed or dynamic fashion for the use of originating wideband calls in addition to the guard channels allocated for the handoff calls. The results indicate that the two strategies have comparable advantages and by manipulating the number of reserved channels, desired performance levels can be achieved. The dynamic reservation based strategy makes the system fairer for the originating wideband calls while maintaining low handoff dropping probability and acceptable channel utilization levels. On the other hand, the fixed reservation strategy provides a lower handoff call dropping at comparable channel utilization levels. The tradeoff is between improving the handoff call dropping versus the originating wideband call blocking. Both strategies provide better performance for the originating wideband calls compared with that provided by the traditional guard channels strategy.

A heuristic approach of bandwidth management for video sources in ATM networks

One of the most important properties in the ATM network is that the resource of the network, including buffer and bandwidth, can be flexibly managed according to different demands of various applications. The network bandwidth can be effectively allocated and utilized if the data volume of the arrival traffic can be predicted precisely. In this paper, we study the bandwidth management schemes for variable bit rate (VBR) pre‐coded MPEG video sources. The proposed bandwidth allocation method, which predicts the bandwidth by the frame correlation, demonstrates a quite good performance when comparing with a previous scheme, especially for the video scenes with the combination of intraframes and interframes. Bandwidth allocation of a multiplexer connected to several video sources is also studied by using heuristic information. The experimental results show that the proposed method is much better than that of the fixed bandwidth allocation and is suitable for the application of MPEG video services. Copyright © 2000 John Wiley & Sons, Ltd.     

A system-level bandwidth design method for wormhole network-on-chip

To improve the Network-on-Chip (NoC) performance, we propose a system-level bandwidth design method customising the bandwidths of the NoC links. In details, we first built a mathematical model to catch the relationship between the NoC commutation latency and the NoC link bandwidth, and then develop a bandwidth allocation algorithm to automatically optimise the bandwidth for each NoC link. The experimental results show that our bandwidth-customising method improves the NoC performance compared to the traditional uniform bandwidth allocation method. Besides, it can also make our NoC to achieve the same communication performance level as the uniform bandwidth NoC but using fewer bandwidth resources, which is beneficial to save the NoC area and power.