Placing Relay Nodes for Intra-Domain Path Diversity

2020 16th International Conference on Network and Service Management (CNSM)

Relay or overlay routing for IP networks has been well-documented. However, the implementation cost of relay solutions has not yet been conclusively identified. There is also a shortage of studies that present and analyze relay characteristics for reducing the relay cost or the probing burden. This paper, in particular, introduces new relay characteristics, such as the number of relay hops in a minimum delay path or Hop-To-Live (HTL). The HTL and Round-Trip-Time (RTT) are examined for reducing the relay cost and estimating stable relay paths. This paper considers a wide-set of 311, 360 Ping measurements on a network of 140 Planetlab hosts. The main results emphasize the redundant probing burden over a 24−hours period and concluded that relay hosts have favorable dominant relay paths with high (not maximum) prevalence. Unfortunately, such a prevalence causes relay paths to suffering from a weak persistence. The RTT demonstrates the ability to detect such dominant changes with a 25% average error. In contrast to recent studies, our work shows that relay paths are asymmetrical on each examined granularity.

The IEEE symposium on Computers and Communications, 2010

Exploiting path diversity to enhance communication reliability is a key desired property in Internet. While the existing routing architecture is reluctant to adopt changes, overlay routing has been proposed to circumvent the constraints of native routing by employing intermediary relays. However, the selfish interdomain relay placement may violate local routing policies at intermediary relays and thus affect their economic costs and performances. With the recent advance of the concept of network virtualization, it is envisioned that virtual networks should be provisioned in cooperation with infrastructure providers in a holistic view without compromising their profits. In this paper, the problem of policy-aware virtual relay placement is first studied to investigate the feasibility of provisioning policycompliant multipath routing via virtual relays for inter-domain communication reliability. By evaluation on a real domain-level Internet topology, it is demonstrated that policy-compliant virtual relaying can achieve a similar protection gain against single link failures compared to its selfish counterpart. It is also shown that the presented heuristic placement strategies perform well to approach the optimal solution.

Computer Communications

18071 Granada (Spain) b Istituto Dalle Molle di studi sull'intelligenza artificiale (IDSIA, http://www.idsia.ch) Galleria 2, Via Cantonale 2c-CH-6928 Manno (Switzerland)

Relays are beneficial in ubicomp [7]. The benefits go mostly for mobile nodes in the topography. Relay densities and their placements have significant impacts on energy containment [7]. Some locations of relays may be more prominent than others [7][8] and this may hold true despite optimising the number of relays by removing the least prominent ones starting from a uniform distribution of moderately large number of relays. Hence, appropriate knowledge of tendencies of prominence in "optimised number" of relays is required so as to better plan for power requirements and efficiency of relays, future upgrades, continued use of lower power relays and reshuffling of relays needed. This paper is a follow-up of 8 previous papers [1-8] aimed at producing models of behaviours towards reliability in ubicomp with more focus from papers [4][7] [8]. In this paper, one set of behaviour patterns, for amount of data reaching each relay as transit relay over topography with optimally placed relays is presented. The results are presented in the form of graphs and tabular summaries of data, following which conclusions are drawn. The results of this study can help in further optimisations of relay densities and to avoid new arrangements or architectures of relays for ubicomp.

2006

This Conference Proceeding is brought to you for free and open access by the School of Computer Science at Research Showcase. It has been acceptedfor inclusion in Computer Science Department by an authorized administrator of Research Showcase. For more information, please contactresearch-showcase@andrew.cmu.edu.

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.

2008

Providing a high level of the path diversity is a substantial criterion in designing an overlay network. Given a underlying network infrastructure, the diversity of the overlay paths largely depends on how the overlay nodes, i.e. relays, are placed. In this paper, the problem of optimal relay placement is studied, and the goal is to maximize the diversity of the overlay paths while minimizing the number of relays. To tackle this multi-objective optimization problem, a novel genetic algorithm (GA) is applied hybridizing the standard GA and k-shortest path algorithms. By studying 6 real ISP topologies, we find that there exist non-unique solutions, which provide nearly the same level of the path diversity. In those solutions, only few locations are not replaceable allowing a great flexibility in the overlay network deployment. Perhaps surprisingly, these places do not include all those nodes with the highest number of links. The reason is that those nodes with the highest number of links are usually crossed by the default routing paths. Therefore, the overlay paths tend not to crossing them. We also notice that the number of relays required to maintain a high level of the path diversity is only 5% - 10% of the total number of network nodes depending on the topologies. We believe that our findings are useful for designing and deploying multi-path overlay networks.

Wireless Networks, 2013

Your article is protected by copyright and all rights are held exclusively by Springer Science +Business Media New York. This e-offprint is for personal use only and shall not be selfarchived in electronic repositories. If you wish to self-archive your article, please use the accepted manuscript version for posting on your own website. You may further deposit the accepted manuscript version in any repository, provided it is only made publicly available 12 months after official publication or later and provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

2016

Opportunistic networks contain mobile nodes with wireless networking capability which deliver messages in a hop-by-hop fashion completely based on local information and using opportunistic connectivity created due to device proximity. There exists no predefined path between the source and destination. The source only forwards the data to the next node based on its capability to carry the data packet one step closer to the destination. Due to the absence of any concrete path connected by trustful nodes, these types of networks suffer from a number of security issues. The intermediate nodes may be malicious and lead to loss of packets, breach of user privacy, compromising data confidentiality by unwanted intrusion etc. General cryptography algorithms cannot be applied here directly due to the absence of any end-to-end secure path. The nodes have to solely depend on the next hop node for data transfer. So there is a need of such security mechanisms which would ensure that the intermedi...

2018

Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance in terms of increasing longevity and preservation network coverage as compared to other routine methods. Their main purpose is to control the danger area and transfer data to a sink. Therefore, connecting to sensor networks and coverage rate of controlled area is one of the most important concerns to achieve these goals. In this paper, to cluster wireless sensor networks, a method using the Imperialist competitive evolutionary algorithm is purposed that divides wireless sensor nodes into balanced clusters, in addition to, several mobile robots has been used for improving power dissipation of netwo...