{"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}
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