通过PING代理改进恢复机制提高互联网协议的弹性

Radwan S. Abujassar
{"title":"通过PING代理改进恢复机制提高互联网协议的弹性","authors":"Radwan S. Abujassar","doi":"10.18178/JACN.2016.4.2.221","DOIUrl":null,"url":null,"abstract":" Abstract —The recovery algorithms in the network lead to reduce deliver data time between source and destination by interoperate between layer 2 and layer 3. We created three topologies and each topology has a different number of links and nodes. The algorithm mechanism is to make the source node re-route the packets when failure occurs in a new path through an adjacent node. Hence, the source node will send the packet to one of the adjacent nodes, which has chosen randomly. This node will use a different path, which does not affected by the failure of the destination node. In addition, is not necessary that this secondary path be the shortest to make recovery time faster. (When the source node re-routes the packet directly to the adjacent node the routing protocol in the source node will update the routing table and re-compute the secondary shortest first","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resilience of the Internet Protocol by Improving the Recovery Mechanism via PING Agent\",\"authors\":\"Radwan S. Abujassar\",\"doi\":\"10.18178/JACN.2016.4.2.221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\" Abstract —The recovery algorithms in the network lead to reduce deliver data time between source and destination by interoperate between layer 2 and layer 3. We created three topologies and each topology has a different number of links and nodes. The algorithm mechanism is to make the source node re-route the packets when failure occurs in a new path through an adjacent node. Hence, the source node will send the packet to one of the adjacent nodes, which has chosen randomly. This node will use a different path, which does not affected by the failure of the destination node. In addition, is not necessary that this secondary path be the shortest to make recovery time faster. (When the source node re-routes the packet directly to the adjacent node the routing protocol in the source node will update the routing table and re-compute the secondary shortest first\",\"PeriodicalId\":232851,\"journal\":{\"name\":\"Journal of Advances in Computer Networks\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advances in Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18178/JACN.2016.4.2.221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advances in Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18178/JACN.2016.4.2.221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

摘要-网络中的恢复算法通过二层和三层之间的互操作,减少了源端和目的端之间的数据传输时间。我们创建了三个拓扑,每个拓扑都有不同数量的链接和节点。算法机制是当经过相邻节点的新路径发生故障时,源节点重新路由报文。因此,源节点将数据包发送到随机选择的相邻节点之一。该节点将使用不同的路径,不受目标节点故障的影响。此外,为了使恢复时间更快,该辅助路径不一定是最短的。当源节点将报文直接重路由到相邻节点时,源节点的路由协议将更新路由表,并首先重新计算次最短路由
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resilience of the Internet Protocol by Improving the Recovery Mechanism via PING Agent
 Abstract —The recovery algorithms in the network lead to reduce deliver data time between source and destination by interoperate between layer 2 and layer 3. We created three topologies and each topology has a different number of links and nodes. The algorithm mechanism is to make the source node re-route the packets when failure occurs in a new path through an adjacent node. Hence, the source node will send the packet to one of the adjacent nodes, which has chosen randomly. This node will use a different path, which does not affected by the failure of the destination node. In addition, is not necessary that this secondary path be the shortest to make recovery time faster. (When the source node re-routes the packet directly to the adjacent node the routing protocol in the source node will update the routing table and re-compute the secondary shortest first
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信