Topic
Hazy Sighted Link State Routing Protocol
About: Hazy Sighted Link State Routing Protocol is a research topic. Over the lifetime, 6936 publications have been published within this topic receiving 169377 citations. The topic is also known as: HSLS.
Papers published on a yearly basis
Papers
More filters
TL;DR: A performance analysis and an improvement of ZigBee routing protocol are carried out and it is showed that Hierarchical Tree Routing provides shorter average end to end delay but performs poorly in terms of energy consumption.
53 citations
TL;DR: This is the first simulation study addressing the power saving issue to extensively compare the DSR and OLSR protocols under a wide variety of networking scenarios and found that a reactive protocol takes advantage of its routing policy when the traffic load is low, but at higher traffic rates, a proactive routing protocol can perform better.
53 citations
29 Aug 2000
TL;DR: Evaluation results show that the routing algorithm based on the new methodology increases throughput by a factor of up to 2.8 in large networks, also reducing latency significantly and a traffic balancing algorithm to obtain more efficient up*/down* routing tables when source routing is used.
Abstract: Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are arranged as a switch-based network with irregular topology, which makes routing and deadlock avoidance quite complicated. Current proposals use the up*/down* routing algorithm to remove cyclic dependencies between channels and avoid deadlock. Recently, a simple and effective methodology to compute up*/down* routing tables has been proposed by us. The resulting up*/down* routing scheme makes use of a different link direction assignment to compute routing tables. Assignment of link direction is based on generating an underlying acyclic connected graph from the network graph. In this paper, we propose and evaluate new heuristic rules to compute the underlying graph. Moreover, we propose a traffic balancing algorithm to obtain more efficient up*/down* routing tables when source routing is used. Evaluation results show that the routing algorithm based on the new methodology increases throughput by a factor of up to 2.8 in large networks, also reducing latency significantly.
53 citations
TL;DR: This work proposes a novel distributed potential-field-based routing scheme for anycast wireless mesh networks, which is robust to sudden traffic and network perturbations, effectively balancing load among multiple gateways and mesh nodes with little control overhead.
Abstract: Congested hot spots and node failures severely degrade the performance of wireless mesh networks. However, conventional routing schemes are inefficient in mitigation of the problems. Considering analogy to physics, we propose a novel distributed potential-field-based routing scheme for anycast wireless mesh networks, which is robust to sudden traffic and network perturbations, effectively balancing load among multiple gateways and mesh nodes with little control overhead. Simulation results exhibit autonomous load balancing and failure-tolerant performance in wireless mesh networking.
53 citations
10 Apr 2016
TL;DR: This paper proposes a new technique, called SCMon, that enables continuous monitoring of the data-plane, in order to track the health of all routers and links and leverages the recently proposed Segment Routing (SR) architecture to monitor the entire network with a single box.
Abstract: To guarantee correct operation of their networks, operators have to promptly detect and diagnose data-plane issues, like broken interface cards or link failures. Networks are becoming more complex, with a growing number of Equal Cost MultiPath (ECMP) and link bundles. Hence, some data-plane problems (e.g. silent packet dropping at one router) can hardly be detected with control-plane protocols or simple monitoring tools like ping or traceroute. In this paper, we propose a new technique, called SCMon, that enables continuous monitoring of the data-plane, in order to track the health of all routers and links. SCMon leverages the recently proposed Segment Routing (SR) architecture to monitor the entire network with a single box (and no additional monitoring protocol). In particular, SCMon uses SR to (i) force monitoring probes to travel over cycles; and (ii) test parallel links and bundles at a per-link granularity. We present original algorithms to compute cycles that cover all network links with a limited number of SR segments. Further, we prototype and evaluate SCMon both with simulations and Linux-based emulations. Our experiments show that SCMon quickly detects and precisely pinpoints data-plane problems, with a limited overhead.
52 citations