اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEnabling Novel Interconnection Agreements with Path-Aware Networking Architectures
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Path-aware networks (PANs) are emerging as an intriguing new paradigm with the potential to significantly improve the dependability and efficiency of networks. However, the benefits of PANs can only be realized if the adoption of such architectures is economically viable. This paper shows that PANs enable novel interconnection agreements among autonomous systems, which allow to considerably improve both economic profits and path diversity compared to todays Internet. Specifically, by supporting packet forwarding along a path selected by the packet source, PANs do not require the Gao-Rexford conditions to ensure stability. Hence, autonomous systems can establish novel agreements, creating new paths which demonstrably improve latency and bandwidth metrics in many cases. This paper also expounds two methods to set up agreements which are Pareto-optimal, fair, and thus attractive to both parties. We further present a bargaining mechanism that allows two parties to efficiently automate agreement negotiations.
قيم البحث
اقرأ أيضاً
Due to spectrum scarcity and increasing wireless capacity demands, terahertz (THz) communications at 0.1-10THz and the corresponding spectrum characterization have emerged to meet diverse service requirements in future 5G and 6G wireless systems. How
ever, conventional compressed sensing techniques to reconstruct the original wideband spectrum with under-sampled measurements become inefficient as local spectral correlation is deliberately omitted. Recent works extend communication methods with deep learning-based algorithms but lack strong ties to THz channel properties. This paper introduces novel THz channel-aware spectrum learning solutions that fully disclose the uniqueness of THz channels when performing such ultra-broadband sensing in vehicular environments. Specifically, a joint design of spectrum compression and reconstruction is proposed through a structured sensing matrix and two-phase reconstruction based on high spreading loss and molecular absorption at THz frequencies. An end-to-end learning framework, namely compression and reconstruction network (CRNet), is further developed with the mean-square-error loss function to improve sensing accuracy while significantly reducing computational complexity. Numerical results show that the CRNet solutions outperform the latest generative adversarial network (GAN) realization with a much higher cosine and structure similarity measures, smaller learning errors, and 56% less required training overheads. This THz Ultra-broadband Learning Vehicular Channel-Aware Networking (TULVCAN) work successfully achieves effective THz spectrum learning and hence allows frequency-agile access.
By delegating path control to end-hosts, future Internet architectures offer flexibility for path selection. However, there is a concern that the distributed routing decisions by end-hosts, in particular load-adaptive routing, can lead to oscillation
s if path selection is performed without coordination or accurate load information. Prior research has addressed this problem by devising path-selection policies that lead to stability. However, little is known about the viability of these policies in the Internet context, where selfish end-hosts can deviate from a prescribed policy if such a deviation is beneficial fromtheir individual perspective. In order to achieve network stability in future Internet architectures, it is essential that end-hosts have an incentive to adopt a stability-oriented path-selection policy. In this work, we perform the first incentive analysis of the stability-inducing path-selection policies proposed in the literature. Building on a game-theoretic model of end-host path selection, we show that these policies are in fact incompatible with the self-interest of end-hosts, as these strategies make it worthwhile to pursue an oscillatory path-selection strategy. Therefore, stability in networks with selfish end-hosts must be enforced by incentive-compatible mechanisms. We present two such mechanisms and formally prove their incentive compatibility.
The problem of quality of service (QoS) and jamming-aware communications is considered in an adversarial wireless network subject to external eavesdropping and jamming attacks. To ensure robust communication against jamming, an interference-aware rou
ting protocol is developed that allows nodes to avoid communication holes created by jamming attacks. Then, a distributed cooperation framework, based on deep reinforcement learning, is proposed that allows nodes to assess network conditions and make deep learning-driven, distributed, and real-time decisions on whether to participate in data communications, defend the network against jamming and eavesdropping attacks, or jam other transmissions. The objective is to maximize the network performance that incorporates throughput, energy efficiency, delay, and security metrics. Simulation results show that the proposed jamming-aware routing approach is robust against jamming and when throughput is prioritized, the proposed deep reinforcement learning approach can achieve significant (measured as three-fold) increase in throughput, compared to a benchmark policy with fixed roles assigned to nodes.
This paper discusses an efficient approach to design and implement a highly available peer- to-peer system irrespective of peer timing and churn.
Sensors placed in agricultural field should have long network life. Failure of node or link allows rerouting and establishing a new path from the source to the sink. In this paper, a new path is established such that it is energy aware during path di
scovery and is active for longer interval of time once it is established. The parameters used for simulation are as those used in agricultural application.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
