86,816 research outputs found
Path Selection for Quantum Repeater Networks
Quantum networks will support long-distance quantum key distribution (QKD)
and distributed quantum computation, and are an active area of both
experimental and theoretical research. Here, we present an analysis of
topologically complex networks of quantum repeaters composed of heterogeneous
links. Quantum networks have fundamental behavioral differences from classical
networks; the delicacy of quantum states makes a practical path selection
algorithm imperative, but classical notions of resource utilization are not
directly applicable, rendering known path selection mechanisms inadequate. To
adapt Dijkstra's algorithm for quantum repeater networks that generate
entangled Bell pairs, we quantify the key differences and define a link cost
metric, seconds per Bell pair of a particular fidelity, where a single Bell
pair is the resource consumed to perform one quantum teleportation. Simulations
that include both the physical interactions and the extensive classical
messaging confirm that Dijkstra's algorithm works well in a quantum context.
Simulating about three hundred heterogeneous paths, comparing our path cost and
the total work along the path gives a coefficient of determination of 0.88 or
better.Comment: 12 pages, 8 figure
Practical figures of merit and thresholds for entanglement distribution in quantum networks
Before global-scale quantum networks become operational, it is important to
consider how to evaluate their performance so that they can be built to achieve
the desired performance. We propose two practical figures of merit for the
performance of a quantum network: the average connection time and the average
largest entanglement cluster size. These quantities are based on the generation
of elementary links in a quantum network, which is a crucial initial
requirement that must be met before any long-range entanglement distribution
can be achieved and is inherently probabilistic with current implementations.
We obtain bounds on these figures of merit for a particular class of quantum
repeater protocols consisting of repeat-until-success elementary link
generation followed by joining measurements at intermediate nodes that extend
the entanglement range. Our results lead to requirements on quantum memory
coherence times, requirements on repeater chain lengths in order to surpass the
repeaterless rate limit, and requirements on other aspects of quantum network
implementations. These requirements are based solely on the inherently
probabilistic nature of elementary link generation in quantum networks, and
they apply to networks with arbitrary topology.Comment: 17 pages, 7 figures. v2: extensively revised and rewritten. Title and
abstract modified; added a section on overcoming the repeaterless rate limit;
modified statement of Theorem 1. v3: minor changes to match the published
versio
SPAD: a distributed middleware architecture for QoS enhanced alternate path discovery
In the next generation Internet, the network will evolve from a plain communication medium into one that provides endless services to the users. These services will be composed of multiple cooperative distributed application elements. We name these services overlay applications. The cooperative application elements within an overlay application will build a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS experienced on the communication paths of the corresponding overlay association. In this paper, we present SPAD (Super-Peer Alternate path Discovery), a distributed middleware architecture that aims at providing enhanced QoS between end-points within an overlay association. To achieve this goal, SPAD provides a complete scheme to discover and utilize composite alternate end-to end paths with better QoS than the path given by the default IP routing mechanisms
On using Multiple Quality Link Metrics with Destination Sequenced Distance Vector Protocol for Wireless Multi-Hop Networks
In this paper, we compare and analyze performance of five quality link
metrics forWireless Multi-hop Networks (WMhNs). The metrics are based on loss
probability measurements; ETX, ETT, InvETX, ML and MD, in a distance vector
routing protocol; DSDV. Among these selected metrics, we have implemented ML,
MD, InvETX and ETT in DSDV which are previously implemented with different
protocols; ML, MD, InvETX are implemented with OLSR, while ETT is implemented
in MR-LQSR. For our comparison, we have selected Throughput, Normalized Routing
Load (NRL) and End-to-End Delay (E2ED) as performance parameters. Finally, we
deduce that InvETX due to low computational burden and link asymmetry
measurement outperforms among all metrics
An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN
Routing in NDN networks must scale in terms of forwarding table size and
routing protocol overhead. Hyperbolic routing (HR) presents a potential
solution to address the routing scalability problem, because it does not use
traditional forwarding tables or exchange routing updates upon changes in
network topologies. Although HR has the drawbacks of producing sub-optimal
routes or local minima for some destinations, these issues can be mitigated by
NDN's intelligent data forwarding plane. However, HR's viability still depends
on both the quality of the routes HR provides and the overhead incurred at the
forwarding plane due to HR's sub-optimal behavior. We designed a new forwarding
strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's
sub-optimal path selection. This paper describes our experimental investigation
into the packet delivery delay and overhead under HR as compared with
Named-Data Link State Routing (NLSR), which calculates shortest paths. We run
emulation experiments using various topologies with different failure
scenarios, probing intervals, and maximum number of next hops for a name
prefix. Our results show that HR's delay stretch has a median close to 1 and a
95th-percentile around or below 2, which does not grow with the network size.
HR's message overhead in dynamic topologies is nearly independent of the
network size, while NLSR's overhead grows polynomially at least. These results
suggest that HR offers a more scalable routing solution with little impact on
the optimality of routing paths
Mining Network Events using Traceroute Empathy
In the never-ending quest for tools that enable an ISP to smooth
troubleshooting and improve awareness of network behavior, very much effort has
been devoted in the collection of data by active and passive measurement at the
data plane and at the control plane level. Exploitation of collected data has
been mostly focused on anomaly detection and on root-cause analysis. Our
objective is somewhat in the middle. We consider traceroutes collected by a
network of probes and aim at introducing a practically applicable methodology
to quickly spot measurements that are related to high-impact events happened in
the network. Such filtering process eases further in- depth human-based
analysis, for example with visual tools which are effective only when handling
a limited amount of data. We introduce the empathy relation between traceroutes
as the cornerstone of our formal characterization of the traceroutes related to
a network event. Based on this model, we describe an algorithm that finds
traceroutes related to high-impact events in an arbitrary set of measurements.
Evidence of the effectiveness of our approach is given by experimental results
produced on real-world data.Comment: 8 pages, 7 figures, extended version of Discovering High-Impact
Routing Events using Traceroutes, in Proc. 20th International Symposium on
Computers and Communications (ISCC 2015
- …