×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.

Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Click here to flash read.

We study how to reduce the reconfiguration time in hybrid optical-electrical
Datacenter Networks (DCNs). With a layer of Optical Circuit Switches (OCSes),
hybrid optical-electrical DCNs can reconfigure its logical topologies to better
match the on-going traffic patterns, but the reconfiguration time may directly
affect the benefits of reconfigurability. The reconfiguration time consists of
the topology solver running time and the network convergence time after
triggering reconfiguration. However, existing topology solvers either incur
high algorithmic complexity or fail to minimize the reconfiguration overhead.


In this paper, we propose a novel algorithm that combines the ideas of
bipartition and Minimum Cost Flow (MCF) to reduce the overall reconfiguration
time. For the first time, we formulate the topology solving problem as a MCF
problem with piecewise-linear cost, which strikes a better balance between
solver complexity and solution optimality. Our evaluation shows that our
algorithm can significantly reduce the network convergence time while consuming
less topology solver running time, making its overall performance superior to
existing algorithms. Our code and test cases are available at a public
repository.

Click here to read this post out
ID: 625610; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: Dec. 20, 2023, 7:31 a.m. Changes:
Dictionaries:
Words:
Spaces:
Views: 9
CC:
No creative common's license
Comments: