Internet Routing and Non-monotonic Reasoning

Author(s):  
Anduo Wang ◽  
Zhijia Chen
Keyword(s):  
Author(s):  
Holly Esquivel ◽  
Chitra Muthukrishnan ◽  
Aditya Akella ◽  
Shuchi Chawla
Keyword(s):  

2005 ◽  
Vol 35 (5) ◽  
pp. 55-66 ◽  
Author(s):  
Jun Li ◽  
Dejing Dou ◽  
Zhen Wu ◽  
Shiwoong Kim ◽  
Vikash Agarwal
Keyword(s):  

2007 ◽  
Vol 9 (4) ◽  
pp. 350-355 ◽  
Author(s):  
Feng Wang ◽  
Lixin Gao

2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Chunxiu Li ◽  
Xin Li ◽  
Ke Li ◽  
Jiafu Huang ◽  
Zhansheng Feng ◽  
...  

Large-scale deployments of mission-critical services have led to stringent demands on Internet routing, but frequently occurring network failures can dramatically degrade the network performance. However, Border Gateway Protocol (BGP) can not react quickly to recover from them. Although extensive research has been conducted to deal with the problem, the multiple failure scenarios have never been properly addressed due to the limit of distributed control plane. In this paper, we propose a local fast reroute approach to effectively recover from multiple link failures in one administrative domain. The principle of Software Defined Networking (SDN) is used to achieve the software defined AS-level fast rerouting. Considering AS relationships, efficient algorithms are proposed to automatically and dynamically find protection paths for multiple link failures; then OpenFlow forwarding rules are installed on routers to provide data forwarding continuity. Our approach is able to ensure applicability to ASes with flexibility and adaptability to multiple link failures, contributing toward improving the network performance. Through experimental results, we show that our proposal provides effective failure recovery and does not introduce significant control overhead to the network.


2003 ◽  
Vol 17 (1) ◽  
pp. 18-49 ◽  
Author(s):  
Walid Ben-Ameur ◽  
Eric Gourdin
Keyword(s):  

2018 ◽  
Vol 133 ◽  
pp. 183-194 ◽  
Author(s):  
Jessie Hui Wang ◽  
Changqing An
Keyword(s):  

2021 ◽  
Vol 5 (6) ◽  
pp. 1161-1170
Author(s):  
Valen Brata Pranaya ◽  
Theophilus Wellem

The validity of the routing advertisements sent by one router to another is essential for Internet connectivity. To perform routing exchanges between Autonomous Systems (AS) on the Internet, a protocol known as the Border Gateway Protocol (BGP) is used. One of the most common attacks on routers running BGP is prefix hijacking. This attack aims to disrupt connections between AS and divert routing to destinations that are not appropriate for crimes, such as fraud and data breach. One of the methods developed to prevent prefix hijacking is the Resource Public Key Infrastructure (RPKI). RPKI is a public key infrastructure (PKI) developed for BGP routing security on the Internet and can be used by routers to validate routing advertisements sent by their BGP peers. RPKI utilizes a digital certificate issued by the Certification Authority (CA) to validate the subnet in a routing advertisement. This study aims to implement BGP and RPKI using the Bird Internet Routing Daemon (BIRD). Simulation and implementation are carried out using the GNS3 simulator and a server that acts as the RPKI validator. Experiments were conducted using 4 AS, 7 routers, 1 server for BIRD, and 1 server for validators, and there were 26 invalid or unknown subnets advertised by 2 routers in the simulated topology. The experiment results show that the router can successfully validated the routing advertisement received from its BGP peer using RPKI. All invalid and unknown subnets are not forwarded to other routers in the AS where they are located such that route hijacking is prevented.  


Sign in / Sign up

Export Citation Format

Share Document