Interplay of ICP and IXP over the Internet with power-law features

2018 ◽  
Vol 29 (01) ◽  
pp. 1850001
Author(s):  
Zhongyan Fan ◽  
Wallace Kit-Sang Tang

The Internet is the largest artificial network consisting of billions of IP devices, managed by tens of thousands of autonomous systems (ASes). Due to its importance, the Internet has received much attention and its topological features, mainly in AS-level, have been widely explored from the complex network perspective. However, most of the previous studies assume a homogeneous model in which nodes are indistinguishable in nature. It may be good for a general study of topological structure, but unfortunately it fails to reflect the functionality. The Internet ecology is in fact heterogeneous and highly complex. It consists of various elements such as Internet Exchange Points (IXPs), Internet Content Providers (ICPs), and normal Autonomous System (ASes), realizing different roles in the Internet. In this paper, we propose level-structured network models for investigating how ICP performs under the AS-topology with power-law features and how IXP enhances its performance from a complex network perspective. Based on real data, our results reveal that the power-law nature of the Internet facilitates content delivery not only in efficiency but also in path redundancy. Moreover, the proposed multi-level framework is able to clearly illustrate the significant benefits gained by ICP from IXP peerings.

2013 ◽  
Vol 10 (2) ◽  
pp. 611-631 ◽  
Author(s):  
Jinjing Zhao ◽  
Yan Wen

The inter-domain routing system based on the BGP protocol is a kernel establishment in the Internet. There have been many incidents of IP prefix hijacking by BGP protocol in the Internet. Attacks may hijack victim's address space to disrupt network services or perpetrate malicious activities such as spamming and DoS attacks without disclosing identity. The relation between prefix hijacking and the Internet hierarchy is presented in this paper. The Internet is classified into three tiers based on the power-law and commercial relations of autonomous systems. The relation between network topology and prefix hijacking influence is presented for all sorts of hijacking events in different layers. The results assert that the hierarchical nature of network influences the prefix hijacking greatly.


2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Xia Zhu ◽  
Weidong Song ◽  
Lin Gao

Rural traffic network (RTN), as a complex network, plays a significant role in the field of resisting natural disasters and emergencies. In this paper, we analyze the vulnerability of RTN via three traffic network models (i.e., No-power Traffic Network Model (NTNM), Distance Weight Traffic Network Model (DWTNM), and Road Level Weight Traffic Network Model (RLWTNM)). Firstly, based on the complex network theory, RTN is constructed by using road mapping method, according to the topological features. Secondly, Random Attack (RA) and Deliberate Attack (DA) strategies are used to analyze network vulnerability in three rural traffic network models. By analyzing the attack tolerance of RTN under the condition of different attack patterns, we find that the road level weight traffic network has a good performance to represent the vulnerability of RTN.


2021 ◽  
pp. 1063293X2110031
Author(s):  
Maolin Yang ◽  
Auwal H Abubakar ◽  
Pingyu Jiang

Social manufacturing is characterized by its capability of utilizing socialized manufacturing resources to achieve value adding. Recently, a new type of social manufacturing pattern emerges and shows potential for core factories to improve their limited manufacturing capabilities by utilizing the resources from outside socialized manufacturing resource communities. However, the core factories need to analyze the resource characteristics of the socialized resource communities before making operation plans, and this is challenging due to the unaffiliated and self-driven characteristics of the resource providers in socialized resource communities. In this paper, a deep learning and complex network based approach is established to address this challenge by using socialized designer community for demonstration. Firstly, convolutional neural network models are trained to identify the design resource characteristics of each socialized designer in designer community according to the interaction texts posted by the socialized designer on internet platforms. During the process, an iterative dataset labelling method is established to reduce the time cost for training set labelling. Secondly, complex networks are used to model the design resource characteristics of the community according to the resource characteristics of all the socialized designers in the community. Two real communities from RepRap 3D printer project are used as case study.


2002 ◽  
Vol 7 (1) ◽  
pp. 9-25 ◽  
Author(s):  
Moses Boudourides ◽  
Gerasimos Antypas

In this paper we are presenting a simple simulation of the Internet World-Wide Web, where one observes the appearance of web pages belonging to different web sites, covering a number of different thematic topics and possessing links to other web pages. The goal of our simulation is to reproduce the form of the observed World-Wide Web and of its growth, using a small number of simple assumptions. In our simulation, existing web pages may generate new ones as follows: First, each web page is equipped with a topic concerning its contents. Second, links between web pages are established according to common topics. Next, new web pages may be randomly generated and subsequently they might be equipped with a topic and be assigned to web sites. By repeated iterations of these rules, our simulation appears to exhibit the observed structure of the World-Wide Web and, in particular, a power law type of growth. In order to visualise the network of web pages, we have followed N. Gilbert's (1997) methodology of scientometric simulation, assuming that web pages can be represented by points in the plane. Furthermore, the simulated graph is found to possess the property of small worlds, as it is the case with a large number of other complex networks.


2021 ◽  
Vol 11 (22) ◽  
pp. 11034
Author(s):  
Evgeny Nikulchev ◽  
Alexander Gusev ◽  
Dmitry Ilin ◽  
Nurziya Gazanova ◽  
Sergey Malykh

Web surveys are very popular in the Internet space. Web surveys are widely incorporated for gathering customer opinion about Internet services, for sociological and psychological research, and as part of the knowledge testing systems in electronic learning. When conducting web surveys, one of the issues to consider is the respondents’ authenticity throughout the entire survey process. We took 20,000 responses to an online questionnaire as experimental data. The survey took about 45 min on average. We did not take into account the given answers; we only considered the response time to the first question on each page of the survey interface, that is, only the users’ reaction time was taken into account. Data analysis showed that respondents get used to the interface elements and want to finish a long survey as soon as possible, which leads to quicker reactions. Based on the data, we built two neural network models that identify the records in which the respondent’s authenticity was violated or the respondent acted as a random clicker. The amount of data allows us to conclude that the identified dependencies are widely applicable.


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