The stratified shortest-paths problem
The stratified shortest-paths problem
复制标题
分层最短路径问题
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
T. Griffin
中科院分区：
文献类型：
--
作者：
T. Griffin
在过去的十年中，已经很明显，一些互联网路由协议不计算全局最优路径，但只有局部最优路径。这在数据网络路由协议的大量文献中是相当新颖的。本文介绍了分层最短路径问题作为一种工具，探索局部和全局最优问题之间的边界。该文件包含一个教程概述的代数概念使用。
In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.