The authors propose and evaluate the performance of a dynamic bandwidth allocation algorithm, namely burst-by-bUrst dynamic bandwidth allocation (BUDA), which enables the fair and efficient utilisation of the available upstream resources in 10-Gigabit-capable passive optical networks (XG-PONs). The proposed algorithm emulates a bit-by-bit burst multiplexing process based on the fair queuing scheduling principle to fairly allocate the available upstream bandwidth among several end-users with varying traffic demands. The fair queuing approach is well-suited to the strictly synchronous communication model of XG-PONs, where fixed duration downstream and upstream frames are utilised to delineate transmissions, and the authors demonstrate via simulations that BUDA achieves low and bounded latency, as well as resource allocation fairness over a set of different traffic loads. Furthermore, BUDA is compared with well-known bandwidth allocation algorithms and a significant latency and fairness benefit is demonstrated.

Fibre wireless (FiWi) access networks constitute a promising candidate to meet the demanding challenges of the modern bandwidth-hungry services and applications. Due to the dynamic nature of the network traffic in access domains, the bandwidth allocation process has to provide a fair and effective coordination between the users including an efficient quality-of-service (QoS) plan. However, the majority of the bandwidth allocation schemes neglect the measured QoS parameters, such as latency, jitter, and packet loss. In addition, the fairness issue is not always taken into account. As a result, the packet delivery of sensitive data streams is often problematic and the QoS guarantees are not addressed or even totally ignored. In this study, the authors present a novel bandwidth allocation policy which applies an efficient weighted-based, QoS-aware schedule in modern FiWi networks with fairness support. The innovation behind the proposed scheme lies in the direct association of the measured QoS parameters with the applied fair bandwidth allocation process.

Distance adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilisation by tailoring the modulation format to the level of impairments along the path. The authors first show that the distance-adaptive routing and spectrum assignment (DA-RSA) problem is a special case of a multiprocessor scheduling problem. The authors then develop a suite of efficient and effective DA-RSA algorithms for ring networks, that build upon list scheduling concepts. This work explores the tradeoffs involved in DA-RSA algorithm design, and opens up new research directions that may leverage the vast literature in scheduling theory.

The standardisation of the 10 GB-capable passive optical network (XG-PON) system is accompanied by a rigorous set of recommendations. Power reduction in XG-PONs is considered a quite important topic by the telecommunication standardisation sector (ITU-T), thus, with importance of energy saving, XG-PON recommendation describes power management processes in detail. The core power management process comprises distinct states representing the desired power management transitions, while two modes: namely, the doze and the cyclic sleep mode, are defined. This study provides an analytical model for power consumption computation of an optical network unit (ONU), assuming that the two modes are enabled in the ONU operation. The presented analytical findings are verified by conducting extensive simulation experiments. Concurrently, the average time spent on doze and cyclic sleep states is provided.