A bandwidth allocation scheme for compositional real-time systems with periodic resources

Internet of Things (IoT) has played a tremendous change in the Information Technology (IT) environments, and thus its importance has also been realized within Intelligent Home Networks (IHNs). IHNs ensure comfort, safety, healthcare, automation, energy conservation, and remote management to devices and users. However, we have realized that more advanced devices and services continue to be introduced and used in IHNs. This has led to competitions of the limited available network resources, services, and bandwidth. In this paper, we propose a Novel Dynamic Bandwidth Allocation (NoDBA) algorithm to deal with bandwidth management and allocation. The algorithm integrates two algorithms, namely; Offline Cooperative Algorithm (OCA) and Particle Swarm Optimization (PSO). PSO defines the priority limits for subnets and nodes in the network. Meanwhile, OCA facilitates dynamic bandwidth allocation in the network. Network Simulator-2 (NS-2) was used to simulate and evaluate NoDBA and showed improved results compared to the traditional bandwidth allocation algorithm.

A faster FPTAS for knapsack problem with cardinality constraint

Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models

Heterogeneous networks (HetNets) composed of macrocells and small cells are expected to improve the transmission performance of users significantly. Designing efficient resource allocation schemes, specifically, bandwidth allocation and power allocation schemes for HetNets is of particular importance for it may affect user quality of service (QoS) and network performance severely. In this paper, we consider the resource allocation problem of a HetNet composed of a macrocell and a number of femtocells and propose a resource characteristic and user QoS oriented bandwidth and power allocation algorithm for the femto base stations (FBSs) which share spectrum with the macro base station. By taking into account the service requirements of the femto user equipments (FUEs) and the bandwidth resource characteristics of the network, various bandwidth resource allocation schemes are proposed. Particularly, in the case of slightly insufficient bandwidth resource, we propose a bankruptcy game based bandwidth resource allocation algorithm for the FBSs, and solve the bandwidth allocation problem by means of Shapley value method. To stress the tradeoff between data rate and power consumption, we examine the energy efficiency of the FBSs and formulate the power allocation problem as a multi-objective optimization problem with the objectives of maximizing the energy efficiency of all the FBSs. The optimal power allocation strategy can be obtained by solving the optimization problem via ideal point method and generic algorithm. Simulation results demonstrate the efficiency of the proposed algorithm.

To date, the mainstream ethernet passive optical network (EPON) bandwidth allocation schemes as well as the new IEEE 802.3ah Ethernet in the first mile Task Force specifications have been centralized, relying on a component in the central office [optical line termination (OLT)] to provision upstream traffic. Hence, the OLT is the only device that can arbitrate time-division access to the shared channel. Since the OLT has global knowledge of the state of the entire network, this is a centralized control plane in which the OLT has centralized intelligence. This paper proposes novel distributed EPON architectures, and in the process proves that these distributed networking architectures and the associated bandwidth allocation algorithms and protocols have characteristics that make them far better suited for provisioning quality of service (QoS) schemes necessary for properly handling data, voice, video, and other real-time streaming advanced multimedia services over a single line. Specifically, this paper proposes a novel ethernet over star coupler-based PON architecture that uses a fully distributed time-division multiple-access (TDMA) arbitration scheme. Supported by the decentralized scheme, this paper proposes several QoS-based dynamic bandwidth allocation (DBA) algorithms in which the OLT is excluded from the implementation of the time slot assignment. In contrast with the mainstream centralized EPON architectures that combine priority queuing [intra-optical network unit (ONU) scheduling] with DBA schemes (inter-ONU scheduling), the proposed distributed EPON architecture supports differentiated services through the integration of both scheduling mechanisms at the ONU (intra-ONU scheduling). The introduction of this integration feature that can only be supported by a decentralized architecture provides better QoS guarantees. Furthermore, in addition to the added flexibility and reliability, the overall performance of the proposed decentralized EPON architecture and the associated bandwidth allocation algorithms are shown to be at least as efficient as their centralized counterparts.

Wavelength division multiplexing/time division multiplexing (WDM/TDM) passive optical networks (PON) is being viewed as a promising solution for delivering multiple services and applications. The hybrid WDM / TDM PON uses the wavelength and bandwidth allocation strategy to control the distribution of the wavelength channels in the uplink direction, so that it can ensure the high bandwidth requirements of multiple Optical Network Units (ONUs) while improving the wavelength resource utilization. Through the investigation of the presented dynamic bandwidth allocation algorithms, these algorithms can't satisfy the requirements of different levels of service very well while adapting to the structural characteristics of mixed WDM / TDM PON system. This paper introduces a novel wavelength and bandwidth allocation algorithm to efficiently utilize the bandwidth and support QoS (Quality of Service) guarantees in WDM/TDM PON. Two priority based polling subcycles are introduced in order to increase system efficiency and improve system performance. The fixed priority polling subcycle and dynamic priority polling subcycle follow different principles to implement wavelength and bandwidth allocation according to the priority of different levels of service. A simulation was conducted to study the performance of the priority based polling in dynamic resource allocation algorithm in WDM/TDM PON. The results show that the performance of delay-sensitive services is greatly improved without degrading QoS guarantees for other services. Compared with the traditional dynamic bandwidth allocation algorithms, this algorithm can meet bandwidth needs of different priority traffic class, achieve low loss rate performance, and ensure real-time of high priority traffic class in terms of overall traffic on the network.

#NFA refers to the problem of counting the words of length n accepted by a non-deterministic finite automaton. #NFA is #P-hard, and although fully-polynomial-time randomized approximation schemes (FPRAS) exist, they are all impractical. The first FPRAS for #NFA had a running time of Õ(n 17 m 17 ε -14 łog(δ -1 )), where m is the number of states in the automaton, δ ∈ (0,1] is the confidence parameter, and ε > 0 is the tolerance parameter (typically smaller than 1). The current best FPRAS achieved a significant improvement in the time complexity relative to the first FPRAS and obtained FPRAS with time complexity Õ((n 10 m 2 + n 6 m 3 )ε -4 łog 2 (δ -1 )). The complexity of the improved FPRAS is still too intimidating to attempt any practical implementation. In this paper, we pursue the quest for practical FPRAS for #NFA by presenting a new algorithm with a time complexity of O(n 2 m 3 łog(nm)ε -2 łog(δ -1 )). Observe that evaluating whether a word of length n is accepted by an NFA has a time complexity of O(nm 2 ). Therefore, our proposed FPRAS achieves sub-quadratic complexity with respect to membership checks.

The progressive adaptability of today’s mobile communication services and the prompt progressions in the mobile phones industry have steered to a remarkable development in the wireless market capacity. Notwithstanding the incessant advancement in the radio access technologies to manage with that growth. However, many remaining challenges, i.e., inefficient allocation and management of wireless network resources in Heterogeneous Wireless Networks (HWNs) when using the modern cellular mobile communications radio access technologies such as Wireless Local Area Network (WLAN)/Wi-Fi, Long-TERA Evolution (LTE) and Fifth Generation (5G)) still continue and needs to be addressed. This problem emanates from the enormous number of users sharing these resources, random distribution of wireless channels, scarceness of the wireless spectral resources, and the dynamic behavior of generated traffic. Therefore, this paper solves the identified problem by designing an Efficient Resource Allocation (ERA) algorithm to address the inefficient allocation of available resources versus quality of service (QoS) challenges. The obtained simulation results demonstrate the effectiveness of the proposed model to meet the objectives subject to limitations and constraints compared to other published works. On average, the proposed ERA algorithm, Joint Power Bandwidth Allocation (JPBA) algorithm, and Dynamic Bandwidth Allocation (DBA) algorithm have shown 98.9%, 85%, 81% throughput performance, respectively at a time interval of 100s.

A survey of dynamic bandwidth allocation algorithms for Ethernet Passive Optical Networks

Resource allocation is a fundamental task in any PON and it is necessary to have an efficient scheme that reduces delay, maximizes bandwidth usage, and minimizes the resource wastage. A variety of dynamic bandwidth allocation (DBA) and dynamic wavelength and bandwidth allocation (DWBA) algorithms have been proposed which are based on different PONs (e.g., EPON, GPON, XG-PON, 10G EPON, etc.). But to our knowledge, no DWBA scheme for NG-PON2 system, with diverse customers and prioritized traffic, has been proposed yet. In this work, this problem is addressed and five different dynamic wavelength and bandwidth allocation (DWBA) schemes are proposed. First, mixed integer linear programming (MILP) models are developed to minimize the total delay of the high-priority data. Due to the MILP’s high computational complexity, heuristic algorithms are developed based on the MILP model insights. The five heuristic algorithms are: No Block-Split Heuristic (NBH), Equal Block-Split Heuristic (EBH), Priority-Based No Block-Split Heuristic (P-NBH), Priority-Based Equal Block-Split Heuristic (P-EBH), and Priority-Based Decider Block-Split Heuristic (P-DBH). Six priority classes of requests are introduced with the goal of minimizing the total delay for the high-priority data and to lessen the bandwidth wastage of the system. Finally, experiments for the performance evaluation of the five DWBA schemes are conducted. The results indicate that P-NBH, P-EBH, P-DBH schemes show a 47.63% less delay and 30% of less bandwidth wastage on average for the highest priority data transmission than the schemes without priority support (NBH and EBH). Among these five schemes, NBH method has the highest delay, whereas EBH and P-EBH waste more bandwidth than the other schemes. P-DBH is the most efficient among the five, because this scheme offers the lowest delay for high-priority data and the minimum bandwidth wastage for lower priority ones.

Approximation algorithms for fractional knapsack problems

With the drastic increase of space information network (SIN) traffic and the diversity of network traffic types, the optimal allocation of the scarce network resources is of great significance for optimizing the SIN system capability. In this paper, we propose a multi-resource management method for multi-tier SIN using the cooperative Nash bargaining solution. Since the original problem is a non-convex problem, we firstly make logarithmic transition, and then find a tightest lower bound function to convert the initial problem into a convex one. In order to carry out the optimal bandwidth and power allocation in SIN, we construct a joint bandwidth and power allocation (JBPA) algorithm. Simulation results show the performance improvement of the JBPA scheme and the convergence of JBPA algorithm.

In this era of optical communication, the passive optical network (PON) having multiple optical line terminals (multi-OLT) will play a vital role for both the data and voice communications of multiple service providers. For downstream data transmission of multi-OLT PON, the existing algorithms are not effective to allocate bandwidth among different service providers. Because, the existing scheme does not provide fairness in sharing of downstream bandwidth. This paper proposes a new downstream bandwidth allocation scheme for multi-OLT PON system called fair and weight-based bandwidth allocation (FWBA) algorithm. In the proposed scheme, we have considered a multi-OLT PON system for convergence of cable television, fiber-to-the-home, wireless sensor, and femto networks. The performances of the FWBA scheme have been analyzed on the basis of transmission delay, idle-time as well as traffic handling capacity. The comparative analysis of simulation results show that the FWBA scheme performs better than non-weight-based DBA (NWBA) scheme.

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.

This paper presents a dynamic bandwidth allocation scheme for multiple services in heterogeneous networks. A utility function is introduced first, whose parameters are determined by the modified multi-state Analytic Hierarchy Process (AHP) which adapts to different load levels according to dynamic thresholds. Based on this, a bandwidth allocation algorithm is proposed for Constant Bit Rate (CBR) and Variable Bit Rate (VBR) services depending on not only utility fairness among different networks, but also the fairness between new arrival and ongoing services. Simulation results show that the proposed algorithm is effective in guaranteeing both the fairness of the edge users and the network system performance, i.e. keeping low block probability in the wireless network system.