• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >From Shortest-Path to All-Path: The Routing Continuum Theory and Its Applications
【24h】

From Shortest-Path to All-Path: The Routing Continuum Theory and Its Applications

机译：从最短路径到全路径：路由连续体理论及其应用

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

摘要

As a crucial operation, routing plays an important role in various communication networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”) routing have been developed. Existing results in the literature show that the shortest path and all-path routing can be obtained from $L_{1}$ and $L_{2}$ flow optimization, respectively. Based on this connection between routing and flow optimization in a network, in this paper we develop a unifying theoretical framework by considering flow optimization with mixed (weighted) $L_{1}/L_{2}$-norms. We obtain a surprising result: as we vary the trade-off parameter $theta$, the routing graphs induced by the optimal flow solutions span from shortest-path to multi-path to all-path routing—this entire sequence of routing graphs is referred to as the routing continuum. We also develop an efficient iterative algorithm for computing the entire routing continuum. Several generalizations are also considered, with applications to traffic engineering, wireless sensor networks, and network robustness analysis.
机译：作为一项至关重要的操作，路由在各种通信网络中起着重要的作用。在数据和传感器网络的背景下，已经开发了诸如最短路径，多路径和基于电位（“全路径”）的路由策略。文献中的现有结果表明，最短路径和全路径路由可以分别从$ L_ {1} $和$ L_ {2} $流量优化中获得。基于网络中路由和流量优化之间的这种联系，本文通过考虑混合（加权）$ L_ {1} / L_ {2} $范数的流量优化，开发了一个统一的理论框架。我们得到一个令人惊讶的结果：随着我们权衡参数$ theta $的变化，由最佳流解决方案引起的路由图从最短路径到多路径再到全路径路由，整个路由图序列被引用以作为路由连续体。我们还开发了一种有效的迭代算法来计算整个路由连续体。还考虑了几种概括，并将其应用于流量工程，无线传感器网络和网络鲁棒性分析。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号