Internet Paths Research Articles

Multiwavelet based-approach to detect shared congestion in computer networks

Internet paths sharing the same congested link can be identified using several shared congestion detection techniques. The new detection technique which is proposed in this paper depends on the previous novel technique (delay correlation with wavelet denoising (DCW) with new denoising method called Discrete Multiwavelet Transform (DMWT) as signal denoising to separate between queuing delay caused by network congestion and delay caused by various other delay variations. The new detection technique provides faster convergence (3 to 5 seconds less than previous novel technique) while using fewer probe packets approximately half numbers than the previous novel technique, so it will reduce the overload on the network caused by probe packets. Thus, new detection technique will improve the overall performance of computer network.

Where is the Traffic Going? A Comparative Study of Clouds Following Different Designs

Cloud computing is critical for today's information society. In this paper, we shed light on two radically different cloud design philosophies: the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">DC-cloud</i> built around massive data centers, and the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ISP-cloud</i> built upon a large ISP. With extensive measurements on Alibaba, Tencent, and CTYun, we find that both designs have strengths and weaknesses: the ISP-cloud of CTYun has less inflated paths to users within the same ISP, but its paths to external users are more inflated comparing with the DC-clouds of Alibaba and Tencent. By analyzing the clouds’ routing policies, we reveal the reasons behind the path inflations: Alibaba and Tencent adopt an <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">early-exit</i> policy to use more inflated public Internet paths as early as possible; while CTYun follows a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">global and location-agnostic</i> policy to detour traffic to remote PoPs, leading to highly inflated paths. Based on the insights, we suggest alternative policies and averagely reduce 11.0% latency to 30.5% destinations for Alibaba, 9.8% latency to 18.6% destinations for Tencent, and 54.1% latency to external destinations for CTYun. The results suggest that both cloud designs have rooms for improvement, and an ISP-cloud has the potential to achieve a superior performance, thanks to its inherited advantages from the ISP infrastructure.

Multipath Congestion Control: Measurement, Analysis, and Optimization From the Energy Perspective

Multipath TCP (MPTCP) is a promising TCP extension that exploits different Internet paths between a pair of hosts to obtain high aggregate throughput, while it also brings the concern of energy consumption. There has been a lively interest in the design of energy-efficient MPTCP. The research community, however, lacks a comprehensive understanding of which components in an MPTCP congestion control algorithm play the fundamental role in energy efficiency, how various algorithms compare against each other from energy-consuming perspective, or whether there exist potentially better solutions for energy saving. This paper takes the first step towards answering these questions. Through realworld MPTCP Linux kernel experiments, we show that the energy consumption is related to three major aspects: average throughput, path delay and different network scenarios. In order to bridge congestion control to the three aspects, we analyze the existing algorithms and capture the essential parameters of multipath congestion control model related to energy efficiency. Then we propose a window increase factor to shift traffic to low-delay energy-efficient paths. To further extend this design, we apply an energy-aware compensative parameter to fit the general hierarchical Internet topology. Our evaluation indicates that the enhanced congestion control module can successfully improve MPTCP energy efficiency without affecting its transmission performance.

IMPLEMENTASI LOAD BALANCING METODE PER CONNECTION CLASSIFIER DAN FAILOVER RECURSIVE MENGGUNAKAN MIKROTIK

With the rapid development of technology, a company or agency must adapt systems that are evolving fast day by day. At PT Global Teknologi servisindo have problems faced with several problems due to complaints from employees who are constrained by a slow internet connection. Inadequate facilities such as devices to manage all internet connection systems and providers who are not yet able to accommodate the burden of internet lines. The implementation of load balancing with pcc and recursive failover methods enables internet connection and optimizes internet paths effectively. The device used is the Mikrotik RB1100ahx and to configure the load balancing and failover system using the Winbox software. The use of load balancing and failover can reduce internet paths so that there is no overload on the internet network. The results obtained by building a load balancing and failover system that maximizes internet connections properly and reduces overloads on internet lines, this proves that load balancing and failover are running well according to the configuration made.

Automatic generation of threat paths in internet of things‐based systems

Automatic generation of threat paths in internet of things‐based systems

News Hotspot Event Diffusion Mechanism Based on Complex Network

The wide range of social hot news events on the Internet has made the Internet have a great impact on the public. However, there are few studies on Internet information. In order to improve the efficiency of user network information dissemination of Internet information based on complex network theory and model simulation, this paper makes a more in-depth study on information dissemination on the Internet, constructs a complex network of Internet information dissemination, and analyzes the static topology and dynamic evolution process of the network. Using the attention relationship between Internet users, the Internet information dissemination network, degree, and path were used to select multiple indicators. The static topology of the network is analyzed by using the complex network theory. The study found that the complex network of Internet information is different from other complex networks. The influencing factors of network dynamic evolution are studied from three aspects: overall structure, local structure, and time constraints. The evolution trend of different forms and overall network nodes in the evolution process was explored, and the network dynamic evolution process model was constructed. Practice shows that the model can better describe the evolution process of network information dissemination in complex networks. The degree values of the two networks are positively correlated with the corresponding average clustering coefficients, and the networks have a significant hierarchy. The correlation between news hot events and network nodes is not as good as users’ attention to the network.

Measuring and Localising Congestion in Mobile Broadband Networks

Mobile broadband networks, although increasingly popular, suffer large fluctuations in performance. Download speeds can drop by 50&#x0025; or more during peak hours. Hence, understanding and dissecting the causes of these fluctuations is central to improving current and future networks. In this paper, we propose a congestion detection and localisation method, Q-TSLP, that combines and extends the two state-of-the-art congestion detection tools: Q-Probe and TSLP. Q-Probe monitors patterns in packet arrivals, while TSLP tracks shifts in RTT to detect bottleneck at different segments of an end-to-end path. QProbe can attribute congestion, at a very coarse level, to either radio or non-radio related. TSLP on the other hand cannot pinpoint radio related congestion. Q-TSLP provides a per-hop congestion attribution thus addressing these limitations. To this end, we build two small scale LTE testbeds and experiment with a series of congestion scenarios. These controlled experiments show that apart from correct congestion localisation to finer granularity, the detection accuracy improves significantly with Q-TSLP, up to 100&#x0025; in some cases. We then run a three-month long measurement campaign of congestion over two commercial operators in Norway. Overall, we run 17 million tests from a large number of geographically distributed probes. We find that both operators suffer congestion at different parts of the network. Our findings indicate that apart from mobile radio access, a non-trivial fraction of cases is related to congested mobile operator and Internet paths beyond the mobile network core. These findings hint that operators may need significant infrastructure upgrades to cope with potential 5G traffic volumes.

Estimation of most effected cycles and busiest network route based on complexity function of graph in fuzzy environment.

Connectivity and strength has a major role in the field of network connecting with real world life. Complexity function is one of these parameter which has manifold number of applications in molecular chemistry and the theory of network. Firstly, this paper introduces the thought of complexity function of fuzzy graph with its properties. Second, based on the highest and lowest load on a network system, the boundaries of complexity function of different types of fuzzy graphs are established. Third, the behavior of complexity function in fuzzy cycle, fuzzy tree and complete fuzzy graph are discussed with their properties. Fourth, applications of these thoughts are bestowed to identify the most effected COVID-19 cycles between some communicated countries using the concept of complexity function of fuzzy graph. Also the selection of the busiest network stations and connected internet paths can be done using the same concept in a graphical wireless network system.

On the usability of transport protocols other than TCP: A home gateway and internet path traversal study

Network APIs are moving towards protocol agility, where applications express their needs but not a static protocol binding, and it is up to the layer below the API to choose a suitable protocol. The IETF Transport Services (TAPS) Working Group is standardizing a protocol-independent transport API and offering guidance to implementers. Apple’s recent “Network.framework” is specifically designed to allow such late and dynamic binding of protocols. When the network stack autonomously chooses and configures a protocol, it must first test which protocols are locally available and which work end-to-end (“protocol racing”). For this, it is important to know the set of available options, and which protocols should be tried first: Does it make sense to offer unchecked payload delivery, as with UDP-Lite? Is a UDP-based protocol like QUIC always a better choice, or should native SCTP be tried? This paper develops answers to such questions via (i) a NAT study in a local testbed, (ii) bidirectional Internet tests, (iii) a large scale Internet measurement campaign. The examined protocols are: SCTP, DCCP, UDP-Lite, UDP with a zero checksum and three different UDP encapsulations.

Large-Scale Characterization and Segmentation of Internet Path Delays With Infinite HMMs

Round-Trip Times are one of the most commonly collected performance metrics in computer networks. Measurement platforms such as RIPE Atlas provide researchers and network operators with an unprecedented amount of historical Internet delay measurements. It would be very useful to process these measurements automatically (statistical characterization of path performance, change detection, recognition of recurring patterns, etc.). Humans are quite good at finding patterns in network measurements, but it can be difficult to automate this and enable many time series to be processed at the same time. In this article we introduce a new model, the HDP-HMM or infinite hidden Markov model, whose performance in trace segmentation is very close to human cognition. We demonstrate, on a labeled dataset and on RIPE Atlas and CAIDA MANIC data, that this model represents measured RTT time series much more accurately than classical mixture or hidden Markov models. This method is implemented in RIPE Atlas and we introduce the publicly accessible Web API. An interactive notebook for exploring the API is available on GitHub.

On the utility of unregulated IP DiffServ Code Point (DSCP) usage by end systems

DiffServ was designed to implement service provider quality of service (QoS) policies, where routers change and react upon the DiffServ Code Point (DSCP) in the IP header. However, nowadays, applications are beginning to directly set the DSCP themselves, in the hope that this will yield a more appropriate service for their respective video, audio and data streams. WebRTC is a prime example of such an application. We present measurements, for both IPv4 and IPv6, of what happens to DSCP values along Internet paths after an end system has set them without any prior agreement between a customer and a service provider. We find that the DSCP is often changed or zeroed along the path, but detrimental effects from using the DSCP are extremely rare; moreover, DSCP values sometimes remain intact (potentially having an effect on traffic) for several AS hops. This positive result motivates an analysis of the potential latency impact from such DSCP usage, for which we present the first measurement results. We find that routers at approximately 3% of more than 100,000 links differentiate between the WebRTC DSCP values (EF, AF42 and CS1) and consistently reduce delay in comparison with probes carrying a zero value (CS0) under congestion. In contrast, routers at around 2% of these links increase the delay by a comparable amount under congestion, uniformly for EF, AF42 and CS1.

Investigating Characteristics of Internet Paths

Interactive and multimedia applications depend on the stability of end-to-end paths for predictable performance and good quality of service. On the other hand, network providers depend on multiple paths to ensure fault tolerance and use load balancing between these paths to enhance the overall network throughput. In this study, we analyze path dynamics for both end-to-end paths and path segments within service providers’ networks using 2 months of measurement data from the RIPE Atlas platform, which collects path traces between a fixed set of source and destination pairs every 15 minutes. We observe that 78% of the end-to-end routes have at least two alternative Autonomous System (AS) paths with some end-to-end routes going through hundreds of different AS paths during the 2 months of analysis. While AS level paths are often prevalent for a day, there are considerable changes in the routing of the trace packets over the ASes for a longer duration of a month or longer. Analyzing end-to-end paths for routing anomalies, we observe that 4.4% of the path traces (involving 18% of the ASes) contain routing loops indicating misconfiguration of routers. Some of the ASes had over 100 routers involved in loops in path traces through their networks. We observe a much higher rate of anomalies in the AS level, with 45% of path traces containing an AS loop. Additionally, we discovered that few of the ASes bounce-back packets where some traces through their network traverse routers in both forward and backward directions. Determining path segments belonging to each AS, we further explore ingress to egress paths of ASes in addition to the source to destination paths within the AS. Analyzing trace segments between ingresses and egresses of an AS, we realized more than half of the ASes have the same router level path between any ingress-egress pair for the 2 months, but others implement load balancing. These results are different from earlier studies that indicated a high level of path dynamism. Our results indicate that the end-to-end path dynamism is due to the Border Gateway Protocol level rather than the router level within ASes.

Secure and Lightweight Subflow Establishment of Multipath-TCP

Multipath Transmission Control Protocol (MPTCP) is an approach towards high-throughput and efficient load balancing over multiple paths. Each of paths forms a TCP connection with an IP address, and those can be implemented as multiple network interfaces or multiple ports within a network interface. In this paper, we focus on the multiple network interfaces environment. Each network interface with an IP address is called as a subflow. A subflow is a TCP connection which can have a different internet path identified by IP addresses of source and destination network interfaces. To control these multiple subflows, MPTCP supports many options. Specifically, to establish a new subflow, MPTCP uses an <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> option. A host sends <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> option to inform another host of its IP address, and then, the host receiving <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> option tries to establish a subflow at the address of <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> option. However, by forging the <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> option, an attacker can create a fake subflow that passes through itself and eventually hijack the connection between both end hosts. In a previous study, Hash-based Message Authentication (HMAC) was added to the <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> option, preventing it from being forged. Nevertheless, since the keys for generating HMAC can be leaked during three-way handshake, a variant of the <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> attack called the persistent <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> attack can be possible. To this end, we propose a protocol that can prevent the <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> attacks by backward confirmation of the <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ADD_ADDR</monospace> option without encryption. The main idea of our proposal is to apply a digital signature scheme for the backward confirmation. We show security analysis for the proposed protocol and compare with the previous studies in terms of time/space overheads.

Using RIPE Atlas for Geolocating IP Infrastructure

The vast majority of studies on IP geolocation focuses on localizing the end-users, and little attention has been devoted to localizing the elements of the Internet infrastructure, i.e., the routers and servers that make the Internet work. In this paper, we study the maximum theoretical accuracy that can be achieved by a geolocation approach aimed at geolocating the Internet infrastructure. In particular, we study the effects on localization accuracy produced by the position of landmarks and by the strategy followed for their enrollment. We compare two main approaches: the first is more centralized and controlled, and uses well-connected machines belonging to the infrastructure as landmarks; the second is more distributed and scalable and is based on landmarks positioned at the edge of the network. The study is based on an extensive set of measurements collected using the RIPE Atlas platform. The results show that the uniform and widespread diffusion of landmarks can be as important as their measurement accuracy. The study is carried out at both the worldwide and regional scale, including regions that were scarcely observed in the past. The results highlight that the geographical characteristics of the Internet paths are dependent on the considered region, thus suggesting the use of specifically calibrated models. Finally, the study shows that geolocating IP infrastructure with active measurements is feasible in terms of precision and scalability of the overall system.

Network Neutrality and Its Impact on Innovation

The debate around network neutrality (NN) has become more intense and controversial. The basic NN principle states that all traffic in the Internet must be treated equally. It is undeniable that NN fosters innovation in the Internet, ensuring fair competition and freedom of choice. The papers in this special issue explore multiple facets of the problem, including the economical factors behind NN, dealing with multiple NN jurisdictions across international Internet paths and designing in-network caching strategies that are neutral .

LinkScope: Toward Detecting Target Link Flooding Attacks

A new class of target link flooding attacks (LFAs) can cut off the Internet connections of a target area without being detected, because they employ legitimate flows to congest selected links. Although new mechanisms for defending against LFA have been proposed, the deployment issues limit their usage, since they require either additional modules to enhance routers or using the software-defined network to replace the traditional routers. In this paper, we propose a novel framework that employs both the end-to-end and hop-by-hop network measurement techniques to capture the abnormal path performance degradation for detecting LFA and then locate the target links or areas whenever possible, and develop a prototype of the framework named LinkScope . Although using network measurement to capture network anomaly is not new, we tackle a number of challenging issues, such as conducting large-scale Internet path monitoring via non-cooperative measurement so that users do not need to install LinkScope on every host, profiling the performance of asymmetric Internet paths and detecting LFA. The extensive evaluation in a testbed and the Internet shows that with limited bandwidth and computational overhead, LinkScope can achieve timely detection and diagnosis of LFA with high detection rate and low false positive rate.

Analisis Penerapan Metode Antrian Hirarchical Token Bucket untuk Management Bandwidth Jaringan Internet

Internet is one of the needs of the community, especially among education and academics such as universities. The high level of internet users is not comparable with the facilities owned by an agency, this makes the internet network manager in Higher Education feel difficult. The cause of the problem that is always a problem is the speed and internet connection is always disjointed, resulting in the slow loading process data while browsing, both at the time of download and at the time of upload. To make internet users in campus area balanced and stable then need bandwidth management based on traffic usage of internet path better. Bandwidth management that can stabilize traffic lanes and equal bandwidth distribution, it can use bandwidth management by Hierarchical Token Bucket (HTB) method. The calculation result in HTB method testing through file download, the average value obtained by TIPHON category standard for throughtput value index is 2 with "Medium" category, delay parameter index is 4 with "Very Good" category, jitter parameter index is 3 with the "Good" category and the packet loss parameter index is 4 with the "Very Good" category.&#x0D;

Exploring DSCP modification pathologies in the Internet

The differentiated service architecture (DiffServ) provides a means for network devices to classify traffic based on the DiffServ codepoint (DSCP) and to map the traffic to a specific QoS forwarding treatment. Successful use beyond the local network depends on consistent remarking and forwarding of the DSCP value inside and at the boundaries of DiffServ domains. This paper provides the results of a new widescale measurement campaign to examine how the DSCP value is altered as packets travel along a set of Internet paths. This allows us to infer whether a packet is likely to receive an appropriate QoS treatment and to comment the opportunities for more widely deploying DiffServ QoS. Our results identify a set of remarking pathologies, revealing that many deployed routers continue to use the previous semantics of the deprecated Type of Service (ToS) field. We also note that is not common to observe clearing of the bits in the DiffServ field, as previously believed for routers in the core of the Internet, although this varies significantly depending on the type of network studied. Our results are related to recent IETF work that recommends use of specific DSCP values.

Analysis of the use of complete orders to abstract the internet connectivity at the autonomous system level

Complete orders, also called chains, are transitive acyclic digraphs which can be employed as a topological unit to model, abstract and exploit the Internet's path diversity. The main objective behind this work is to demonstrate why complete orders are well suited in abstracting routing information at the interdomain level. In order to abstract a network's topological information, it becomes necessary to introduce another mathematical structure called virtual arc, which allows to define complete orders where these cannot be formed directly. An algorithm, called chain routing, that employs virtual arcs to define chains in a network is described and tested. Further analysis of the chain routing algorithm leads to the conclusion that this is an NP-complete problem; however, by limiting the size of the complete orders to be used, it is possible to provide an upper bound to the computational task needed to discover these structures in the Internet.

Toward QoE-Assured 4K Video-on-Demand Delivery Through Mobile Edge Virtualization With Adaptive Prefetching

Internet video streaming applications have been demanding more bandwidth and higher video quality, especially with the advent of virtual reality and augmented reality appli-cations. While adaptive strea ming protocols like MPEG-DASH (dynamic adaptive streaming over HTTP) allows video quality to be flexibly adapted, e.g., degraded when mobile network condition deteriorates, this is not an option if the application itself requires guaranteed 4K quality at all time. On the other hand, conventional end-to-end transmission control protocol (TCP) has been struggling in supporting 4K video delivery across long-distance Internet paths containing both fixed and mobile network segments with heterogeneous characteristics. In this paper, we present a novel and practically feasible system architecture named MVP (mobile edge virtualization with adaptive prefetching), which enables content providers to embed their content intelligence as a virtual network function into the mobile network operator's infrastructure edge. Based on this architecture, we present a context-aware adaptive video prefetching scheme in order to achieve quality of experience (QoE)-assured 4K video on demand (VoD) delivery across the global Internet. Through experiments based on a real LTE-A network infrastructure, we demonstrate that our proposed scheme is able to achieve QoE-assured 4K VoD streaming, especially when the video source is located remotely in the public Internet, in which case none of the state-of-the-art solutions is able to support such an objective at global Internet scale.