arXiv Computer Science
arXiv Computer Science
Preprint
4 years ago

A Competitive B-Matching Algorithm for Reconfigurable Datacenter Networks. (arXiv:2006.10692v1 [cs.NI])

Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski, Stefan Schmid
This paper initiates the study of online algorithms for the maintaining a maximum weight b-matching problem, a generalization of maximum weight matching where each node has at most b > 0 adjacent matching edges. The problem is motivated by emerging optical technologies which allow to enhance datacenter networks with reconfigurable matchings, providing direct connectivity between frequently communicating racks. These additional links may improve network performance, by leveraging spatial and temporal structure in the workload. We show that the underlying algorithmic problem features an intriguing connection to online paging,but introduces a novel challenge. Our main contribution is an online algorithm which is O (b)-competitive; we also prove that this is asymptotically optimal. We complement our theoretical results with extensive trace-driven simulations, based on real-world datacenter workloads as well as synthetic traffic traces.

Publisher URL: http://arxiv.org/abs/2006.10692

DOI: arXiv:2006.10692v1

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.