An official website of the United States government
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.
more »
« less
Physical-layer impairment estimation for random bandwidth traffic
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.
more »
« less
- Award ID(s):
- 1718130
- PAR ID:
- 10486700
- Publisher / Repository:
- Optical Society of America
- Date Published:
- Journal Name:
- Journal of Optical Communications and Networking
- Volume:
- 16
- Issue:
- 2
- ISSN:
- 1943-0620; JOCNBB
- Format(s):
- Medium: X Size: Article No. 104
- Size(s):
- Article No. 104
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In long-haul fiber-optic networks, precise modeling of physical-layer impairments (PLIs) is crucial to optimizing network resource usage while ensuring adequate transmission quality. In order to accurately estimate PLIs, many mathematical models have been proposed. Among them, the so-called Gaussian noise (GN) model is one of the most accurate and simple enough to use on complex continental-size networks. However, the closed-form GN model assumes that the signals can be represented as having rectangular spectra, leading to a significant estimation error in typical cases when this assumption is violated. We propose the component-wise Gaussian noise (CWGN) PLI model that can account for arbitrary spectral-shaped demands. The CWGN model is computationally simple and suitable for most network management approaches. Results indicate that the CWGN model can prevent as much as a 136% overestimation of the PLIs resulting from the closed-form GN model applied to network lightpaths containing cascaded filters.more » « less
-
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
-
Garcia-Alfaro, J; Kozik, R; Choraś, M; Katsikas, S (Ed.)Several prominent privacy regulation (e.g., CCPA and GDPR) require service providers to let consumers request access to, correct, or delete, their personal data. Compliance necessitates verification of consumer identity. This is not a problem for consumers who already have an account with a service provider since they can authenticate themselves via a successful account log-in. However, there are no such methods for accountless consumers, even though service providers routinely collect data about casual consumers, i.e., those without accounts. Currently, in order to access their collected data, accountless consumers are asked to provide Personally Identifiable Information (PII) to service providers, which is privacy-invasive. To address this problem, we propose PIVA: Privacy-Preserving Identity Verification for Accountless Users, a technique based on Private List Intersection (PLI) and its variants. First, we introduce PLI, a close relative of private set intersection (PSI), a well-known cryptographic primitive that allows two or more mutually suspicious parties to compute the intersection of their private input sets. PLI takes advantage of the (ordered and fixed) list structure of each party’s private set. As a result, PLI is more efficient than PSI. We also explore PLI variants: PLI-cardinality (PLI-CA), threshold-PLI (t-PLI), and threshold-PLI-cardinality (t-PLI-CA), all of which yield less information than PLI. These variants are progressively better suited for addressing the accountless consumer authentication problem. We prototype and compare its performance against techniques based on regular PSI and garbled circuits (GCs). Results show that proposed PLI and PLI-CA constructions are more efficient than GC-based techniques, in terms of both computation and communication overheads. While GC-based t-PLI and t-PLI-CA execute faster, proposed constructs greatly outperform the former in terms of bandwidth, e.g., our t-PLI protocol consumes less bandwidth. We also show that proposed protocols can be made secure against malicious adversaries, with only moderate increases in overhead. These variants outperform their GC-based counterparts by at least one order of magnitude.more » « less
-
null (Ed.)Efficient provisioning of 5G network slices is a major challenge for 5G network slicing technology. Previous slice provisioning methods have only considered network resource attributes and ignored network topology attributes. These methods may result in a decrease in the slice acceptance ratio and the slice provisioning revenue. To address these issues, we propose a two-stage heuristic slice provisioning algorithm, called RT-CSP, for the 5G core network by jointly considering network resource attributes and topology attributes in this paper. The first stage of our method is called the slice node provisioning stage, in which we propose an approach to scoring and ranking nodes using network resource attributes (i.e., CPU capacity and bandwidth) and topology attributes (i.e., degree centrality and closeness centrality). Slice nodes are then provisioned according to the node ranking results. In the second stage, called the slice link provisioning stage, the k-shortest path algorithm is implemented to provision slice links. To further improve the performance of RT-CSP, we propose RT-CSP+, which uses our designed strategy, called minMaxBWUtilHops, to select the best physical path to host the slice link. The strategy minimizes the product of the maximum link bandwidth utilization of the candidate physical path and the number of hops in it to avoid creating bottlenecks in the physical path and reduce the bandwidth cost. Using extensive simulations, we compared our results with those of the state-of-the-art algorithms. The experimental results show that our algorithms increase slice acceptance ratio and improve the provisioning revenue-to-cost ratio.more » « less
