کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6874208 | 1441029 | 2018 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
rDAN: Toward robust demand-aware network designs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: rDAN: Toward robust demand-aware network designs rDAN: Toward robust demand-aware network designs](/preview/png/6874208.png)
چکیده انگلیسی
We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., ProjecToR) and demand-aware peer-to-peer overlay networks (e.g., SplayNets). This paper introduces a formal framework and approach to reason about and design robust demand-aware networks (DAN). In particular, we establish a connection between the communication frequency of two nodes and the path length between them in the network, and show that this relationship depends on the entropy of the communication matrix. Our main contribution is a novel robust, yet sparse, family of networks, short rDANs, which guarantee an expected path length that is proportional to the entropy of the communication patterns.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 133, May 2018, Pages 5-9
Journal: Information Processing Letters - Volume 133, May 2018, Pages 5-9
نویسندگان
Chen Avin, Alexandr Hercules, Andreas Loukas, Stefan Schmid,