一种自稳定最快路径路由算法

Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI:10.1109/PCCC.1994.504123

A. Datta, B. Bourgon

{"title":"一种自稳定最快路径路由算法","authors":"A. Datta, B. Bourgon","doi":"10.1109/PCCC.1994.504123","DOIUrl":null,"url":null,"abstract":"This paper presents a self-stabilized algorithm for the quickest path problem. This algorithm will guarantee that an asynchronous distributed system will in finite t ime have an all-pairs quickest path routing table at each node i n finite t ime. Also, the system can handle node additions/deletions/perturbations without permanent eflects on the system.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Self-Stabilizing Quickest Path Routing Algorithm\",\"authors\":\"A. Datta, B. Bourgon\",\"doi\":\"10.1109/PCCC.1994.504123\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a self-stabilized algorithm for the quickest path problem. This algorithm will guarantee that an asynchronous distributed system will in finite t ime have an all-pairs quickest path routing table at each node i n finite t ime. Also, the system can handle node additions/deletions/perturbations without permanent eflects on the system.\",\"PeriodicalId\":203232,\"journal\":{\"name\":\"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1994.504123\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1994.504123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种求解最快路径问题的自稳定算法。该算法将保证异步分布式系统在有限的t时间内，在有限的t时间内，在每个节点上都有一个全对最快路径路由表。此外，系统可以处理节点的添加/删除/扰动，而不会对系统产生永久性影响。

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

查看原文本刊更多论文

A Self-Stabilizing Quickest Path Routing Algorithm

This paper presents a self-stabilized algorithm for the quickest path problem. This algorithm will guarantee that an asynchronous distributed system will in finite t ime have an all-pairs quickest path routing table at each node i n finite t ime. Also, the system can handle node additions/deletions/perturbations without permanent eflects on the system.

求助全文

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

来源期刊

Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications

自引率

0.00%

发文量