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 simple bandwidth management scheme for multiservice ATM networks

In this paper we outline a simple strategy to manage bandwidth allocation and congestion control and to guarantee service requirements in a multiservice ATM (asynchronous transfer mode) network. We propose a network architecture based on a core network, making available a limited number of quality of service profiles, and an access network, made of edge adapters in charge to match the user's requirements with the network's available quality of service profiles and to shape input traffic to achieve high network throughput. The connection admission rule is presented, and edge adapter architecture and design examples are given. The effectiveness of the scheme is demonstrated by numerical results which report the network utilization performance when the proposed core network policies and edge adapter design apply.     

Adaptive bandwidth management in ATM networks

A framework for adaptive bandwidth management in ATM based networks is proposed. It is based on a layered approach which includes bandwidth allocation to virtual networks. The central concept of this approach is adaptive estimation of the effective bandwidth required, by connections carried in the network. To achieve reliable results the estimation process takes into account both the traffic source declarations and the connection superposition process measurements on the network links. This is done in an optimization framework provided by estimation theory. A study, based on a linear two-state Kalman filter, shows that the proposed approach provides good adaptation to undeclared changes in traffic parameters and that the network performance is significantly improved when compared to the effective bandwidth allocation based solely on the source parameters declarations. These features allow more relaxed source parameter declarations and at the same time permit less stringent source policing. Thus the two bottlenecks influencing bandwidth management in ATM networks can be significantly widened.     

Performance issues of bandwidth management in ATM networks

In our days, efficient management of the available network resources becomes a critical issue, both from a functional point of view (so that users can be provided with the bandwidth they need), and an economical point of view (so that carriers can satisfactorily and efficiently serve as many customers as possible and at the same time increase their revenue). In this paper we consider a bandwidth control scheme (i.e. managed bandwidth service) for an ATM network infrastructure which is applied to the Greek research and technology network (GRNET). We present some methods that we have tested (in a simulation setting) in order to increase the efficiency of the system and the utilization of the available bandwidth. More specifically, we consider a bandwidth‐resizing algorithm for virtual paths, in order to keep the allocated bandwidth very close to the bandwidth actually used. This leads to an increased number of accepted requests and better network utilization. We, also, use the simulation results in order to get an estimation of the effective bandwidth for VBR paths that can be used in call admission. Finally, we consider a semi‐offline scheme where requests are gathered and considered for acceptance in regular intervals. Simulation results show an increase in the utilization of resources. As a further improvement, we allow connections to be allocated a little before or after the time initially requested. This leads to further improvement in network utilization. All the improvement schemes were tested with the ATM‐TN simulator and the results look promising. Copyright © 2003 John Wiley & Sons, Ltd.     

A new approach for allocating buffers and bandwidth toheterogeneous, regulated traffic in an ATM node

A new approach to determining the admissibility of variable bit rate (VBR) traffic in buffered digital networks is developed. In this approach all traffic presented to the network is assumed to have been subjected to leaky-bucket regulation, and extremal, periodic, on-off regulated traffic is considered; the analysis is based on fluid models. Each regulated traffic stream is allocated bandwidth and buffer resources which are independent of other traffic. Bandwidth and buffer allocations are traded off in a manner optimal for an adversarial situation involving minimal knowledge of other traffic. This leads to a single-resource statistical-multiplexing problem which is solved using techniques previously used for unbuffered traffic. VBR traffic is found to be divisible into two classes, one for which statistical multiplexing is effective and one for which statistical multiplexing is ineffective in the sense that accepting small losses provides no advantage over lossless performance. The boundary of the set of admissible traffic sources is examined, and is found to be sufficiently linear that an effective bandwidth can be meaningfully assigned to each VBR source, so long as only statistically-multiplexable sources are considered, or only nonstatistically-multiplexable sources are considered. If these two types of sources are intermixed, then nonlinear interactions occur and fewer sources can be admitted than a linear theory would predict. A qualitative characterization of the nonlinearities is presented. The complete analysis involves conservative approximations; however, admission decisions based on this work are expected to be less overly conservative than decisions based on alternative approaches     

A FIFO-based buffer management approach for the ATM GFR services

We investigate the TCP packet transmission over the ATM Guaranteed Frame Rate (GFR) service using a selective packet-discard with buffer vacancy tracking strategy and a packet-based push-out buffering scheme. Our approach is based on FIFO queueing discipline, it features fair sharing of available resources as well as feasibility in hardware implementation     

A congestion control framework for ATM networks

The authors propose a congestion control framework for ATM networks that requires simple protocols and that provides guaranteed grade of service The authors suggest that the network provides two different services: express service and first-class service. Express service is appropriate for real-time applications, whereas first-class service is appropriate for nonreal-time applications. To provide such services, the proposed congestion control scheme prevents congestion inside the network by controlling the congestion at two levels: VC (virtual circuit) level and cell level. The VC-level control takes place during the call setup in the form of (logical) bandwidth reservation for individual VCs. The cell-level control is exercised across the network interface in the form of the choking/relieving of only first-class VC traffic in case of congestion. The authors analyze the performance of the proposed scheme, and show how to engineer various parameters to satisfy cell-level performance requirements (e.g., cell delay and loss)     

A simple bandwidth management strategy based on measurements ofinstantaneous virtual path utilization in ATM networks

A new connection admission control method based on actual virtual path traffic measurements is proposed to achieve high bandwidth efficiency for various types of traffic. The proposed method is based on the measurement of instantaneous virtual path utilization, which is defined as the total cell rate of the active virtual channels normalized by the virtual path capacity. A low-pass filter is used to determine the instantaneous virtual path utilization from crude measurements. A smoothing coefficient formula is derived as a function of the peak rate of the virtual channel. The residual bandwidth is derived from the maximum instantaneous utilization observed during a monitoring period. Simulation shows that the proposed method achieves statistical multiplexing gains of up to 80% of the limit possible with optimum control for similar traffic sources. It can be implemented with very simple hardware. The admission decision is simple: the requested bandwidth is compared with the residual bandwidth. This method is therefore well suited for practical asynchronous transfer mode switching systems     

Effective bandwidth approach to connection admission control formultimedia traffic in ATM networks

The authors propose an effective bandwidth approach to connection admission control in ATM networks. The aggregate arrival traffic is accurately modelled by a two-state Markov modulated Poisson process (MMPP) via the matching of four important statistics. If the buffer is large, admission control can be achieved by computing the effective bandwidth of the two-state MMPP. Simulation tests show that approach is simple and results in higher utilisation compared with conventional methods     

A heuristic framework for source policing in ATM networks

Provides a heuristic framework for the analysis and design of source policing mechanisms for ATM networks. The authors first introduce a function called the time ϵ-quantile function associated with a source and a second function associated with the policing mechanism. These two characteristics when used in conjunction allow to obtain a useful design tool for source policing. The authors illustrate the use of this framework on source models as well as on real video sources. This framework leads also to a new and natural notion of the response time (called detection time) of the policing mechanism and show how the heuristic framework allows for a quick estimation of this detection time     

A dynamic bandwidth control scheme of VP in ATM networks

This paper proposes an efficient adaptive bandwidth allocation scheme of virtual paths. The bandwidth of a virtual path is dynamically adjusted according to the link residual capacity. The scheme can remarkably reduce the load on node processing and simplify the network architecture, while keeping higher transmission efficiency. The excellent performance is proved by detailed theoretical analyses.     

Analytical approach towards available bandwidth estimation in wireless ad hoc networks

Wireless Networks - Since 1999 IEEE 802.11 has become a dominating wireless technology for providing WLAN in both public and private places. The protocol has evolved with time and the current...     

A low-state packet marking framework for approximate fair bandwidth allocation

Misbehaving, non-congestion-reactive traffic is on the rise in the Internet. One way to control misbehaving traffic is to enforce local fairness among flows. Locally fair policies, such as fair-queueing and other fair AQM schemes, are inadequate to simultaneously control misbehaving traffic and provide high network utilization. We thus need to enforce globally fair bandwidth allocations. However, such schemes have typically been stateful and complex to implement and deploy. In this letter, we present a low state, lightweight scheme based on stateless fair packet marking at network edges followed by RIO queueing at core nodes, to control misbehaving flows with more efficient utilization of network bandwidth. Additionally, with low-state feedback from bottleneck routers, we show that, in practice, we can approximate global max-min fairness within an island of routers. We show, using simulations, that we can indeed control misbehaving flows and provide more globally fair bandwidth allocation.     

Managing bandwidth in ATM networks with bursty traffic

Three approaches to the bandwidth management problem that have been proposed and studied by various groups are reviewed to illustrate three distinctly different approaches and identify their strengths and weaknesses. Based on these approaches, a bandwidth management and congestion control scheme for asynchronous transfer mode (ATM) networks that supports both point-to-point and one-to-many multicast virtual circuits is proposed. It is shown that the method can handle fully heterogeneous traffic and can be effectively implemented. The algorithm for making virtual circuit acceptance decisions is straightforward and fast, and the hardware mechanisms needed to implement buffer allocation and traffic monitoring at the user-network interface have acceptable complexities. It is also shown, through numerical examples, that the approach can achieve reasonable link efficiencies even in the presence of very bursty traffic. No advance reservation required, simplifying the interface between the network and the user and avoiding an initial network round trip delay before data can be transmitted     

Topology design and bandwidth allocation in ATM nets

The design of a P/S network embedded into a backbone facility network is discussed. The problem is formulated as a network optimization problem where a congestion measure based on the average packet delay is minimized, subject to capacity constraints posed by the underlying facility trunks. The variables in this problem are the routing on the express pipes (i.e. the channels that interconnect the P/S modes) and the allocation of bandwidth to such pipes. An efficient algorithm is presented for the solution of the above problem and it is applied to some representative examples. It is shown that for some test cases the congestion measure is substantially reduced with respect to the values obtained when the embedded topology is kept identical to the backbone topology. Dynamic reconfiguration schemes where the embedded topology is periodically adjusted to track the fluctuations in traffic requirements are discussed     

Reservation-based bandwidth allocation in a radio ATM network

The comparative performance of a number of reservation-based bandwidth sharing policies that could be used to maximize the link utilization and/or offer equally fair or preferential treatment to a class of supported users, is examined in the context of a radio asynchronous transfer mode local-area network (ATM LAN). Our analytical results, based an a recursion for the link occupancy distribution originally suggested by Kaufman (1981) and Roberts (1981) independently and subsequently extended to include finite source population models, are further extended in the cases of equal sharing of the resources with retries, and a dynamic sharing mechanism in which, when the available capacity is exceeded, weighted reductions for the active users' rates and queueing are employed. Next, examining the application of the above sharing schemes in an indoor radio environment, we apply switched diversity and a Reed-Solomon-based forward error correction (FEC) scheme to recover radio-related (Rayleigh fading) packet losses. The performance and the effects of the fading-mitigating switched-antenna-diversity mechanism and the required on a packet-basis coding protection are taken into account in order to establish the actual radio link throughput under the above conditions     

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 game theoretic framework for bandwidth allocation and pricing inbroadband networks

In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in high-speed networks. The framework is based on the idea of the Nash bargaining solution from cooperative game theory, which not only provides the rate settings of users that are Pareto optimal from the point of view of the whole system, but are also consistent with the fairness axioms of game theory. We first consider the centralized problem and then show that this procedure can be decentralized so that greedy optimization by users yields the system optimal bandwidth allocations. We propose a distributed algorithm for implementing the optimal and fair bandwidth allocation and provide conditions for its convergence. The paper concludes with the pricing of elastic connections based on users' bandwidth requirements and users' budget. We show that the above bargaining framework can be used to characterize a rate allocation and a pricing policy which takes into account users' budget in a fair way and such that the total network revenue is maximized     

A congestion control framework for available bit rate service in ATM networks

Fair packet discarding (FPD) is a mechanism which provides incentives to users to co‐operate in congestion control, so that ATM networks can operate more efficiently. In this paper, we propose a simple congestion control framework consisting of a combination of FPD and ATM Forum's explicit‐rate flow control scheme. We show by simulations that this frame‐work achieves all objectives of congestion control: (1) control congestion, (2) achieve high user‐perceived throughput, (3) maintain fairness and (4) provide protection from misbehaving users. In addition, we equip this framework with two enhancements to improve efficiency, and reduce end‐to‐end delay. Copyright © 2002 John Wiley & Sons, Ltd.     

ATM via satellite: A framework and implementation

This paper describes an ATM‐based satellite network, focusing on the networking (ATM) aspects of the design. The ATM requirements and the basic design of the network are outlined. In particular, a simple MAC layer is proposed in which ATM service classes are mapped onto MF‐TDMA uplink access methods. The uplink access and resource allocation approaches based on this model are described in detail. Also, this paper shows how different qualities‐of‐service can be provided by using a combination of different access schemes. This paper also covers scheduling for the uplink portion of the satellite network. The use of Hierarchical Round Robin is argued on the grounds of performance, flexibility and implementability. This revised version was published online in June 2006 with corrections to the Cover Date.