分层最短路径问题(特邀论文)

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-03-18 DOI:10.1109/COMSNETS.2010.5432000

Timothy G. Griffin

{"title":"分层最短路径问题(特邀论文)","authors":"Timothy G. Griffin","doi":"10.1109/COMSNETS.2010.5432000","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"The Stratified Shortest-Paths Problem (invited paper)\",\"authors\":\"Timothy G. Griffin\",\"doi\":\"10.1109/COMSNETS.2010.5432000\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":369006,\"journal\":{\"name\":\"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2010.5432000\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2010.5432000","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

在过去的十年里，很明显，一些互联网路由协议不计算全局最优路径，而只计算局部最优路径。在关于数据网络路由协议的大量文献中，这代表了一些相当新颖的东西。本文介绍了分层最短路径问题，作为探索局部最优性问题和全局最优性问题之间界限的工具。这篇论文包含了所使用的代数概念的教程概述。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Stratified Shortest-Paths Problem (invited paper)

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)

自引率

0.00%

发文量