Dynamic bandwidth allocation using infinitesimal perturbation analysis

Advances in network management and switching technologies make dynamic bandwidth allocation of logical networks built on top of a physical network possible. Previous proposed dynamic bandwidth allocation algorithms are based on simplified network model. The analytical model is valid only under restrictive assumptions. Infinitesimal Perturbation Analysis, a technique which estimates the gradients of the functions in discrete event dynamic systems by passively observing the system, is used to estimate delay sensitivities under general traffic patterns. A new dynamic bandwidth allocation algorithm using on-line sensitivity estimation is proposed. Simulation results show that the approach further improves network performance. Implementation of the proposed algorithm in operational networks is also discussed.published_or_final_versio

Dynamic Subcarrier Allocation for 100 Gbps, 40 km OFDMA-PONs with SLA and CoS

This paper was published in Journal of Lightwave Technology and is made available as an electronic reprint with the permission of OSA. The paper can be found at the following URL on the OSA website: http://www.opticsinfobase.org/jlt/issue.cfm?volume=31&issue=7 Systematic or multiple reproduction or distribution to multiple locations via electronic or other means is prohibited and is subject to penalties under lawThe quality of service of 100Gbps orthogonal frequency division multiple access passive optical networks (OFDMA-PONs) performing dynamic bandwidth allocation is evaluated. New medium access control protocols and frame formats have been developed, exhibiting hybrid OFDMA/time division multiple access scheduling, for capacity enhancement and granular bandwidth allocation. The sequential dynamic subcarrier allocation algorithms allow the network optical line terminal to grant the optical network units (ONUs) bandwidth using both status and non-status based algorithm. Simulations of a 100 Gbps network with 256 ONUs, 256 subcarriers and 40 km extended-reach demonstrate best network throughputs of 87.5 Gbps and 3 ms packet delays for high priority service classes, even at maximum ONU load. In addition, high service level agreement (SLA) ONUs exhibit 1.56 Gbps maximum capacity and 48.82 kbps granularity.Peer reviewedFinal Accepted Versio

Renegotiation based dynamic bandwidth allocation for selfsimilar VBR traffic

The provision of QoS to applications traffic depends heavily on how different traffic types are categorized and classified, and how the prioritization of these applications are managed. Bandwidth is the most scarce network resource. Therefore, there is a need for a method or system that distributes an available bandwidth in a network among different applications in such a way that each class or type of traffic receives their constraint QoS requirements. In this dissertation, a new renegotiation based dynamic resource allocation method for variable bit rate (VBR) traffic is presented. First, pros and cons of available off-line methods that are used to estimate selfsimilarity level (represented by Hurst parameter) of a VBR traffic trace are empirically investigated, and criteria to select measurement parameters for online resource management are developed. It is shown that wavelet analysis based methods are the strongest tools in estimation of Hurst parameter with their low computational complexities, compared to the variance-time method and R/S pox plot. Therefore, a temporal energy distribution of a traffic data arrival counting process among different frequency sub-bands is considered as a traffic descriptor, and then a robust traffic rate predictor is developed by using the Haar wavelet analysis. The empirical results show that the new on-line dynamic bandwidth allocation scheme for VBR traffic is superior to traditional dynamic bandwidth allocation methods that are based on adaptive algorithms such as Least Mean Square, Recursive Least Square, and Mean Square Error etc. in terms of high utilization and low queuing delay. Also a method is developed to minimize the number of bandwidth renegotiations to decrease signaling costs on traffic schedulers (e.g. WFQ) and networks (e.g. ATM). It is also quantified that the introduced renegotiation based bandwidth management scheme decreases heavytailedness of queue size distributions, which is an inherent impact of traffic self similarity. The new design increases the achieved utilization levels in the literature, provisions given queue size constraints and minimizes the number of renegotiations simultaneously. This renegotiation -based design is online and practically embeddable into QoS management blocks, edge routers and Digital Subscriber Lines Access Multiplexers (DSLAM) and rate adaptive DSL modems

Performance Analysis of a Dynamic Bandwidth Allocation Algorithm in a Circuit-Switched Communications Network

Military communications networks typically employ a gateway multiplexer to aggregate all communications traffic onto a single link. These multiplexers typically use a static bandwidth allocation method via time-division multiplexing (TDM). Inefficiencies occur when a high-bandwidth circuit, e.g., a video teleconferencing circuit, is relatively inactive rendering a considerable portion of the aggregate bandwidth wasted while inactive. Dynamic bandwidth allocation (DBA) reclaims unused bandwidth from circuits with low utilization and reallocates it to circuits with higher utilization without adversely affecting queuing delay. The proposed DBA algorithm developed here measures instantaneous utilization by counting frames arriving during the transmission time of a single frame on the aggregate link. The maximum calculated utilization observed over a monitoring period is then used to calculate the bandwidth available for reallocation. A key advantage of the proposed approach is that it can be applied now and to existing systems supporting heterogeneous permanent virtual circuits. With the inclusion of DBA, military communications networks can bring information to the warfighter more efficiently and in a shorter time even for small bandwidths allocated to deployed sites. The algorithm is general enough to be applied to multiple TDM platforms and robust enough to function at any line speed, making it a viable option for high-speed multiplexers. The proposed DBA algorithm provides a powerful performance boost by optimizing available resources of the communications network. Utilization results indicate the proposed DBA algorithm significantly out-performs the static allocation model in all cases. The best configuration uses a 65536 bps allocation granularity and a 10 second monitoring period. Utilization gains observed with this configuration were almost 17% over the static allocation method. Queuing delays increased by 50% but remained acceptable, even for realtime traffic

Delay Reduction on GPON by Modifying Bi-Partition Dynamic Bandwidth Allocation Method

The majority of the optical fiber access network is currently dominated by Gigabit Passive Optical Network (GPON) technology, which is able to provide various services such as video, voice, and internet data in the network. Time Division Multiplexing (TDM) is used to control the upstream bandwidth and divide it into smaller units on each Optical Network Termination (ONT). This allocation mechanism use Dynamic Bandwidth Allocation (DBA). DBA provides a statistical multiplexing algorithm for each ONT where the Optical Line Terminal (OLT) will allocate a timeslot that is not used to another ONT with a particular priority. Statistical multiplexing set the maximum permitted length of frame to be transmitted so all ONT’s have equal opportunities in the delivery of data. Development of the DBA algorithm was done by adding or modifying one or more parameters to get better results. Bipartition Dynamic Bandwidth Allocation divides one transmission cycle time into two groups and dynamically adjust the bandwidth between the groups with other groups in order to minimize idle time. The maximum transmission time of the two groups should not exceed the standard of maximum cycle time on GPON. The division of the transmission time will affect the network performance especially the performance of delay. We proposed to modify Group Based Bipartition DBA into Multi partition DBA by adding partition into four groups. Simulation was conducted using matlab to compare the performance of delay from Multi Partition DBA with previous method for two different traffic proportions. Multi partition DBA can improve 11% for average total delay performance for both traffic proportions because the addition number of partitions can resolve the idle period and makes DBA Time more effective which will reduce the total delay

Enabling Work-conserving Bandwidth Guarantees for Multi-tenant Datacenters via Dynamic Tenant-Queue Binding

Today's cloud networks are shared among many tenants. Bandwidth guarantees and work conservation are two key properties to ensure predictable performance for tenant applications and high network utilization for providers. Despite significant efforts, very little prior work can really achieve both properties simultaneously even some of them claimed so. In this paper, we present QShare, an in-network based solution to achieve bandwidth guarantees and work conservation simultaneously. QShare leverages weighted fair queuing on commodity switches to slice network bandwidth for tenants, and solves the challenge of queue scarcity through balanced tenant placement and dynamic tenant-queue binding. QShare is readily implementable with existing switching chips. We have implemented a QShare prototype and evaluated it via both testbed experiments and simulations. Our results show that QShare ensures bandwidth guarantees while driving network utilization to over 91% even under unpredictable traffic demands.Comment: The initial work is published in IEEE INFOCOM 201

A survey on OFDM-based elastic core optical networking

Orthogonal frequency-division multiplexing (OFDM) is a modulation technology that has been widely adopted in many new and emerging broadband wireless and wireline communication systems. Due to its capability to transmit a high-speed data stream using multiple spectral-overlapped lower-speed subcarriers, OFDM technology offers superior advantages of high spectrum efficiency, robustness against inter-carrier and inter-symbol interference, adaptability to server channel conditions, etc. In recent years, there have been intensive studies on optical OFDM (O-OFDM) transmission technologies, and it is considered a promising technology for future ultra-high-speed optical transmission. Based on O-OFDM technology, a novel elastic optical network architecture with immense flexibility and scalability in spectrum allocation and data rate accommodation could be built to support diverse services and the rapid growth of Internet traffic in the future. In this paper, we present a comprehensive survey on OFDM-based elastic optical network technologies, including basic principles of OFDM, O-OFDM technologies, the architectures of OFDM-based elastic core optical networks, and related key enabling technologies. The main advantages and issues of OFDM-based elastic core optical networks that are under research are also discussed

Using Dedicated and Opportunistic Networks in Synergy for a Cost-effective Distributed Stream Processing Platform

This paper presents a case for exploiting the synergy of dedicated and opportunistic network resources in a distributed hosting platform for data stream processing applications. Our previous studies have demonstrated the benefits of combining dedicated reliable resources with opportunistic resources in case of high-throughput computing applications, where timely allocation of the processing units is the primary concern. Since distributed stream processing applications demand large volume of data transmission between the processing sites at a consistent rate, adequate control over the network resources is important here to assure a steady flow of processing. In this paper, we propose a system model for the hybrid hosting platform where stream processing servers installed at distributed sites are interconnected with a combination of dedicated links and public Internet. Decentralized algorithms have been developed for allocation of the two classes of network resources among the competing tasks with an objective towards higher task throughput and better utilization of expensive dedicated resources. Results from extensive simulation study show that with proper management, systems exploiting the synergy of dedicated and opportunistic resources yield considerably higher task throughput and thus, higher return on investment over the systems solely using expensive dedicated resources.Comment: 9 page