• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >New models and algorithms for future networks
【24h】

New models and algorithms for future networks

机译：未来网络的新模型和算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In future networks, transmission and switching capacity will dominate processing capacity. The authors investigate the way in which distributed algorithms should be changed in order to operate efficiently in this new environment. They introduce a class of new models for distributed algorithms which make explicit the difference between switching and processing. Based on these new models they define new message and time complexity measures which, they believe, capture the costs in many high-speed networks more accurately then traditional measures. In order to explore the consequences of the new models, they examine three problems in distributed computation. For the problem of maintaining network topology they devise a broadcast algorithm which takes O(n) messages and O(log n) time for a single broadcast in the new measure. For the problem of leader election they present a simple algorithm that uses O(n) messages and O(n) time. The third problem, distributed computation of a "globally sensitive" function, demonstrates some important features and tradeoffs in the new models and emphasizes and differences with the traditional network model. The results of the present paper influenced later research, as well as the design of IBM Networking Broadband Services (NBBS).
机译：在未来的网络中，传输和交换能力将主导处理能力。作者研究了更改分布式算法以在这种新环境中有效运行的方式。他们为分布式算法引入了一类新模型，这些模型明确表明了切换和处理之间的区别。他们基于这些新模型定义了新的消息和时间复杂性度量，他们认为，与传统度量相比，它们可以更准确地捕获许多高速网络中的成本。为了探索新模型的后果，他们研究了分布式计算中的三个问题。对于维护网络拓扑的问题，他们设计了一种广播算法，该算法在新措施中对单个广播采用O（n）消息和O（log n）时间。对于领导人选举的问题，他们提出了一种使用O（n）消息和O（n）时间的简单算法。第三个问题是“全局敏感”函数的分布式计算，展示了新模型中的一些重要功能和折衷，并强调了与传统网络模型的区别。本文的结果影响了后来的研究，以及IBM网络宽带服务（NBBS）的设计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号