Search Results

Documents authored by Avin, Chen

Document
Brief Announcement
DOI: 10.4230/LIPIcs.DISC.2019.35
Brief Announcement: On Self-Adjusting Skip List Networks

Authors: Chen Avin, Iosif Salem, and Stefan Schmid

Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)

Abstract
This paper explores the design of dynamic network topologies which adjust to the workload they serve, in an online manner. Such self-adjusting networks (SANs) are enabled by emerging optical technologies, and can be found, e.g., in datacenters. SANs can be used to reduce routing costs by moving frequently communicating nodes topologically closer. This paper presents SANs which provide, for the first time, provable working set guarantees: the routing cost between node pairs is proportional to how recently these nodes communicated last time. Our SANs rely on skip lists (which serve as the topology) and provide additional interesting properties such as local routing.
Cite as

Chen Avin, Iosif Salem, and Stefan Schmid. Brief Announcement: On Self-Adjusting Skip List Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 35:1-35:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{avin_et_al:LIPIcs.DISC.2019.35,
  author =	{Avin, Chen and Salem, Iosif and Schmid, Stefan},
  title =	{{Brief Announcement: On Self-Adjusting Skip List Networks}},
  booktitle =	{33rd International Symposium on Distributed Computing (DISC 2019)},
  pages =	{35:1--35:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-126-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{146},
  editor =	{Suomela, Jukka},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.35},
  URN =		{urn:nbn:de:0030-drops-113423},
  doi =		{10.4230/LIPIcs.DISC.2019.35},
  annote =	{Keywords: self-adjusting networks, skip lists, working set, online algorithms}
}
Document
DOI: 10.4230/LIPIcs.DISC.2017.5
Demand-Aware Network Designs of Bounded Degree

Authors: Chen Avin, Kaushik Mondal, and Stefan Schmid

Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)

Abstract
Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and traffic patterns which they serve. This insight led to the development of demand-aware datacenter interconnects which can be reconfigured depending on the workload. Motivated by these trends, this paper initiates the algorithmic study of demand-aware networks (DANs), and in particular the design of bounded-degree networks. The inputs to the network design problem are a discrete communication request distribution, D, defined over communicating pairs from the node set V, and a bound, d, on the maximum degree. In turn, our objective is to design an (undirected) demand-aware network N = (V,E) of bounded-degree d, which provides short routing paths between frequently communicating nodes distributed across N. In particular, the designed network should minimize the expected path length on N (with respect to D), which is a basic measure of the efficiency of the network. We show that this fundamental network design problem exhibits interesting connections to several classic combinatorial problems and to information theory. We derive a general lower bound based on the entropy of the communication pattern D, and present asymptotically optimal network-aware design algorithms for important distribution families, such as sparse distributions and distributions of locally bounded doubling dimensions.
Cite as

Chen Avin, Kaushik Mondal, and Stefan Schmid. Demand-Aware Network Designs of Bounded Degree. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{avin_et_al:LIPIcs.DISC.2017.5,
  author =	{Avin, Chen and Mondal, Kaushik and Schmid, Stefan},
  title =	{{Demand-Aware Network Designs of Bounded Degree}},
  booktitle =	{31st International Symposium on Distributed Computing (DISC 2017)},
  pages =	{5:1--5:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-053-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{91},
  editor =	{Richa, Andr\'{e}a},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.5},
  URN =		{urn:nbn:de:0030-drops-80153},
  doi =		{10.4230/LIPIcs.DISC.2017.5},
  annote =	{Keywords: Network design, reconfigurable networks, datacenter topology, peer-topeer computing, entropy, sparse spanners}
}
Document
Brief Announcement
DOI: 10.4230/LIPIcs.DISC.2017.58
Brief Announcement: Distributed SplayNets

Authors: Bruna S. Peres, Olga Goussevskaia, Stefan Schmid, and Chen Avin

Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)

Abstract
SplayNets are reconfigurable networks which adjust to the communication pattern over time. We present DiSplayNets, a distributed (concurrent and decentralized) implementation of SplayNets.
Cite as

Bruna S. Peres, Olga Goussevskaia, Stefan Schmid, and Chen Avin. Brief Announcement: Distributed SplayNets. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 58:1-58:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{peres_et_al:LIPIcs.DISC.2017.58,
  author =	{Peres, Bruna S. and Goussevskaia, Olga and Schmid, Stefan and Avin, Chen},
  title =	{{Brief Announcement: Distributed SplayNets}},
  booktitle =	{31st International Symposium on Distributed Computing (DISC 2017)},
  pages =	{58:1--58:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-053-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{91},
  editor =	{Richa, Andr\'{e}a},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.58},
  URN =		{urn:nbn:de:0030-drops-79661},
  doi =		{10.4230/LIPIcs.DISC.2017.58},
  annote =	{Keywords: Decentralization, Concurrency, Reconfigurable Networks}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact