اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVerifiable Network-Performance Measurements
172
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In the current Internet, there is no clean way for affected parties to react to poor forwarding performance: when a domain violates its Service Level Agreement (SLA) with a contractual partner, the partner must resort to ad-hoc probing-based monitoring to determine the existence and extent of the violation. Instead, we propose a new, systematic approach to the problem of forwarding-performance verification. Our mechanism relies on voluntary reporting, allowing each domain to disclose its loss and delay performance to its neighbors; it does not disclose any information regarding the participating domains topology or routing policies beyond what is already publicly available. Most importantly, it enables verifiable performance measurements, i.e., domains cannot abuse it to significantly exaggerate their performance. Finally, our mechanism is tunable, allowing each participating domain to determine how many resources to devote to it independently (i.e., without any inter-domain coordination), exposing a controllable trade-off between performance-verification quality and resource consumption. Our mechanism comes at the cost of deploying modest functionality at the participating domains border routers; we show that it requires reasonable processing and memory resources within modern network capabilities.
قيم البحث
اقرأ أيضاً
The trustworthiness of modern networked services is too important to leave to chance. We need to design these services with specific properties in mind, and verify that the properties hold. In this paper, we argue that a compositional network archite
cture, based on a notion of layering where each layer is its own complete network customized for a specific purpose, is the only plausible approach to making network services verifiable. Realistic examples show how to use the architecture to reason about sophisticated network properties in a modular way. We also describe a prototype in which the basic structures of the architectural model are implemented in efficient P4 code for programmable data planes, then explain how this scaffolding fits into an integrated process of specification, code generation, implementation of additional network functions, and automated verification.
The COVID-19 pandemic and related restrictions forced many to work, learn, and socialize from home over the internet. There appears to be consensus that internet infrastructure in the developed world handled the resulting traffic surge well. In this
paper, we study network measurement data collected by the Federal Communications Commissions Measuring Broadband America program before and during the pandemic in the United States (US). We analyze the data to understand the impact of lockdown orders on the performance of fixed broadband internet infrastructure across the US, and also attempt to correlate internet usage patterns with the changing behavior of users during lockdown. We found the key metrics such as change in data usage to be generally consistent with the literature. Through additional analysis, we found differences between metro and rural areas, changes in weekday, weekend, and hourly internet usage patterns, and indications of network congestion for some users.
This work characterises the effect of mutual interference in a planar network of pulsed-radar devices. Using stochastic geometry tools and a strongest interferer approximation, we derive simple closed-form expressions that pinpoint the role played by
key system parameters on radar detection range and false alarm rate in the interference-limited region. The fundamental tradeoffs of the system between radar performance, network density and antenna directivity are captured for different path-loss exponents in the no-fading and Rayleigh-fading cases. The discussion highlights practical design hints for tuning the radar parameters. The accuracy of the model is verified through network simulations, and the role of random noise on detection in sparse, non interference-limited networks is characterised.
We propose that clusters interconnected with network topologies having minimal mean path length will increase their overall performance for a variety of applications. We approach our heuristic by constructing clusters of up to 36 nodes having Dragonf
ly, torus, ring, Chvatal, Wagner, Bidiakis and several other topologies with minimal mean path lengths and by simulating the performance of 256-node clusters with the same network topologies. The optimal (or sub-optimal) low-latency network topologies are found by minimizing the mean path length of regular graphs. The selected topologies are benchmarked using ping-pong messaging, the MPI collective communications, and the standard parallel applications including effective bandwidth, FFTE, Graph 500 and NAS parallel benchmarks. We established strong correlations between the clusters performances and the network topologies, especially the mean path lengths, for a wide range of applications. In communication-intensive benchmarks, clusters with optimal network topologies out-perform those with mainstream topologies by several folds. It is striking that a mere adjustment of the network topology suffices to reclaim performance from the same computing hardware.
Network-assisted single-hop device-to-device (D2D) communication can increase the spectral and energy efficiency of cellular networks by taking advantage of the proximity, reuse, and hop gains when radio resources are properly managed between the cel
lular and D2D layers. In this paper we argue that D2D technology can be used to further increase the spectral and energy efficiency if the key D2D radio resource management algorithms are suitably extended to support network assisted multi-hop D2D communications. Specifically, we propose a novel, distributed utility maximizing D2D power control (PC) scheme that is able to balance spectral and energy efficiency while taking into account mode selection and resource allocation constraints that are important in the integrated cellular-D2D environment. Our analysis and numerical results indicate that multi-hop D2D communications combined with the proposed PC scheme can be useful not only for harvesting the potential gains previously identified in the literature, but also for extending the coverage of cellular networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
