SearcharxivSearch

arXiv · 1912.05481

LightFDG: An Integrated Approach to Flow Detection and Grooming in Optical Wireless DCNs

Abstract

LightFDG is an integrated approach to flow detection (FD) and flow grooming (FG) in optical wireless data center networks (DCNs), which is interconnected via wavelength division multiplexing (WDM) based free-space optical (FSO) links. Since forwarding bandwidth-hungry elephant flows (EFs) and delay-sensitive mice flows (MFs) on the same path can cause severe performance degradation, the LightFDG optically grooms flows of each class into rack-to-rack (R2R) flows. Then, R2R-MF and R2R-EF flows are separately forwarded over lightpaths of separate MF and EF virtual topologies, respectively. Lightpaths are provisioned by jointly determining the capacity and route based on flows' arrival rate, size, and completion time request. To prevent EFs from congesting the MF lightpaths, high speed and accurate flow-detection mechanisms are also necessary for classifying EFs as soon as possible. Therefore, a fast-lightweight-and-accurate flow detection framework is developed by leveraging the transmission control protocol (TCP) behaviors. The proposed FD scheme has the flexibility of being implemented as in-network or centralized to classify flows of modifiable and unmodifiable hosts, respectively. Since the centralized scheme incurs considerable overhead, the processing and communication overhead is also mitigated by proposed techniques. Numerical results show that LightFDG outperforms traditional load balancers by about 3x for EFs and 10x for MFs. Along with the developed overhead mitigation methods, the centralized scheme is shown to provide up to 62x lower overhead with 100% accuracy and with about 224x higher detection speeds than the existing centralized solutions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amer AlGhadhban, Abdulkadir Celik, Basem Shihada, Mohamed-Slim Alouini. 2019-12-11. LightFDG: An Integrated Approach to Flow Detection and Grooming in Optical Wireless DCNs. https://arxiv.org/abs/1912.05481

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Message-Level Scheduling for RLNC-Coded Multi-Source Traffic

This paper studies weighted decoding-delay minimization for multiple RLNC-coded message streams that compete for finite processing capacity at a destination. Packet arrivals are exogenous, while the scheduler only determines the processing order of packets already available at the destination. A trace-conditioned offline scheduling formulation shows that a batch-release subclass is strongly NP-hard even with a single processing unit. Message-Aware Innovation-Deficit Scheduling (MAIDS) is then developed to prioritize each serviceable message according to its weight and remaining decoding deficit. For a single processing unit, MAIDS is shown to be exactly optimal under nonblocking progressive arrivals with equal weights and under common activation with arbitrary positive weights, while the unrestricted weighted online problem admits no universal deterministic $O(1)$ competitive ratio. Simulation results on streaming and batch benchmarks show that MAIDS consistently reduces weighted decoding delay relative to the tested baselines, remains close to the offline optimum on average, and recovers the predicted exact performance boundaries.

cs.NI

The Towers Were Standing: A Cause Decomposition of Cellular Outages During Hurricane Helene

Hurricane Helene produced the largest absolute cell-site outage in the public FCC record, peaking at 4562 sites. The conventional model is physical: towers destroyed. Helene did destroy over 1700 miles of fibre, but almost none of it was cell sites. We present the first cause-decomposed study of the FCC's Disaster Information Reporting System, reconstructing 80 state-days and 580 county-days from 24 daily filings by two reconciled independent extractions. Damage to cell sites is negligible: 1.1% of attributed cell-site-days across six states, at most 3.8% anywhere. The sites were standing. What took them out divides by terrain: pooled, power dominates at 63.2%, but in mountainous North Carolina severed transport (backhaul) reaches 52.2% against 47.3%, and in Tennessee 69.9%. North Carolina's transport share rises from 7.0% to 85.0% across the event (\r{ho} = 0.92). Seventeen days after landfall, on 15 October, 47 sites lost transport across six contiguous North Carolina counties with no rainfall, no power loss, no damage, and recovery by the next report. Independent active-probe measurement corroborates it: responsive /24s fall 1.02% for twelve hours while Tennessee stays flat. We release the dataset. Backup power is the standard resilience investment; here it addresses the smaller half of the problem.

cs.NI

terms.txt: A Consent and Compensation Protocol for Agentic Web Access

The open web ran on an unwritten bargain: sites admitted crawlers, and search engines sent visitors back. Public measurements show that bargain breaking under AI crawlers and agents. Automated clients now make up most requests, training dominates Cloudflare-classified crawling, and the largest AI platforms fetch thousands of pages for each visitor they return. The web's common control, robots.txt, cannot express identity, purpose, terms, or price, can be circumvented, and newer alternatives are largely proprietary CDN features. We specify terms.txt, a robots.txt-style file for per-path, per-purpose machine-access terms, plus an origin-enforced exchange using Web Bot Auth signatures, signed intent, delegation tokens, HTTP 402 negotiation, and signed receipts. We define what the exchange can enforce, audit, and leave to contract. A dependency-free implementation adds 0.20 to 0.65 ms per request on one vCPU.

cs.NI