Virtual ring routing: network routing inspired by DHTs

This paper presents Virtual Ring Routing (VRR), a brand new network routing protocol that occupies a novel purpose within the style area. VRR is impressed by overlay routing algorithms in Distributed Hash Tables (DHTs) however it doesn’t admit associate underlying network routing protocol. it’s enforced directly on high of the link layer. VRR provides each raditional point-to-point network routing and DHT routing to the node accountable for a hash table key.VRR may be used with any link layer technology however this paper describes a style and a number of other implementations of VRR that square measure tuned for wireless networks. we tend to measure the performance of VRR victimisation simulations associated measurements from a device network and an 802.11a testbed. The experimental results show that VRR provides strong performance across a good vary of environments and workloads. It performs comparably to, or higher than, the most effective wireless routing protocol in every experiment. VRR performs well due to its distinctive features: it doesn’t need network flooding or trans-lation between mounted identifiers and location-dependent addresses. [1]

Enhancing Source-Location Privacy in Sensor Network Routing

One of the foremost notable challenges threatening the undefeated preparation of detector systems is privacy. though several privacy-related problems may be addressed  by security mechanisms, one detector network privacy issue that can’t be adequately addressed  by network security is source-location privacy. Adversaries might use RF localization techniques to perform hop-by-hop traceback to the supply sensor’s location. This paper provides a proper model for the source-location privacy downside in detector networks and examines the privacy characteristics of various detector routing protocols. we tend to examine 2 standard categories of routing protocols: the category of flooding protocols, and therefore the category of routing protocols involving solely one path from the supply to the sink. whereas work the privacy performance of routing protocols, we tend to thought-about the tradeoffs between location-privacy and energy consumption. we tend to found that the majority of this protocols cannot give economical source-location privacy whereas maintaining fascinating system performance. so as to supply economical and personal detector communications, we tend to devised new techniques to reinforce source-location privacy that augment these routing protocols. [2]

A Distributed Reinforcement Learning Scheme for Network Routing

In our learning theme, the policy is distributed throughout the network as follows: every node keeps Associate in Nursing estimate, for each neighbor/destination try (y, d), of however long it ought to view a packet with destination d to arrive there if it’s sent initial to neighbor node y. once a node x is asked to route a packet, it sends it to it neighbor y that x estimates can have all-time low total delivery time l . rather than then anticipating the packet to finally reach d before change the policy, x merely queries fJ to search out out however long it expects the given packet to require in about to d. Since the neighboring node is presumptively nearer to the ultimate destination, its estimate is taken into account. [3]

Quantum network routing and local complementation

Quantum communication between distant parties relies on appropriate instances of shared web. For potency reasons, in AN anticipated quantum network on the far side point-to-point communication, it’s desirable that several parties will communicate at the same time over the underlying infrastructure; but, bottlenecks within the network could cause delays. Sharing of multi-partite entangled states between parties offers an answer, letting parallel quantum communication. Specifically for the two-pair drawback, the butterfly network provides the primary instance of such a bonus during a bottleneck situation. during this paper, we tend to propose a additional general technique for establishing EPR pairs in arbitrary  networks. the most distinction from customary repeater network approaches is that we tend to use a graph state rather than maximally entangled pairs to attain long-distance coinciding communication. [4]

On Stability of Widest Path in Network Routing

The problem of widest path (WP) is a well-established topic in network routing and digital compositing. This paper contemplates one facet of the robustness of optimal solutions to the widest path; i.e., stability analysis of the WP problem. The study here deals with infimum and supremum perturbations which determine multiplicative changes each individual arc can tolerate conserving the optimality of a given WP. It is additionally illustrated how to determine these marginal values for all arcs, and an algorithm for computing all such values is proposed. [5]


[1] Caesar, M., Castro, M., Castro, M., Nightingale, E.B., O’Shea, G. and Rowstron, A., 2006, September. Virtual ring routing: network routing inspired by DHTs. In ACM SIGCOMM computer communication review (Vol. 36, No. 4, pp. 351-362). ACM. (Web Link)

[2] Kamat, P., Zhang, Y., Trappe, W. and Ozturk, C., 2005, June. Enhancing source-location privacy in sensor network routing. In 25th IEEE international conference on distributed computing systems (ICDCS’05) (pp. 599-608). IEEE. (Web Link)

[3] Littman, M. and Boyan, J., 2013, June. A distributed reinforcement learning scheme for network routing. In Proceedings of the international workshop on applications of neural networks to telecommunications (pp. 55-61). Psychology Press. (Web Link)

[4] Quantum network routing and local complementation
F. Hahn, A. Pappa & J. Eisert
npj Quantum Information volume 5, Article number: 76 (2019) (Web Link)

[5] Hosseini, A. and Baiki, B. (2017) “On Stability of Widest Path in Network Routing”, Journal of Advances in Mathematics and Computer Science, 23(6), (Web Link)

Leave a Reply

Your email address will not be published. Required fields are marked *