Flexible grid networks need rigorous resource planning to avoid network over-dimensioning and resource over-provisioning. The network must provision the hardware and spectrum resources statically, even for dynamic random bandwidth demands, due to the infrastructure of flexible grid networks, hardware limitations, and reconfiguration speed of the control plane. We propose a flexible online–offline probabilistic (FOOP) algorithm for the static spectrum assignment of random bandwidth demands. The FOOP algorithm considers the probabilistic nature of random bandwidth demands and balances hardware and control plane pressures with spectrum assignment efficiency. The FOOP algorithm uses the probabilistic spectrum Gaussian noise (PSGN) model to estimate the physical-layer impairment (PLI) for random bandwidth traffic. Compared to a benchmark spectrum assignment algorithm and a widely applied PLI estimation model, the proposed FOOP algorithm using the PSGN model saves up to 49% of network resources.
Static resource allocation for dynamic traffic
A flexible offline probabilistic (FOP) algorithm is designed to aggressively accommodate random bandwidth traffic demands in long-haul networks. Compared to algorithms that configure demands according to their maximum bandwidth, the FOP algorithm can save 15% of the spectrum used, accommodating over 99% of the throughput demand.
more »
« less
- Award ID(s):
- 1718130
- NSF-PAR ID:
- 10166484
- Date Published:
- Journal Name:
- Proceedings of the 45th European Conference on Optical Communication
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
-
When scheduling multi-mode real-time systems on multi-core platforms, a key question is how to dynamically adjust shared resources, such as cache and memory bandwidth, when resource demands change, without jeopardizing schedulability during mode changes. This paper presents Omni, a first end-to-end solution to this problem. Omni consists of a novel multi-mode resource allocation algorithm and a resource-aware schedulability test that supports general mode-change semantics as well as dynamic cache and bandwidth resource allocation. Omni's resource allocation leverages the platform's concurrency and the diversity of the tasks' demands to minimize overload during mode transitions; it does so by intelligently co-distributing tasks and resources across cores. Omni's schedulability test ensures predictable mode transitions, and it takes into account mode-change effects on the resource demands on different cores, so as to best match their dynamic needs using the available resources. We have implemented a prototype of Omni, and we have evaluated it using randomly generated multi-mode systems with several real-world benchmarks as the workload. Our results show that Omni has low overhead, and that it is substantially more effective in improving schedulability than the state of the artmore » « less
-
The emergence of diverse network applications demands more flexible and responsive resource allocation for networks. Network slicing is a key enabling technology that provides each network service with a tailored set of network resources to satisfy specific service requirements. The focus of this paper is the network slicing of access networks realized by Passive Optical Networks (PONs). This paper proposes a learning-based Dynamic Bandwidth Allocation (DBA) algorithm for PON access networks, considering slice-awareness, demand-responsiveness, and allocation fairness. Our online convex optimization-based algorithm learns the implicit traffic trend over time and determines the most robust window allocation that reduces the average latency. Our simulation results indicate that the proposed algorithm reduces the average latency by prioritizing delay-sensitive and heavily-loaded ONUs while guaranteeing a minimal window allocation to all ONUs.more » « less
-
more » « less
Traffic demands in future elastic optical networks are expected to be heterogeneous with time-varying bandwidth. Estimating the physical-layer impairments (PLIs) for random bandwidth demands is important for cross-layer network resource provisioning. State-of-the-art PLI estimation techniques yield conservative PLI estimates using the maximum bandwidth, which leads to significant over-provisioning. This paper uses probabilistic information on random bandwidth demands to provide a computationally efficient, accurate, and flexible PLI estimate. The proposed model is consistent with the needs of future self-configuring fiber-optic networks and maximally avoids up to a 25% overestimation of PLIs compared to the benchmark for the cases studied, thus reducing the network design margin at a negligible extra computational cost.
-
The increasing demands to enhance information security in data transmission, providing countermeasures against jamming in military applications, as well as boosting data capacity in mobile and satellite communication, have led to a critical need for high-speed frequency-hopping systems. Conventional electronics-based frequency-hopping systems suffer from low data rate, low hopping speed, and narrow hopping-frequency bandwidth. Unfortunately, those are important aspects to facilitate frequency-hopping in emerging microwave systems. The recent advancement of microwave photonics—the use of light to process microwave signals—provides promising solutions to tackle the challenges faced by electronic frequency-hopping systems. In this paper, the challenges of achieving real-time frequency-hopping systems are examined. The operation principles and results of various microwave photonics-enabled frequency-hopping systems are comprehensively discussed, which have wide hopping-frequency bandwidth and frequency-hopping speed from nanoseconds to tens of picoseconds. Lastly, a bio-inspired jamming-avoidance system that could potentially be used for adaptive frequency-hopping is also introduced.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
