Points Of Presence Research Articles

Interference Analysis of Weather Radar at The Meteorological Station

This research aims to analyze the disturbances that occur at the Sultan Syarif Kasim II Meteorological Station Weather Radar and provide appropriate treatment to stop the source of the disturbance. For this reason, the following steps are arranged: Literature studies, preparation for mitigating interference, measurement, interference analysis, and interference resolution. After applying measurements, the following results were obtained: The interference location point is on the azimuth line (8.07° and 37.84°), Noise floor level -107.3 dBm at a frequency of 6500 MHz when SSID PermanaNET#02 5825 MHz is on, noise floor level -111.1 dBm at a frequency of 6500 MHz when SSID PermanaNET#02 5825 MHz is off, distance between BMKG Radar station to Point of Presence (PoP) ISP PT. Medianusa Permana is very close ±200 meters, antenna SSID PermanaNET#02 5825 MHz pointing to the BMKG Radar Station, and sensitivity of the EEC DWSR–2500C Radar Device is -113 dBm. Interference at the 6500 MHz radar frequency comes from the Out Of Band Emission frequency 5825 MHz (SSID PermanaNET#02). Following this, the interference is mitigated by the off-air method, which is deactivation of the PermanaNET SSID#02 device.

Optimal Meshing Degree Performance Analysis in a mmWave FWA 5G Network Deployment

Fifth-generation technologies have reached a stage where it is now feasible to consider deployments that extend beyond traditional public networks. Central to this process is the application of Fixed Wireless Access (FWA) in 5G Non-public Networks (NPNs) that can utilise a novel combination of radio technologies to deploy an infrastructure on top of 5G NR or entirely from scratch. However, the use of FWA backhaul faces many challenges in relation to the trade-offs for reduced costs and a relatively simple deployment. Specifically, the use of meshed deployments is critical as it provides resilience against a temporary loss of connectivity due to link errors. In this paper, we examine the use of meshing in a FWA backhaul to determine if an optimal trade-off exists between the deployment of more nodes/links to provide multiple paths to the nearest Point of Presence (POP) and the performance of the network. Using a real 5G NPN deployment as a basis, we have conducted a simulated analysis of increasing network densities to determine the optimal configuration. Our results show a clear advantage for meshing in general, but there is also a performance trade-off to consider between overall network throughput and stability.

APVNFC: Adaptive Placement of Virtual Network Function Chains

Abstract Designing efficient and flexible approaches for placement of Virtual Network Function (VNF) chains is the main success of Network Function Virtualization (NFV). However, most current work considers the constant bandwidth and flow processing requirements while deploying the VNFs in the network. The constant (immutable) flow processing and bandwidth requirements become critical limitations in an NFV-enabled network with highly dynamic traffic flow. Therefore, bandwidth requirements and available resources of the Point-of-Presence (PoP) in the network change constantly. We present an adaptive model for placing VNF chains to overcome this limitation. At the same time, the proposed model minimizes the number of changes (i.e., re-allocation of VNFs) in the network. The experimental evaluation shows that the adaptive model can deliver stable network services. Moreover, it reduces the significant number of changes in the network and ensures flow performance.

MmWave Physical Layer Network Modeling and Planning for Fixed Wireless Access Applications.

The large bandwidths that are available at millimeter-wave frequencies enable fixed wireless access (FWA) applications, in which fixed point-to-point wireless links are used to provide internet connectivity. In FWA networks, a wireless mesh is created and data are routed from the customer premises equipment (CPE) towards the point of presence (POP), which is the interface with the wired internet infrastructure. The performance of the wireless links depends on the radio propagation characteristics, as well as the wireless technology that is used. The radio propagation characteristics depend on the environment and on the considered frequency. In this work, we analyzed the network characteristics of FWA networks using radio propagation models for different wireless technologies using millimeter-wave (mmWave) frequencies of 28 GHz, 60 GHz, and 140 GHz. Different scenarios and environments were considered, and the influence of rain, vegetation, and the number of subscribers was investigated. A network planning algorithm is presented that defines a route for each CPE towards the POP based on a predefined location of customer devices and considering the available capacity of the wireless links. Rain does not have a considerable effect on the system capacity. Even though the higher frequencies exhibit a larger path loss, resulting in a lower power of the received signal, the larger bandwidths enable a higher channel capacity.

Emphasizing privacy and security of edge intelligence with machine learning for healthcare

PurposeArtificial Intelligence (AI) has surpassed expectations in opening up different possibilities for machines from different walks of life. Cloud service providers are pushing. Edge computing reduces latency, improving availability and saving bandwidth.Design/methodology/approachThe exponential growth in tensor processing unit (TPU) and graphics processing unit (GPU) combined with different types of sensors has enabled the pairing of medical technology with deep learning in providing the best patient care. A significant role of pushing and pulling data from the cloud, big data comes into play as velocity, veracity and volume of data with IoT assisting doctors in predicting the abnormalities and providing customized treatment based on the patient electronic health record (EHR).FindingsThe primary focus of edge computing is decentralizing and bringing intelligent IoT devices to provide real-time computing at the point of presence (PoP). The impact of the PoP in healthcare gains importance as wearable devices and mobile apps are entrusted with real-time monitoring and diagnosis of patients. The impact edge computing of the PoP in healthcare gains significance as wearable devices and mobile apps are entrusted with real-time monitoring and diagnosis of patients.Originality/valueThe utility value of sensors data improves through the Laplacian mechanism of preserved PII response to each query from the ODL. The scalability is at 50% with respect to the sensitivity and preservation of the PII values in the local ODL.

Named Data Networking for Content Delivery Network Workflows.

In this work we investigate Named Data Networking's (NDN's) architectural properties and features, such as content caching and intelligent packet forwarding, in the context of Content Delivery Network (CDN) workflows. More specifically, we evaluate NDN's properties for PoP (Point of Presence) to PoP and PoP to device connectivity. We use the Apache Traffic Server (ATS) platform to create a CDN-like caching hierarchy in order to compare NDN with HTTP-based content delivery. Overall, our work demonstrates that several properties inherent to NDN can benefit content providers and users alike through in-network caching of content, fast retransmission, and stateful hop-by-hop packet forwarding. Our experimental results demonstrate that HTTP delivers content faster under stable conditions due to a mature software stack. However, NDN performs better in the presence of packet loss, even for a loss rate as low as 0.1%, due to packet-level caching in the network and fast retransmissions from close upstreams. We further show that the Time To First Byte (TTFB) in NDN is consistently lower than HTTP (~ 100ms in HTTP vs. ~ 50ms in NDN), a vital requirement for CDNs. Unlike HTTP, NDN also supports transparent failover to another upstream when a failure occurs in the network. Finally, we present implementation-agnostic (implementation choices can be Software Defined Networking, Information Centric Networking, or something else) network properties that can benefit CDN workflows.

On the dynamics of valley times and its application to bulk-transfer scheduling

Periods of low load have been used for the scheduling of non-interactive tasks since the early stages of computing. Nowadays, the scheduling of bulk transfers—i.e., large-volume transfers without precise timing, such as database distribution, resources replication or backups—stands out among such tasks, given its direct effect on both the performance and billing of networks. Through visual inspection of traffic-demand curves of diverse points of presence (PoP), either a network, link, Internet service provider or Internet exchange point, it becomes apparent that low-use periods of bandwidth demands occur at early morning, showing a noticeable convex shape. Such observation led us to study and model the time when such demands reach their minimum, on what we have named valley time of a PoP, as an approximation to the ideal moment to carry out bulk transfers. After studying and modeling single-PoP scenarios both temporally and spatially seeking homogeneity in the phenomenon, as well as its extension to multi-PoP scenarios or paths—a meta-PoP constructed as the aggregation of several single PoPs—, we propose a final predictor system for the valley time. This tool works as an oracle for scheduling bulk transfers, with different versions according to time scales and the desired trade-off between precision and complexity. The evaluation of the system, named VTP, has proven its usefulness with errors below an hour on estimating the occurrence of valley times, as well as errors around 10% in terms of bandwidth between the prediction and actual valley traffic.

A multilayer graph model of the internet topology

The application of internet maps for developing more effective routing algorithms, security mechanisms and resilience management for both companies and internet service providers can be advanced through their more detailed structural decomposition. This article carefully integrates traceroute datasets from various large-scale measurement campaigns such as iPlane, CAIDA, Carna, DIMES, RIPE Atlas and RIPE IPv6L into internet graphs of a previously unknown large and thus solid scale. It further works with different well-established abstraction levels such as the IP interface, router, point of presence (PoP), autonomous system (AS) and internet service provider (ISP). Finally, by employing a broad diversity of graph measures, this study creates an exhaustive snapshot of the global internet topology. This work creates a baseline for future internet research. Repeated measurements and automated data integration could enable a better understanding of the internet dynamics.

A multilayer graph model of the internet topology

The application of internet maps for developing more effective routing algorithms, security mechanisms and resilience management for both companies and internet service providers can be advanced through their more detailed structural decomposition. This article carefully integrates traceroute datasets from various large-scale measurement campaigns such as iPlane, CAIDA, Carna, DIMES, RIPE Atlas and RIPE IPv6L into internet graphs of a previously unknown large and thus solid scale. It further works with different well-established abstraction levels such as the IP interface, router, point of presence (PoP), autonomous system (AS) and internet service provider (ISP). Finally, by employing a broad diversity of graph measures, this study creates an exhaustive snapshot of the global internet topology. This work creates a baseline for future internet research. Repeated measurements and automated data integration could enable a better understanding of the internet dynamics.

Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing

Future large-scale network function virtualization (NFV) environments will be based on hundreds or even thousands of NFV infrastructure installations, the so called points of presence (PoP). All their resources and the services deployed on top of them will be controlled by management and orchestration (MANO) systems. Such large-scale scenarios need to be automatically tested during the development phase of a MANO system. This task becomes very challenging because large-scale NFV testbeds are hard to maintain, too expensive, or simply not available.In this paper, we introduce the concept of emulation-based smoke testing, which enables automated, large-scale testing of MANO systems. We show that our test platform prototype can easily emulate up to 1024 PoPs on a single physical machine and that it can reduce the setup time of a single test PoP by a factor of 232 × compared to a DevStack-based PoP installation. In a case study, we test and compare two versions of a state-of-the-art MANO solution, namely ETSI’s Open Source MANO (OSM), in large-scale scenarios using our prototype. The issues we found in this study would not have been discovered with existing, lab-scale test environments.

Impact of VNF placements on QoE monitoring in the cloud

SummaryThe fast growth of video streaming is responsible for a huge amount of traffic over the past few years. Because of the variety of video content on the Internet, a potential market is emerging for video providers. However, a rapid increase in video traffic and users poses challenges for network operators maintaining user expectation. To address this problem, network operators need a mechanism to monitor the quality of experience (QoE) perceived by the user. This allows reacting to quality degradation to improve the service. With the paradigm of network function virtualization, network operators are able to deploy such a video monitoring function in the cloud. In this work, we investigate the feasibility of deploying a virtual network function (VNF) for video buffer and QoE monitoring on the Amazon Web Service cloud.To this end, we implement a VNF to analyze video flows in the network by using deep packet inspection. We investigate the influence of different points of presence (PoP) in the cloud and mobile network on the performance of the VNF for monitoring video buffer and QoE. Our findings show that the accuracy of the QoE monitoring decreases with the distance of the PoP to the client. This is not only due to the delay and bottleneck between the monitoring point and the client but also due to the client mobile access network.

D-FAC: A novel ϕ-Divergence based distributed DDoS defense system

A Distributed Denial of Service (DDoS) attack is an austere menace to extensively used Internet-based services and applications. Despite the presence of enormous DDoS defense solutions, the in-time detection of DDoS attacks poses a stiff challenge to network security professionals. The problem turns further crucial when such attacks are amalgamated with behaviorally similar flash events (FEs) wherein a large number of legitimate users starts accessing a particular service concurrently leading to the denial of service. This paper proposes an anomaly based distributed defense system called D-FAC that not only detect different type of DDoS attacks with efficacy but also efficiently mitigate their impact. D-FAC computes the information distance between legitimate and anomalous network traffic flows using information theory-based ϕ-Divergence metric to detect different types of DDoS attacks and efficiently discriminate them from FEs. D-FAC distribute the computational and storage complexity of computing ϕ-Divergence detection metric to the nearest point of presence (PoP) routers. D-FAC has been validated in an emulation based DDoSTB testbed using real DDoS attack tools and traffic generators. The results clearly show that D-FAC has outperformed existing Entropy and divergence based DDoS defense systems on various detection metrics like detection accuracy, classification rate, FPR, precision and F-measure.

Scalability of ONOS reactive forwarding applications in ISP networks

Software Defined Networking (SDN) is a powerful approach that enhances network control and management, and provides a flexible way to develop network applications. However, scalability of SDN networks is an important concern for many network operators. The main peculiarities of SDN when applied to an Internet Service Provider (ISP) network are the large geographical extension and the need of in-band transmission of control traffic. Therefore, the control traffic exchanged between the SDN controller and the network nodes must be carefully evaluated for the network design and dimensioning.We consider an ISP network controlled by the recently ONOS (Open Network Operating System) controller developed by ON.Lab. We devise a quantitative model to compute the exact number of exchanged OpenFlow messages and the corresponding bandwidth needed to install a traffic flow when running the default ONOS layer-2 forwarding applications. We compute also the exact number of flow rules installed in each switch. We show the general applicability of our models for a Point Of Presence (POP) network and for a large set of real nation-wide and world-wide ISP networks.Our quantitative models can be used for a safe network planning also when the network applications are not fully reactive.

Assessing the Implications of Cellular Network Performance on Mobile Content Access

Mobile applications such as VoIP, (live) gaming, or video streaming have diverse QoS requirements ranging from low delay to high throughput. The optimization of the network quality experienced by end-users requires detailed knowledge of the expected network performance. Also, the achieved service quality is affected by a number of factors, including network operator and available technologies. However, most studies measuring the cellular network do not consider the performance implications of network configuration and management. To this end, this paper reports about an extensive data set of cellular network measurements, focused on analyzing root causes of mobile network performance variability. Measurements conducted on a 4G cellular network in Germany show that management and configuration decisions have a substantial impact on the performance. Specifically, it is observed that the association of mobile devices to a point of presence (PoP) within the operator’s network can influence the end-to-end performance by a large extent. Given the collected data, a model predicting the PoP assignment and its resulting RTT leveraging Markov chain and machine learning approaches is developed. RTT increases of 58% to 73% compared to the optimum performance are observed in more than 57% of the measurements. Measurements of the response and page load times of popular websites lead to similar results, namely, a median increase of 40% between the worst and the best performing PoP.

A Two-Stage Spatiotemporal Approach for Mining Traffic Flows across Multiple Networks

In this letter, a new definition of two-stage spatiotemporal approach, called ICA-WFS (Independent-Component-Analysis-Weighted-Frequent-Substructure) is proposed. To facilitate capturing abnormal behavior across multiple networks and dimensionality reduction at a single Point of Presence (PoP), ICA is applied. With application of WFS, an complete graph is examined, unusual substructures of which are reported. Experiments are conducted and, together with application of backbone network (Internet2) Netflow data, show some positive results.

Inferring undesirable behavior from P2P traffic analysis

While peer-to-peer (P2P) systems have emerged in popularity in recent years, their large-scale and complexity make them difficult to reason about. In this paper, we argue that systematic analysis of traffic characteristics of P2P systems can reveal a wealth of information about their behavior, and highlight potential undesirable activities that such systems may exhibit. As a first step to this end, we present an offline and semi-automated approach to detect undesirable behavior. Our analysis is applied on real traffic traces collected from a Point-of-Presence (PoP) of a national-wide ISP in which over 70% of the total traffic is due to eMule [19], a popular P2P file-sharing system. Flow-level measurements are aggregated into "samples" referring to the activity of each host during a time interval. We then employ a clustering technique to automatically and coarsely identify similar behavior across samples, and extensively use domain knowledge to interpret and analyze the resulting clusters. Our analysis shows several examples of undesirable behavior including evidence of DDoS attacks exploiting live P2P clients, significant amounts of unwanted traffic that may harm network performance, and instances where the performance of participating peers may be subverted due to maliciously deployed servers. Identification of such patterns can benefit network operators, P2P system developers, and actual end-users.

Personalised subscription pricing for optimised wireless mesh network deployment

Wireless mesh networks (WMN) represent semi-infrastructured ad hoc networks, where nodes act as both access points and routers. Wireless links between nodes are used to relay communication to a gateway node or point-of-presence (POP) for a wired or fibre network. Our interest is in mesh network deployment for a service provider (typically an ISP) who has a fixed location(s) for a POP(s). Service coverage requires that new subscribers are able to route to a POP via existing subscribers. Providing service coverage in a new region is problematic since a node is covered only if at least one of its neighbours is active in the network. Consequently an insufficient number of active nodes will lead to disconnected components. Seed nodes, owned by the network, are one mechanism for enhancing coverage, but at an additional upfront cost. In this paper we consider the influence of pricing strategies on the expected coverage and revenue. Assuming ideal economic behaviour and demand for subscription based on price, we introduce a framework that seeks to assign personalised subscription prices to optimise the expected network formed in terms of both coverage and revenue. The proposed method is benchmarked with other alternative strategies and a range of test problems are explored, showing the extent to which financial and coverage gains can be achieved if personalised pricing can be adopted. We further show how seed node and POP selection can be incorporated in the same optimization framework, allowing the trade-off between pricing and infrastructure costs to be investigated.

Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees

Service providers rely on the management systems housed in their Network Operations Centers (NOCs) to remotely operate, monitor and provision their data networks. Lately there has been a tremendous increase in management traffic due to the growing complexity and size of the data networks and the services provisioned on them. Traffic engineering for management flows is essential for the smooth functioning of these networks to avoid congestion, which can result in loss of critical data such as billing records, network alarms, etc. As is the case with most intra-domain routing protocols, the management flows in many of these networks are routed on shortest paths connecting the NOC with the service provider’s POPs (points of presence). This collection of paths thus forms a “confluent” tree rooted at the gateway router connected to the NOC. The links close to the gateway router may form a bottleneck in this tree resulting in congestion. Typically this congestion is alleviated by adding layer two tunnels (virtual links) that offload the traffic from some links of this tree by routing it directly to the gateway router. The traffic engineering problem is then to minimize the number of virtual links needed for alleviating congestion. In this paper we formulate a traffic engineering problem motivated by the above mentioned applications. We show that the general versions of this problem are hard to solve. However, for some simpler cases in which the underlying network is a tree, we design efficient algorithms. In particular, we design fully polynomial-time approximate schemes (FPTAS) for different variants of this problem on trees. We use these algorithms as the basis for designing efficient heuristics for alleviating congestion in general (non-tree) service provider network topologies.

High-Performance Simulation of Low-Resolution Network Flows

Simulation of large-scale networks demands that we model some flows at coarser time scales than others, simply to keep the execution cost manageable. This article studies a method for periodically computing traffic at a time scale larger than that typically used for detailed packet simulations. Applications of this technique include computation of background flows (against which detailed foreground flows are simulated) and simulation of worm propagation in the Internet. The approach considers aggregated traffic between Internet points of presence (POPs) and computes the throughput of each POP-to-POP flow through each router on its path. This problem formulation leads to a nonlinear system of equations. The authors develop means of reducing this system to a smaller set of equations, which are solved using fixed-point iteration. They study the convergence behavior, as a function of traffic load, on topologies based on Internet backbone networks. They find that the problem reduction method is very effective and that convergence is achieved rapidly. The authors also examine the comparative speedup of the method relative to using pure packet simulation for background flows and observe speedups exceeding 3000 using an ordinary PC. They also simulate foreground flows interacting with background flows and compare the foreground behavior using their solution with that of pure packet flows. They find that these flows behave accurately enough in their approach to justify use of the technique in their motivating application. The authors parallelize the algorithm on a distributed-memory multiprocessor. They exploit the flexibility offered by noncommittal barrier synchronization that permits a processor to handle computation messages even after it invokes a barrier primitive. They also take advantage of application-specific knowledge to minimize synchronization cost, study the performance of their parallel algorithm with both fixed and scaled problem sizes, and observe excellent scalability on a multiprocessor supercomputer.

Point of presence design in Internet protocol networks with performance guarantees

In this paper, we propose a model for the point of presence (POP) design problem in Internet protocol (IP) networks with performance guarantees, where a POP is a node composed of several interconne...