Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks

Cauligi S. Raghavendra; Mohammad Noormohammadpour

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1802.09080 v1 pith:7PHB6QYY submitted 2018-02-25 cs.NI cs.DCcs.PFcs.SYeess.SY

Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks

Mohammad Noormohammadpour , Cauligi S. Raghavendra This is my paper

classification cs.NI cs.DCcs.PFcs.SYeess.SY

keywords flowadaptivebandwidthcompletionflowsinter-datacenterleastnetworks

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

Inter-datacenter networks connect dozens of geographically dispersed datacenters and carry traffic flows with highly variable sizes and different classes. Adaptive flow routing can improve efficiency and performance by assigning paths to new flows according to network status and flow properties. A popular approach widely used for traffic engineering is based on current bandwidth utilization of links. We propose an alternative that reduces bandwidth usage by up to at least 50% and flow completion times by up to at least 40% across various scheduling policies and flow size distributions.

Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks

discussion (0)