8,421 research outputs found
Optimization of transport protocols with path-length constraints in complex networks
We propose a protocol optimization technique that is applicable to both
weighted or unweighted graphs. Our aim is to explore by how much a small
variation around the Shortest Path or Optimal Path protocols can enhance
protocol performance. Such an optimization strategy can be necessary because
even though some protocols can achieve very high traffic tolerance levels, this
is commonly done by enlarging the path-lengths, which may jeopardize
scalability. We use ideas borrowed from Extremal Optimization to guide our
algorithm, which proves to be an effective technique. Our method exploits the
degeneracy of the paths or their close-weight alternatives, which significantly
improves the scalability of the protocols in comparison to Shortest Paths or
Optimal Paths protocols, keeping at the same time almost intact the length or
weight of the paths. This characteristic ensures that the optimized routing
protocols are composed of paths that are quick to traverse, avoiding negative
effects in data communication due to path-length increases that can become
specially relevant when information losses are present.Comment: 8 pages, 8 figure
Network-wide Configuration Synthesis
Computer networks are hard to manage. Given a set of high-level requirements
(e.g., reachability, security), operators have to manually figure out the
individual configuration of potentially hundreds of devices running complex
distributed protocols so that they, collectively, compute a compatible
forwarding state. Not surprisingly, operators often make mistakes which lead to
downtimes. To address this problem, we present a novel synthesis approach that
automatically computes correct network configurations that comply with the
operator's requirements. We capture the behavior of existing routers along with
the distributed protocols they run in stratified Datalog. Our key insight is to
reduce the problem of finding correct input configurations to the task of
synthesizing inputs for a stratified Datalog program. To solve this synthesis
task, we introduce a new algorithm that synthesizes inputs for stratified
Datalog programs. This algorithm is applicable beyond the domain of networks.
We leverage our synthesis algorithm to construct the first network-wide
configuration synthesis system, called SyNET, that support multiple interacting
routing protocols (OSPF and BGP) and static routes. We show that our system is
practical and can infer correct input configurations, in a reasonable amount
time, for networks of realistic size (> 50 routers) that forward packets for
multiple traffic classes.Comment: 24 Pages, short version published in CAV 201
- …