اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدActive Flows in Diagnostic of Troubleshooting on Backbone Links
30
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper aims to identify the operational region of a link in terms of its utilization and alert operators at the point where the link becomes overloaded and requires a capacity upgrade. The number of active flows is considered the real network state and is proposed to use a proxy for utilization. The Gaussian approximation gives the expression for the confidence interval on an operational region. The easy rule has been formulated to display the network defects by means of measurements of router loading and number of active flows. Mean flow performance is considered as the basic universal index characterized quality of network services provided to single user.
قيم البحث
اقرأ أيضاً
The aim of this paper is to extend our previous study of the solar-cycle variations of the meridional flows and to investigate their latitudinal and longitudinal structure in the subphotospheric layer, especially their variations in magnetic regions.
Helioseismology observations indicate that mass flows around active regions are dominated by inflows into those regions. On average, those local flows are more important around leading magnetic polarities of active regions than around the following polarities, and depend on the evolutionary stage of particular active regions. We present a statistical study based on MDI/SOHO observations of 1996-2002 and show that this effect explains a significant part of the cyclic change of meridional flows in near-equatorial regions, but not at higher latitudes. A different mechanism driving solar-cycle variations of the meridional flow probably operates.
A train backbone network consists of a sequence of nodes arranged in a linear topology. A key step that enables communication in such a network is that of topology discovery, or train inauguration, whereby nodes learn in a distributed fashion the phy
sical topology of the backbone network. While the current standard for train inauguration assumes wired links between adjacent backbone nodes, this work investigates the more challenging scenario in which the nodes communicate wirelessly. The key motivations for this desired switch from wired topology discovery to wireless one are the flexibility and capability for expansion and upgrading of a wireless backbone. The implementation of topology discovery over wireless channels is made difficult by the broadcast nature of the wireless medium, and by fading and interference. A novel topology discovery protocol is proposed that overcomes these issues and requires relatively minor changes to the wired standard. The protocol is shown via analysis and numerical results to be robust to the impairments caused by the wireless channel including interference from other trains.
Today, payment paths in Bitcoins Lightning Network are found by searching for shortest paths on the fee graph. We enhance this approach in two dimensions. Firstly, we take into account the probability of a payment actually being possible due to the u
nknown balance distributions in the channels. Secondly, we use minimum cost flows as a proper generalization of shortest paths to multi-part payments (MPP). In particular we show that under plausible assumptions about the balance distributions we can find the most likely MPP for any given set of senders, recipients and amounts by solving for a (generalized) integer minimum cost flow with a separable and convex cost function. Polynomial time exact algorithms as well as approximations are known for this optimization problem. We present a round-based algorithm of min-cost flow computations for delivering large payment amounts over the Lightning Network. This algorithm works by updating the probability distributions with the information gained from both successful and unsuccessful paths on prior rounds. In all our experiments a single digit number of rounds sufficed to deliver payments of sizes that were close to the total local balance of the sender. Early experiments indicate that our approach increases the size of payments that can be reliably delivered by several orders of magnitude compared to the current state of the art. We observe that finding the cheapest multi-part payments is an NP-hard problem considering the current fee structure and propose dropping the base fee to make it a linear min-cost flow problem. Finally, we discuss possibilities for maximizing the probability while at the same time minimizing the fees of a flow. While this turns out to be a hard problem in general as well - even in the single path case - it appears to be surprisingly tractable in practice.
Long flows contribute huge volumes of traffic over inter-datacenter WAN. The Flow Completion Time (FCT) is a vital network performance metric that affects the running time of distributed applications and the users quality of experience. Flow routing
techniques based on propagation or queuing latency or instantaneous link utilization are insufficient for minimization of the long flows FCT. We propose a routing approach that uses the remaining sizes and paths of all ongoing flows to minimize the worst-case completion time of incoming flows assuming no knowledge of future flow arrivals. Our approach can be formulated as an NP-Hard graph optimization problem. We propose BWRH, a heuristic to quickly generate an approximate solution. We evaluate BWRH against several real WAN topologies and two different traffic patterns. We see that BWRH provides solutions with an average optimality gap of less than $0.25%$. Furthermore, we show that compared to other popular routing heuristics, BWRH reduces the mean and tail FCT by up to $1.46times$ and $1.53times$, respectively.
A key challenge in automated chemical compound space explorations is ensuring veracity in minimum energy geometries---to preserve intended bonding connectivities. We discuss an iterative high-throughput workflow for connectivity preserving geometry o
ptimizations exploiting the nearness between quantum mechanical models. The methodology is benchmarked on the QM9 dataset comprising DFT-level properties of 133,885 small molecules; of which 3,054 have questionable geometric stability. We successfully troubleshoot 2,988 molecules and ensure a bijective mapping between desired Lewis formulae and final geometries. Our workflow, based on DFT and post-DFT methods, identifies 66 molecules as unstable; 52 contain $-{rm NNO}-$, the rest are strained due to pyramidal sp$^2$ C. In the curated dataset, we inspect molecules with long CC bonds and identify ultralong contestants ($r>1.70$~AA{}) supported by topological analysis of electron density. We hope the proposed strategy to play a role in big data quantum chemistry initiatives.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
