Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters

by   Janardhan Kulkarni, et al.

Reconfigurable optical topologies are emerging as a promising technology to improve the efficiency of datacenter networks. This paper considers the problem of scheduling opportunistic links in such reconfigurable datacenters. We study the online setting and aim to minimize flow completion times. The problem is a two-tier generalization of classic switch scheduling problems. We present a stable-matching algorithm which is 2· (2/ε+1)-competitive against an optimal offline algorithm, in a resource augmentation model: the online algorithm runs 2+ε times faster. Our algorithm and result are fairly general and allow for different link delays and also apply to hybrid topologies which combine fixed and reconfigurable links. Our analysis is based on LP relaxation and dual fitting.


page 1

page 2

page 3

page 4


Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks

New optical technologies offer the ability to reconfigure network topolo...

A Competitive B-Matching Algorithm for Reconfigurable Datacenter Networks

This paper initiates the study of online algorithms for the maintaining ...

Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks

The performance of large-scale computing systems often critically depend...

Bag-of-Tasks Scheduling on Related Machines

We consider online scheduling to minimize weighted completion time on re...

HyLine: a Simple and Practical Flow Scheduling for Commodity Datacenters

Today's datacenter networks (DCNs) have been built upon multipath topolo...

Optimal Job Scheduling and Bandwidth Augmentation in Hybrid Data Center Networks

Optimizing data transfers is critical for improving job performance in d...

Online B-Matchings for Reconfigurable Datacenters: The Power of Randomization

This paper studies the problem of how to dynamically optimize the topolo...