scholarly journals Combatting internet time shifters

2021 ◽  
Vol 10 (1) ◽  
pp. 8-11
Author(s):  
Michael Schapira
Keyword(s):  
Border Gateway Protocol ◽  
The Internet ◽  
Data Traffic ◽  
Internet Routing ◽  
Routing Security ◽  
Bank Of England

Combatting internet time shifters Arguably, the internet’s biggest security hole is the Border Gateway Protocol (BGP), which establishes routes between the organisational networks that make up the internet (e.g. Google, Facebook, Bank of England, Deutsche Telekom, AT&T). The insecurity of the internet’s routing system is constantly exploited to steal, monitor, and tamper with data traffic. Yet, despite many years of Herculean efforts, internet routing security remains a distant dream. The goal of the SIREN project is to propose and investigate novel paradigms for closing this security hole.

Implementasi BGP dan Resource Public Key Infrastructure menggunakan BIRD untuk Keamanan Routing

2021 ◽  
Vol 5 (6) ◽  
pp. 1161-1170
Author(s):  
Valen Brata Pranaya ◽  
Theophilus Wellem
Keyword(s):  
Autonomous Systems ◽  
Public Key Infrastructure ◽  
Digital Certificate ◽  
Public Key ◽  
The Internet ◽  
Certification Authority ◽  
Internet Routing ◽  
Internet Connectivity ◽  
Routing Security ◽  
Bgp Routing

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.  

scholarly journals Identifying Recurrence Behaviour in the Underlying BGP Traffic

2018 ◽  
Vol 4 (1) ◽  
pp. 34-47
Author(s):  
Bahaa Qasim Al-Musawi ◽  
Philip Branch
Keyword(s):  
Statistical Analysis ◽  
Routing Protocol ◽  
Autonomous Systems ◽  
Border Gateway Protocol ◽  
The Internet ◽  
Internet Routing ◽  
Periodic Behaviour ◽  
Linear And Nonlinear ◽  
The Stability

The Border Gateway Protocol (BGP) is an Internet routing protocol responsible for exchanging network reachability information between Autonomous Systems (ASes). Monitoring and mining BGP traffic are important aspects to understand and improve the stability of the Internet. However, identifying the characteristics of BGP traffic is much harder than it seems at a first glance where BGP traffic has been identified as complex, voluminous, and noisy. In this paper, we show that BGP traffic can be understood as an aggregation of oscillations of different frequencies from different ASes. Using linear and nonlinear statistical analysis, we show that BGP traffic shows recurrent behaviour. The source of this behaviour is unsynchronised periodic behaviour from a set of ASes.

scholarly journals Realtime Data Traffic Analyser Locomotive of Big Data Analytics

2020 ◽  
Vol 8 (6) ◽  
pp. 5643-5646
Keyword(s):  
Communication Networks ◽  
Data Storage ◽  
Communication Systems ◽  
Mean Field ◽  
Big Data Analytics ◽  
The Internet ◽  
Data Traffic ◽  
Time Data ◽  
Storage Security ◽  
Internet Users

Since last decade, the exponential growth of the internet users and the size of data over the internet is increasing day by day, which lead to increase the complexity of the systems by implementing policies and security to avoid attacks on systems and networks. It is very important to understand and analyses the real time data traffic of the communication systems. The purpose of this paper to design a customized Java based application which enables analysts to capture the traffic at the bottleneck under the mean field communication environment where a large number of devices are communicating with each other. The sending data for further processing for analysis the trend to overcome vulnerabilities or to manage the effectiveness of the communication systems. The proposed application enables to capture 8 different types of protocol traffic such as HTTP, HTTPS, SMTP, UDP, TCP, ICMP and POP3. The application allows for analysis of the incoming/outgoing traffic in the visual to understand the nature of communication networks which lead to improve the performance of the networks with respect to hardware, software, data storage, security and reliability.

APT

Fog Computing ◽  
2018 ◽  
pp. 158-182
Author(s):  
Dan Jen ◽  
Michael Meisel ◽  
Daniel Massey ◽  
Lan Wang ◽  
Beichuan Zhang ◽  
...  
Keyword(s):  
Performance Evaluation ◽  
Service Providers ◽  
The Internet ◽  
Global Routing ◽  
Internet Routing ◽  
Internet Address ◽  
Routing Table ◽  
The Cost ◽  
Edge Networks ◽  
Extensive Performance

The global routing system has seen a rapid increase in table size and routing changes in recent years, mostly driven by the growth of edge networks. This growth reflects two major limitations in the current architecture: (a) the conflict between provider-based addressing and edge networks' need for multihoming, and (b) flat routing's inability to provide isolation from edge dynamics. In order to address these limitations, we propose A Practical Tunneling Architecture (APT), a routing architecture that enables the Internet routing system to scale independently from edge growth. APT partitions the Internet address space in two, one for the transit core and one for edge networks, allowing edge addresses to be removed from the routing table in the transit core. Packets between edge networks are tunneled through the transit core. In order to automatically tunnel the packets, APT provides a mapping service between edge addresses and the addresses of their transit-core attachment points. We conducted an extensive performance evaluation of APT using trace data collected from routers at two major service providers. Our results show that APT can tunnel packets through the transit core by incurring extra delay on up to 0.8% of all packets at the cost of introducing only one or a few new or repurposed devices per AS.

Auto-Scaling in the Cloud Environment

2020 ◽  
pp. 84-98
Author(s):  
Ravindra Kumar Singh Rajput ◽  
Dinesh Goyal
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
The Internet ◽  
Data Traffic ◽  
Cloud Environment ◽  
Software Application ◽  
Workload Balancing ◽  
Specific Configuration ◽  
Using Data ◽  
Auto Scaling

Every software application has its own minimum set of requirements like CPU, storage, memory, networking, and power. These have to be integrated into a specific configuration to allow the smooth functioning of the software application. When data traffic becomes higher than expected, higher resources are required. There may not be enough time to provision new resources manually; in such cases, an auto-scaling system is required for managing these situations. Cloud computing means using data, programs, and other resources pooled in the data center and accessed through the internet instead of the user's computer. In the chapter, the authors discussed some aspects related to cloud computing like cloud workload, load balancing, load balancing algorithms, scaling techniques, and auto-scaling to fulfill cloud workload balancing requirements.

scholarly journals Reducing convergence time along with improvement in path service quality of border gateway protocol

2018 ◽  
Vol 7 (2.31) ◽  
pp. 203
Author(s):  
Arushi Agarwal ◽  
Ayushi Pandey
Keyword(s):  
Quality Of Service ◽  
Service Quality ◽  
Routing Protocol ◽  
Autonomous Systems ◽  
Border Gateway Protocol ◽  
Convergence Time ◽  
The Internet ◽  
Bgp Routing

Border Gateway Protocol (BGP) is an exterior gateway routing protocol used between various autonomous systems across the internet. BGP helps in selecting the best route for the transmission of data among the users. The transmission policy followed by BGP should be such that it should increase BGP routing performances. This work aims to reduce the convergence time of the network with the improvement of QOS (Quality of Service) in the routing of Border Gateway Protocol. Our results show that we can obtain a reduced framework environment which has a best routing path with better energy and quality, along with reduction in convergence time. 

scholarly journals RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC

2008 ◽  
Vol 22 (4) ◽  
pp. 519-536 ◽  
Author(s):  
Kostia Avrachenkov ◽  
Uri Yechiali
Keyword(s):  
Analytic Solution ◽  
Data Flow ◽  
Transmission Control Protocol ◽  
Network Models ◽  
Retrial Queues ◽  
The Internet ◽  
Data Traffic ◽  
Finite Buffers ◽  
Internet Routers ◽  
Tcp Connections

Data on the Internet is sent by packets that go through a network of routers. A router drops packets either when its buffer is full or when it uses the Active Queue Management. Currently, the majority of the Internet routers use a simple Drop Tail strategy. The rate at which a user injects the data into the network is determined by transmission control protocol (TCP). However, most connections in the Internet consist only of few packets, and TCP does not really have an opportunity to adjust the sending rate. Thus, the data flow generated by short TCP connections appears to be some uncontrolled stochastic process. In the present work we try to describe the interaction of the data flow generated by short TCP connections with a network of finite buffers. The framework of retrial queues and networks seems to be an adequate approach for this problem. The effect of packet retransmission becomes essential when the network congestion level is high. We consider several benchmark retrial network models. In some particular cases, an explicit analytic solution is possible. If the analytic solution is not available or too entangled, we suggest using a fixed-point approximation scheme. In particular, we consider a network of one or two tandem M/M/1/K-type queues with blocking and with an M/M/1/∞-type retrial (orbit) queue. We explicitly solve the models with particular choices of K, derive stability conditions for K≥1, and present several graphs based on numerical results.

Sign in / Sign up

Export Citation Format

Share Document