Bandwidth Enforcement Research Articles

Nxt-Freedom: Considering VDC-Based Fairness in Enforcing Bandwidth Guarantees in Cloud Datacenter

In the cloud datacenter, for the multi-tenant model, network resources should be fairly allocated among VDCs (virtual datacenters). Conventionally, the allocation of cloud network resources is on a best-effort basis, so the specific information of network resource allocation is unclear. Previous research has either aimed to provide minimum bandwidth guarantee, or focused on realizing work conservation according to the VM-to-VM (virtual machine to virtual machine) flow policy or per-source policy, or both policies. However, they failed to consider allocating redundant bandwidth among VDCs in a fair way. This paper presents a bandwidth that guarantees enforcement framework NXT-Freedom, and this framework allocates the network resources on the basis of per-VDC fairness, which can achieve work conservation. In order to guarantee per-VDC fair allocation, a hierarchical max–min fairness algorithm is put forward in this paper. In order to ensure that the framework can be applied to non-congestion-free network core and achieve scalability, NXT-Freedom decouples the computation of per-VDC allocation from the execution of allocation, but it brings some CPU overheads resulting from bandwidth enforcement. We observe that there is no need to enforce the non-blocking virtual network. Leveraging this observation, we distinguish the virtual network type of VDC to eliminate part of the CPU overheads. The evaluation results of a prototype prove that NXT-Freedom can achieve the isolation of per-VDC performance, which also shows fast adaption to flow variation in cloud datacenter.

Flow-based anomaly intrusion detection using machine learning model with software defined networking for OpenFlow network

Moving towards recent technologies, Software Defined Networking (SDN) produces a promising network framework to combine the overall network management system with network programming. It gives a more effective tracking system towards the data center. By centralized system and symmetric controller, it prevents security cracks from creating new threats during OpenFlow packet transmission with vulnerabilities. It creates more interest to the researchers to work towards Flow-based SDN for the priority-driven algorithm in anomaly intruder detection. In this paper, we made a study towards a priority-based model using SDN to control the flow of data packets over the network, gives assurance to the bandwidth enforcement, and reallocation is made through virtual circuits. The network behavior of the system is continuously monitored through the machine learning model for normal and abnormal traffic data transmission to detect anomaly intruders. Flow-based machine learning (ML) model with SDN act as an intelligent system to limits the throughput virtually through the flow of reserved bandwidth and make use of extra bandwidth, which presents more than the utilization bandwidth for priority-based applications with minimal cost while compared with the traditional methods. The proposed work also compared with the schemes available at the network to produce outcomes with fast routing and the fault tolerance of existing networks to overcome the gap open at the security of the SDN architecture to detect and identify vulnerabilities.

Towards Bandwidth Guarantee for Virtual Clusters Under Demand Uncertainty in Multi-Tenant Clouds

In the cloud, multiple tenants share the resource of datacenters and their applications compete with each other for scarce network bandwidth. Current studies have shown that the lack of bandwidth guarantee causes unpredictable network performance, leading to poor application performance. To address this issue, several virtual network abstractions have been proposed which allow the tenants to reserve virtual clusters with specified bandwidth between the Virtual Machines (VMs) in the datacenters. However, all these existing proposals require the tenants to deterministically characterize the bandwidth demands in the abstractions, which can be difficult and result in inefficient bandwidth reservation due to the demand uncertainty. In this paper, we explore a virtual cluster abstraction with stochastic bandwidth characterization to address the bandwidth demand uncertainty. We propose Stochastic Virtual Cluster (SVC), which models the bandwidth demand between VMs in a probabilistic way. Based on SVC, we develop a stochastic framework for virtual cluster allocation, in which the admitted virtual cluster's bandwidth demands are satisfied with a high probability. Efficient VM allocation algorithms are proposed to implement the framework while reducing the possibility of link congestion through minimizing the maximum bandwidth occupancy of a virtual cluster on physical links. Using simulations, we show that SVC achieves the trade-off between the job concurrency and the average job running time, and demonstrate its effectiveness for accommodating cloud application workloads with highly volatile bandwidth demands and its improvement to work-conserving bandwidth enforcement.

An adaptive scheme for admission control in ATM networks

This paper presents a real time front-end admission control scheme for ATM networks. A call management scheme which uses the burstiness associated with traffic sources in a heterogeneous ATM environment to effect dynamic assignment of bandwidth is presented. In the proposed scheme, call acceptance is based on an on-line evaluation of the upper bound on cell loss probability which is derived from the estimated distribution of the number of calls arriving. Using this scheme, the negotiated quality of service will be assured when there is no estimation error. The control mechanism is effective when the number of calls is large, and tolerates loose bandwidth enforcement and loose policing control. The proposed approach is very effective in the connection oriented transport of ATM networks where the decision to admit new traffic is based on the a priori knowledge of the state of the route taken by the traffic.

A Scheduling Technique Wireless Personal for Bandwidth Communication Allocation in Networks

Future generation wireless personalcommunication networks (PCN) are expected to providemultimedia capable wireless extensions of fixedATM/B-ISDN. This paper presents a scheduling techniquefor PCN based on TDMA and the leaky bucket regulator, thewell known bandwidth enforcement mechanism for fixedATM. The main objective of the proposed technique is toensure fair and efficient treatment of various types oftraffic on the air interface, includingconstant-bit-rate (CBR) voice and variable-bit-rate(VBR) video. Two alternative priority mechanisms areintroduced and their performance is evaluated. Theperformance comparison of the alternatives reveals aninteresting tradeoff between fairness and quality ofservice (QoS).

Towards optimal policing in ATM networks

This paper proposes a framework for optimal policing in ATM networks. A general approach to modeling controllers which implement the policing function is described, using finite-state automata. The theory of finite-state accepting automata and regular expressions enables the explicit representation of all traffic patterns which pass through the policing controller, without modification. This in turn enables the symbolic computation of the worst-case source and therefore provides a unified framework for the formulation and derivation of optimal bandwidth enforcement schemes. Exhaustive searches are performed for small cases to find optimal finite-state automata. These optimal results are extended to obtain near-optimal solutions for larger-state automata. The optimal and near-optimal policing controller designs are compared to conventional schemes, such as leaky buckets, and improvement in performance is achieved, where performance is measured in terms of cell loss rate for the declared source and throughput of the corresponding worst case source.

Two-level congestion control schemes for ATM networks

In this paper, congestion control schemes are proposed to prevent the network from congestion for ATM (Asynchronous Transfer Mode) networks by controlling the congestion at VC (virtual circuit) and cell levels. At VC level, a bandwidth allocation scheme is performed during the call setup in the form of bandwidth reservation. Call acceptance is decided on the basis of on-line evaluation of traffic utilization. This scheme confines the bandwidth allocation according to the anticipated traffic characteristics and the quality requirements of connected calls. On the other hand, at cell level, an enforcement scheme is proposed to smooth the unexpected traffic from each source during the transmission period. This scheme only allows a cell to be dispatched at the begin of each slot time, thereby regulating cells entering the public network. In addition, several bandwidth enforcement mechanisms and bandwidth allocation methods are presented in order for comparison with the proposed schemes. It shows from the simulation that our schemes perform better than other methods.

An adaptive policing mechanism for a DQDB MAN

In networks based on statistical multiplexing the actual bandwidth use of each virtual connection has to be monitored and the traffic parameters have to be within the limits agreed upon during the call set up in order to avoid a non-controlled call to heavily delay or even destroy the data units of other calls. The here-described traffic source bandwidth enforcement mechanism for DQDB networks (referred to as Adaptive Leaky Bucket) exploits the access mechanisms provided for in the DQDB standard while it does not introduce any extra network signalling load nor it affects network performance.

Performance analysis of leaky-bucket bandwidth enforcement strategy for bursty traffics in an ATM network

In this paper, we analyze the performance of the bandwidth enforcement strategy applied for the bursty traffic. As a bandwidth enforcement strategy, we consider the leaky-bucket (LB) strategy which has been regarded as the most promising and easily implementable strategy. In this analysis, we use an Markov-modulated Poisson process (MMPP) as a model for the burst input traffic. With a token and a token pool as models for the transmission right and the allowed burstiness of the input traffic, respectively, we analyze and obtain the performance of the traffic under the LB bandwidth enforcement strategy. We also present some numerical results to show the effects of the system parameters on the performance of the traffic measured by the cell delay and the cell blocking probability.

Fairness in broadband ISDNs

In order to achieve satisfactory performance in broadband Integrated Services Digital Networks (ISDNs), some techniques to control flow of information traffic, are necessary. Bandwidth allocation, bandwidth enforcement, and load balancing, are some of the examples of these techniques. Unfortunately, some of these techniques result in unfair distribution of resources among users. Recently, fairness in resource sharing systems has received significant attention among researchers.In this paper, we discuss, in comparative terms, several resource allocation techniques along with their fairness aspects in broadband ISDNs. We will also propose a threshold-based scheme to minimize the blocking probability and improve fairness.

Dynamic call admission control in ATM networks

The authors present dynamic call admission control using the distribution of the number of cells arriving during the fixed interval. This distribution is estimated from the measured number of cells arriving at the output buffer during the fixed interval and traffic parameters specified by users. Call acceptance is decided on the basis of online evaluation of the upper bound of cell loss probability, derived from the estimated distribution of the number of calls arriving. QOS (quality of service) standards can be guaranteed using this control when there is no estimation error. The control mechanism is effective when the number of call classes is large. It tolerates loose bandwidth enforcement and loose policing control, and dispenses with modeling of the arrival processes. Numerical examples demonstrate the effectiveness of this control, and implementation is also discussed. >

The ‘leaky bucket’ policing method in the ATM (asynchronous transfer mode) network

AbstractThe new asynchronous transfer mode (ATM) will be used for the information transport in the future broadband network. An important function of the ATM network is bandwidth enforcement or policing. The so‐called ‘leaky bucket’ algorithm can be used to monitor and enforce the bit rate of a constant bit rate (CBR) connection. The parameters of the ‘leaky bucket’ algorithm depend on the bit rate of the connection and on the cell delay jitter. Sugestions for setting the parameters of the ‘leaky bucket’ algorithm are provided in this paper. Furthermore, a ‘dual leaky bucket’ algorithm is proposed to police the traffic parameters of a variable bit rate (VBR) connection. The ‘dual leaky bucket’ approach could also be used to define a VBR bearer service in the future broadband network.