从自稳定到自优化:分布式网络设计原理

S. Schmid
{"title":"从自稳定到自优化:分布式网络设计原理","authors":"S. Schmid","doi":"10.1145/3212734.3212801","DOIUrl":null,"url":null,"abstract":"The tutorial provides an overview of the principles and \"pearls'' of constructing, maintaining and optimizing network topologies, such as peer-to-peer overlays or datacenter interconnects. The tutorial consists of two parts: Self-stabilization: In the first part, we start simple by discussing basic mechanisms to reconfigure networks while maintaining connectivity. You will then learn how to design and analyze self-stabilizing algorithms for line topologies as well as more sophisticated networks such as hypercubes. A self-stabilizing algorithm guarantees that the network will automatically reconfigure to a \"good topology\" from an arbitrary initial state. Self-optimization: After we have learned how to design self-stabilizing networks, we will consider algorithms to design self-adjusting resp. \"self-optimizing\" networks: networks which not only \"repair\" themselves but also optimize themselves towards the demand. The study of such self-adjusting networks is motivated by emerging technologies in the context of datacenters and wide-area networks, allowing to reconfigure networks at runtime.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"From Self-Stabilization to Self-Optimization: Principles of Distributed Network Design\",\"authors\":\"S. Schmid\",\"doi\":\"10.1145/3212734.3212801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The tutorial provides an overview of the principles and \\\"pearls'' of constructing, maintaining and optimizing network topologies, such as peer-to-peer overlays or datacenter interconnects. The tutorial consists of two parts: Self-stabilization: In the first part, we start simple by discussing basic mechanisms to reconfigure networks while maintaining connectivity. You will then learn how to design and analyze self-stabilizing algorithms for line topologies as well as more sophisticated networks such as hypercubes. A self-stabilizing algorithm guarantees that the network will automatically reconfigure to a \\\"good topology\\\" from an arbitrary initial state. Self-optimization: After we have learned how to design self-stabilizing networks, we will consider algorithms to design self-adjusting resp. \\\"self-optimizing\\\" networks: networks which not only \\\"repair\\\" themselves but also optimize themselves towards the demand. The study of such self-adjusting networks is motivated by emerging technologies in the context of datacenters and wide-area networks, allowing to reconfigure networks at runtime.\",\"PeriodicalId\":198284,\"journal\":{\"name\":\"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3212734.3212801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3212734.3212801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本教程概述了构建、维护和优化网络拓扑(如点对点覆盖或数据中心互连)的原则和“要点”。本教程由两个部分组成:自稳定:在第一部分中,我们从简单的开始,讨论在保持连接的同时重新配置网络的基本机制。然后,您将学习如何设计和分析线拓扑以及更复杂的网络(如超立方体)的自稳定算法。自稳定算法保证网络将从任意初始状态自动重新配置为“良好拓扑”。自优化:在学习了如何设计自稳定网络之后,我们将考虑设计自调整响应的算法。“自优化”网络:既能“修复”自身,又能根据需求进行自我优化的网络。这种自我调整网络的研究是由数据中心和广域网背景下的新兴技术推动的,允许在运行时重新配置网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
From Self-Stabilization to Self-Optimization: Principles of Distributed Network Design
The tutorial provides an overview of the principles and "pearls'' of constructing, maintaining and optimizing network topologies, such as peer-to-peer overlays or datacenter interconnects. The tutorial consists of two parts: Self-stabilization: In the first part, we start simple by discussing basic mechanisms to reconfigure networks while maintaining connectivity. You will then learn how to design and analyze self-stabilizing algorithms for line topologies as well as more sophisticated networks such as hypercubes. A self-stabilizing algorithm guarantees that the network will automatically reconfigure to a "good topology" from an arbitrary initial state. Self-optimization: After we have learned how to design self-stabilizing networks, we will consider algorithms to design self-adjusting resp. "self-optimizing" networks: networks which not only "repair" themselves but also optimize themselves towards the demand. The study of such self-adjusting networks is motivated by emerging technologies in the context of datacenters and wide-area networks, allowing to reconfigure networks at runtime.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Tutorial: Consistency Choices in Modern Distributed Systems Locking Timestamps versus Locking Objects Recoverable Mutual Exclusion Under System-Wide Failures Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory Brief Announcement: Beeping a Time-Optimal Leader Election
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1