Bandwidth Reservation Research Articles

Optimizing co-existing multicast routing trees in IP network via discrete artificial fish school algorithm

Increasingly more internet-applications require the supports of multiple multicasts, while existing multicast routing algorithms only aim to establish a single multicast routing tree (MRT). Sequentially optimizing the co-existing MRTs each is a common practice of handling the situation of multiple multicast session being concurrent, but it results in link-congestion on low-cost routes, or leads to non-optimal solution even if bandwidth reservation strategy is adopted. This paper proposes to optimize multiple co-existing MRTs as a whole via one-off optimization instead of sequentially optimizing each in isolation. To carry out the one-off optimization, a discrete artificial fish school algorithm (DAFSA) is proposed. The simulation results show that the proposed DAFSA is capable of optimally packing co-existing MRTs and exhibits remarkably better ability than several the most representative state-of-the-art algorithms in the sense of avoiding the link-congestion and minimizing the overall tree cost. The running time of the proposed DAFSA fully meets the requirements of the practical IP multicasting. Besides, Monte Carlo test proves that the convergence of the proposed DAFSA is not sensitive to its parameters.

Performance of Dynamic Priority Based Interference Aware Channel Allocation in Wireless Mesh Networks for Energy Conservation

The Dynamic Wireless Mesh Network (DWMN) infrastructure is a pair or multiple dynamic nodes with networking capability to communicate with one another utilising Sink Nodes (SN). Due to its mobile nature, it is termed as Dynamic in nature. SN traverses over the predefined path over the Wireless Mesh Network. As the nodes engage into mobility, the neighbourhood table should be updated at a minimum rate of once every five seconds. The alarming fact in WMN is, Energy to transmit a bit is equivalent to computing hundreds of instructions at that instant. Hence there is a need to concentrate on energy dimension of DWMN. A node loses certain amount of energy while transmitting and receiving the packet, hence there is a minor decline in the initial energy of the node. The existing value of energy at a moment after transmitting and receiving the packet is coined as Residual Energy. The energy consumed by the node for transmitting and receiving the packet over the particular time frame is coined as Average Energy. Network Simulator v.2 tool has been utilised to simulate network creation with multiple mobile nodes for packet transmission or reception and packet drop conditions due to interference. Bandwidth Reservation (BR) for energy analysis is done by both Priority Based Interference Aware Bandwidth Reservation (PBIABR) and Interference Aware Bandwidth Reservation (IABR) for many flowing rates under dynamic scenario. Channel Priority plays a vital role to opt the channel which posses less interference for efficient bandwidth reservation for PBIABR. The opted channel will have the minimal channel interference effect. IABR posses the controllability character for data flow to establish end-to-end communication over Multi-Radio Multi-Channel (MRMC) - Wireless Mesh Network. This research paper focuses on deep analysis of Residual Energy (joule) compared with Interval (sec) and Average Energy (joule) compared with Interval (sec) under dynamic scenario for multiple flow rates by implementing PBIABR and IABR criteria.

Performance evaluation of bandwidth reservation for mmWave in 5G NR systems

Introduction: In 3GPP New Radio (NR) systems, frequent radio propagation path blockages can lead to the disconnection of ongoingsessions already accepted into the system, reducing the quality of service in the network. Controlling access to system resource byprioritizing for the ongoing sessions can increase the session continuity. In this paper, we propose resource allocation with a reservationmechanism. Purpose: Development of a mathematical model for analyzing the effect of this mechanism on other system performanceindicators – dropping probabilities for new and ongoing sessions and system utilization. The model takes into account the key featuresof the 3GPP NR technology, including the height of the interacting objects, the spatial distribution and mobility of the blockers, as wellas the line-of-sight propagation properties between the transceivers for mmWave NR technology. Results: We analyzed the reservationmechanism with the help of a developed model in the form of a resource queueing system with signals, where the base station bandwidthcorresponds to the resource, and the signals model a change in the line-of-sight conditions between the receiving and transmittingdevices. Creating a priority for ongoing sessions whose service has not yet been completed provides a considerable flexibility forbalancing the session continuity and dropping of a new session, with a slight decrease in the efficiency of the radio resource utility. Withthe developed model, we showed that reserving even a small bandwidth (less than 10% of the total resources) to maintain the ongoingsessions has a positive effect on their continuity, as it increases the probability of their successful completion. Practical relevance:
 The proposed mechanism works more efficiently in overload conditions and with sessions which have a high data transfer raterequirements. This increases the demand for the proposed mechanism in 5G NR communication systems.

Dynamic Network Scheduling for Virtual Routers

Network scheduling is important to satisfy the bandwidth requirements of virtual networks that consist of virtual machines in the end-hosts and the virtual routers connecting them. However, existing studies have focused on developing bandwidth allocation techniques for end-host virtual machines, but do not consider the network performance of virtual routers. In this article, we propose a new network scheduling framework for virtual routers-CreditBank. CreditBank dynamically allocates network resources to virtual routers according to bandwidth requirements, and it adapts to changing network environments without adding significant overhead. CreditBank offers three scheduling policies: minimum bandwidth reservation, weight-based proportional sharing, and hybrid scheduling. In addition, CreditBank supports an efficient work-conserving method to maximize network utilization. We implement CreditBank based on the Xen and Kernel-based Virtual Machine (KVM) hypervisors and evaluate its performance. The evaluation results indicate that CreditBank satisfies bandwidth requirements of the virtual routers while utilizing up to 99% of network resources.

Analysis of a hybrid Fixed-Elastic DBA with guaranteed fronthaul delay in XG(s)-PONs

Reusing the existing Optical Distribution Network (ODN) of Passive Optical Networks (PONs) to bring connectivity to residential households together with providing the so-called front-haul (FH) network in Cloud Radio Access Networks (C-RAN) is a promising converged fixed and mobile network architecture envisioned by network operators. This article overviews how to exploit Fixed Bandwidth Reservations allowed in ITU-T XG(S)-PONs and their suitability for the transmission of front-haul (FH) traffic, thus allowing one Remote Radio Unit (RRU) coexist with multiple residential Optical Network Units (ONUs) in the same PON. We explain how to configure such periodic reservations to improve access in the upstream channel of a PON, showing worst-case access delays below 100 μs for eCPRI’s functional split IU.

Performance Analysis on Hybrid Wireless Mesh Network Topology using Interference Aware Bandwidth Reservation

Ubiquitous of modern era which utilises Hybrid Wireless Mesh Network (HWMN) topology which gave birth to ample of modern application which demands reliability, fault tolerance and scalability. HWSN topology utilises minimum of two or multiple standard network architectural topologies, in a fashion that the resultant network architecture doesn’t depict any particular topologies like bus, star or ring but as a combination of any of those standard topologies. Prime motive of the proposed Optimised Channel Assignment Algorithm (OCSA) is which focuses on priority oriented interference minimization for all the trees which are existed, and constraint in terms of delay for evolving tree addition. Interference Aware Bandwidth Reservation (IABR) provides controllability over data flow admission for end-to-end optimal bandwidth accommodation in Multi-Radio Multi-Channel (MRMC) wireless mesh network. Proposed Priority Based Interference Aware Bandwidth Reservation (PBIABR) utilises disseminated and polynomial-time heuristic oriented assignment in channel to minimize interference in WMN with the awareness of channel priority as a primary consideration. Interference and Priority of the channel are made indirectly proportional to each other. For the channel of high priority the path which has low interference is opted. In PBIABR the whole path delay constraint of tree is sub organised into multiple node, based on delay to identify the best node which embodies minimal interference. Dominant Performance Parameters (DPP) like Throughput, Packet Size, Propagation Interval and Average Energy under HWSN Scenario. All the DPP parameters are analysed for multiple flow parameters for Interference Aware Bandwidth Reservation (IABR) and Proposed Priority Based Interference Aware Bandwidth Reservation (PBIABR) conditions. Simulation results have been captured using Network Simulator 2 tools for HWSN creation and crafted to same readings as a graph for deep analysis. The proposed simulation results for hybrid scenario highlights a considerable performance hike for the performance parameters like Throughput (bps) vs Packet size (bytes), Average Energy (joule) vs Interval (sec) and Residual Energy (joule) vs Interval (sec) under PBIABR conditions compared with IABR simulation outcome. The results have been analysed for comparative study of each parameter deeply. Inference from the comparative analysis highlights the performance parameters of PBIABR is efficient than IABR.

User Mobility in a 5G Cell with Quasi-Random Traffic under the Complete Sharing and Bandwidth Reservation Policies

5G cellular mobile networks aspire to accommodate large numbers of users and devices most of which are expected to be mobile. They will also provide much higher data rates than previous generations’ networks. Analyzing how a cell’s performance is impacted by user mobility becomes paramount in an effort to provide the best possible quality of services. In this paper we propose a model of a generic cell where each user is moving based on the random waypoint model. We then adapt this model to a 5G cell to extract meaningful quality of service metrics. To this end and to provide a better perspective of how the model can be adapted to different bandwidth allocation policies, we extend the Engset multirate loss model to obtain recursive but efficient formulas for various performance measures, including call blocking and time congestion probabilities for both the complete sharing and bandwidth reservation policies.

Performance enhancement of extended AFDX via bandwidth reservation for TSN/BLS shapers

To support mixed-criticality applications, the AFDX may integrate multiple traffic classes: Safety-Critical Traffic (SCT) with hard realtime constraints, Rate-Constrained (RC) traffic requiring bounded latencies and Best Effort (BE) traffic with no delivery constraints. These traffic classes are managed based on a Non-Preemptive Strict Priority (NP-SP) Scheduler, where the highest priority traffic (SCT) is shaped with a Burst Limiting Shaper (BLS). The latter has been defined by the Time Sensitive Networking (TSN) task group to limit the impact of high priority flows on lower priority ones. This paper proposes two bandwidth reservation methods for BLS shapers in AFDX networks. The proposed methods are evaluated on a realistic AFDX configuration. Results show their efficiency to noticeably enhance the RC delay bounds and the SCT schedulability, in comparison to an intuitive method.

Improving Session Continuity With Bandwidth Reservation in mmWave Communications

Unexpected fluctuations in radio resource demands of active sessions in millimeter-wave (mmWave) systems caused by dynamic blockage of the line-of-sight path may lead to accidental session drops. Existing solutions addressing this problem incorporate multi-connectivity operation that reroutes an ongoing session to another mmWave access point nearby. We introduce and analyze an alternative approach for improving session continuity based on the concept of bandwidth reservation. We develop an analytical model for the mmWave system that employs the proposed technique and quantify its benefits and drawbacks. We show that even a small fraction of reserved bandwidth may significantly improve session continuity.

Congestion probabilities in the X2 link of LTE networks

In this paper, first we review two multirate loss models, whereby we can assess the call-level QoS of the Long Term Evolution X2 link supporting calls of different service-classes with fixed bandwidth requirements. The X2 interface directly connects two neighboring evolved NodeBs and is mainly responsible for the transfer of user-plane and control-plane data during a handover. In both models, the X2 interface is modelled as a link of fixed capacity. Handover calls are accepted in the X2 link whenever there exists available bandwidth, i.e., no QoS guarantee is achieved for high-speed calls. Secondly, we propose three multirate loss models where calls arrive in the X2 link according to a quasi-random process and compete for the available bandwidth under the Multiple Fractional Channel Reservation (MFCR) policy, the Bandwidth Reservation (BR) policy and the Complete Sharing (CS) policy. The MFCR/BR policies allow the reservation of real/integer number of channels, respectively, in order to benefit high-speed calls. The CS policy allows calls to enter the system when there exists available bandwidth (no reservation is allowed). We propose approximate but recursive formulas for the calculation of time and call congestion probabilities as well as link utilization for all three policies. The accuracy of the proposed formulas is verified through simulation and found to be highly satisfactory.

An efficient bandwidth reservation policy for data-intensive applications in cloud

Recently, more and more data-intensive applications have been deployed in cloud platforms due to its cost-effective and elastic capability. Although computing resources (i.e., CPU and RAM) can be provisioned in on-demand manner, the network bandwidth has enforce certain admission controlling for providing desirable quality-of-service (QoS). As a result, data-intensive applications often suffer from high delay during the phase of bulk data transferring between computing nodes. In this paper, we present an integrated bandwidth reservation algorithm, which combines different admission controlling policies and minimises the finishing time for all jobs in an online manner. Performance evaluation on a real-world cloud platform shows that the proposed reservation algorithm can ensure efficient bulk data transferring even when the system is facing heavy workloads.

Joint Channel Assignment and Bandwidth Reservation in WMNs

Joint Channel Assignment and Bandwidth Reservation in WMNs

An efficient bandwidth reservation policy for data-intensive applications in cloud

Recently, more and more data-intensive applications have been deployed in cloud platforms due to its cost-effective and elastic capability. Although computing resources (i.e., CPU and RAM) can be provisioned in on-demand manner, the network bandwidth has enforce certain admission controlling for providing desirable quality-of-service (QoS). As a result, data-intensive applications often suffer from high delay during the phase of bulk data transferring between computing nodes. In this paper, we present an integrated bandwidth reservation algorithm, which combines different admission controlling policies and minimises the finishing time for all jobs in an online manner. Performance evaluation on a real-world cloud platform shows that the proposed reservation algorithm can ensure efficient bulk data transferring even when the system is facing heavy workloads.

Distributed scheduling with efficient collision detection for end-to-end delay optimization in 6TiSCH multi-hop wireless networks

It is expected that the IEEE 802.15.4e-TSCH designed for wireless industrial sensor networks will be used in IoT systems. This standard relies on techniques such as channel hopping and bandwidth reservation to ensure both energy savings and reliable transmissions. Since many applications may require low end-to-end delay (e.g., alarms), we propose here a distributed algorithm to schedule the transmissions while upper bounding the end-to-end source-sink delay. Our strategy constructs stratums, regrouping all the nodes with the same depth in the DODAG Destination Oriented Directed Acyclic Graph constructed by RPL. Then, different time-frequency blocks(bands) are assigned deterministically to each stratum. By appropriately tuning the size of each block and chronologically organizing them, we are able to guarantee any packet is delivered along the path length to the border router before the end of the slotframe. We also provide self-healing mechanism to detect and alleviate local collisions. Experiments on a large-scale testbed prove the relevance of this approach to reduce the end-to-end delay while minimizing the number of collisions, prejudicial to the reliability in multihop networks.

Burstiness-Aware Bandwidth Reservation for Ultra-Reliable and Low-Latency Communications in Tactile Internet

The Tactile Internet that will enable humans to remotely control objects in real time by tactile sense has recently drawn significant attention from both academic and industrial communities. Ensuring ultra-reliable and low-latency communications with limited bandwidth is crucial for Tactile Internet. Recent studies found that the packet arrival processes in Tactile Internet are very bursty. This observation enables us to design a spectrally efficient resource management protocol to meet the stringent delay and reliability requirements while minimizing the bandwidth usage. In this paper, both model-based and data-driven unsupervised learning methods are applied in classifying the packet arrival process of each user into high or low traffic states, so that we can design efficient bandwidth reservation schemes accordingly. However, when the traffic-state classification is inaccurate, it is very challenging to satisfy the ultra-high reliability requirement. To tackle this problem, we formulate an optimization problem to minimize the reserved bandwidth subject to the delay and reliability requirements by taking into account the classification errors. Simulation results show that the proposed methods can save 40%-70% bandwidth compared with the conventional method that is not aware of burstiness, while guaranteeing the delay and reliability requirements. Our results are further validated by the practical packet arrival processes acquired from experiments using a real tactile hardware device.

QCon: QoS-Aware Network Resource Management for Fog Computing.

Fog computing is a new computing paradigm that employs computation and network resources at the edge of a network to build small clouds, which perform as small data centers. In fog computing, lightweight virtualization (e.g., containers) has been widely used to achieve low overhead for performance-limited fog devices such as WiFi access points (APs) and set-top boxes. Unfortunately, containers have a weakness in the control of network bandwidth for outbound traffic, which poses a challenge to fog computing. Existing solutions for containers fail to achieve desirable network bandwidth control, which causes bandwidth-sensitive applications to suffer unacceptable network performance. In this paper, we propose qCon, which is a QoS-aware network resource management framework for containers to limit the rate of outbound traffic in fog computing. qCon aims to provide both proportional share scheduling and bandwidth shaping to satisfy various performance demands from containers while implementing a lightweight framework. For this purpose, qCon supports the following three scheduling policies that can be applied to containers simultaneously: proportional share scheduling, minimum bandwidth reservation, and maximum bandwidth limitation. For a lightweight implementation, qCon develops its own scheduling framework on the Linux bridge by interposing qCon’s scheduling interface on the frame processing function of the bridge. To show qCon’s effectiveness in a real fog computing environment, we implement qCon in a Docker container infrastructure on a performance-limited fog device—a Raspberry Pi 3 Model B board.

Calibers: A bandwidth calendaring paradigm for science workflows

Many scientific workflows require large data transfers between distributed instrument facilities, storage and computing resources. To ensure that these resources are maximally utilized, R&E networks connecting these resources must ensure that an inherently unpredictable network behaves predictably. In practice, this amounts to the per-application over-provisioning of network resources in an attempt to guarantee that adequate throughput is provided to users. This often results in resource under-utilization over time. One promising solution is the use of deadlines and bandwidth calendaring. In this approach, “fair” resource allocation is replaced with deadline-based resource allocation. However, these approaches often suffer from issues in efficiently regulating resource allocation and failure modes. Therefore, our solution, Calibers, approaches bandwidth calendaring and deadline-awareness in a different way. Calibers uses shaping, metering, and pacing at the edge of the network and end-system to provide participating clients the ability to schedule bandwidth reservations without having to worry about network noise from non-participating clients. Calibers can also fail back to the fair resource allocation of underlying transport protocols if necessary. For example, if a non-participating flow somehow enters the core of the network, or a sudden network change causes the available bandwidth to be exceeded, the underlying transport protocol congestion avoidance implementation will be able to handle the congestion as it normally would. Furthermore, Calibers provides a novel simulation method and resource allocation algorithm.In this paper, we present the prototype architecture for Calibers using a central controller with distributed agents to dynamically pace flows at the ingress of the network to meet deadlines. Using Globus/Grid-FTP, we experimentally demonstrate that pacing can be used to meet data transfer deadlines which cannot be achieved using TCP. Finally, we present dynamic flow pacing algorithms that maximize acceptance ratio of flows for which deadlines can be met while maximizing network utilization. Our results show that simple heuristics, optimizing locally on the most bottlenecked link, can perform almost as well as heuristics that attempt to optimize globally.

Optimizing Trade-Off Between Cost and Performance of Data Transfers Using Bandwidth Reservation in Dedicated Networks

Because of the solid performance of providing quality of service for various applications for decades, bandwidth reservation has been increasingly used in recent years for large amounts of data transfer to achieve guaranteed performance. However, effective scheduling strategy to achieve the trade-off between data transfer cost and data transfer performance still remains to be investigated. In this paper, we focus on the trade-off between cost and the most common performance parameter, i.e., completion time, of data transfers using bandwidth reservation in dedicated networks. We consider the scheduling of two types of bandwidth reservation requests regarding such trade-off: (1) to achieve the minimum data transfer cost given the data transfer deadline, and (2) to achieve the earliest data transfer completion time given the maximum data transfer cost. We propose two bandwidth reservation algorithms with rigorous optimality proofs to optimize the scheduling of these two types of bandwidth reservation requests. We then compare the proposed algorithms with two scheduling algorithms originating from one widely used scheduling algorithm in production networks, and the efficacy of the proposed optimal algorithms is verified through extensive simulations.

Function Allocation and Bandwidth Reservation for Mixed-critical Adaptive Software Systems

The new AutoSAR adaptive platform makes mixed-critical automotive systems able to adapt themselves in response to hardware and software failures at runtime. However, mapping functions of these automotive systems and reserving bandwidth for them are still major challenges. In this paper, we propose a model-based approach for mapping functions of an automotive system to its hardware nodes and reserving their bandwidth. To do so, an architecture description language for automotive systems (i.e. EAST-ADL) is used to design an embedded system, and to specify its timing requirements. The design model is then used for identifying functions allocation and their bandwidth in different system configurations. To schedule the critical functions of the system, the Earliest Deadline First (EDF) is used, while the Constant Bandwidth Server (CBS) is used for scheduling the non-critical functions. The quality of service for the non-critical functions is determined by their reserved bandwidth. In addition, a Tabu search-based approach is used for mapping the system functions to hardware nodes. Furthermore, there is a temporal isolation between the critical and non-critical functions. Thus, overruns of the non-critical functions do not affect the timing guarantees of the critical functions, and the quality of service for the non-critical functions is maximized.

IDaaS: Inter-Datacenter Network as a Service

Increasing number of Internet-scale applications, such as video streaming, incur huge amount of wide area traffic. Such traffic over the unreliable Internet without bandwidth guarantee suffers unpredictable network performance. This result, however, is unappealing to the application providers. Fortunately, Internet giants like Google and Microsoft are increasingly deploying their private wide area networks (WANs) to connect their global datacenters. Such high-speed private WANs are reliable, and can provide predictable network performance. In this paper, we propose a new type of service—inter-datacenter network as a service (iDaaS), where traditional application providers can reserve bandwidth from those Internet giants to guarantee their wide area traffic. Specifically, we design a bandwidth trading market among multiple iDaaS providers and application providers, and concentrate on the essential bandwidth pricing problem. The involved challenging issue is that the bandwidth price of each iDaaS provider is not only influenced by other iDaaS providers, but also affected by the application providers. To address this issue, we characterize the interaction between iDaaS providers and application providers using a Stackelberg game model, and analyze the existence and uniqueness of the equilibrium. We further present an efficient bandwidth pricing algorithm by blending the advantage of a geometrical Nash bargaining solution and the demand segmentation method. For comparison, we present two bandwidth reservation algorithms, where each iDaaS provider's bandwidth is reserved in a weighted fair manner and a max-min fair manner, respectively. Finally, we conduct comprehensive trace-driven experiments. The evaluation results show that our proposed algorithms not only ensure the revenue of iDaaS providers, but also provide bandwidth guarantee for application providers with lower bandwidth price per unit.