scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
01 Jan 2003
TL;DR: Experimental evidence from two wireless test-beds shows that there are usually multiple minimum hop-count paths, many of which have poor throughput, and suggests that more attention be paid to link quality when choosing ad hoc routes.
Abstract: Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-hop-count routing often chooses routes that have significantly less capacity than the best paths that exist in the network. Much of the reason for this is that many of the radio links between nodes have loss rates low enough that the routing protocol is willing to use them, but high enough that much of the capacity is consumed by retransmissions. These observations suggest that more attention be paid to link quality when choosing ad hoc routes; the paper presents measured link characteristics likely to be useful in devising a better path quality metric.

461 citations

Journal ArticleDOI
TL;DR: A loop-free, distributed routing protocol for mobile packet radio networks intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow to make one of the existing protocols for a nearly-static topology applicable.
Abstract: We present a loop-free, distributed routing protocol for mobile packet radio networks. The protocol is intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow as to make one of the existing protocols for a nearly-static topology applicable. The routing algorithm adapts asynchronously in a distributed fashion to arbitrary changes in topology in the absence of global topological knowledge. The protocol's uniqueness stems from its ability to maintain source-initiated, loop-free multipath routing only to desired destinations with minimal overhead in a randomly varying topology. The protocol's performance, measured in terms of end-to-end packet delay and throughput, is compared with that of pure flooding and an alternative algorithm which is well-suited to the high-rate topological change environment envisioned here. For each protocol, emphasis is placed on examining how these performance measures vary as a function of the rate of topological changes, network topology, and message traffic level. The results indicate the new protocol generally outperforms the alternative protocol at all rates of change for heavy traffic conditions, whereas the opposite is true for light traffic. Both protocols significantly outperform flooding for all rates of change except at ultra-high rates where all algorithms collapse. The network topology, whether dense or sparsely connected, is not seen to be a major factor in the relative performance of the algorithms.

438 citations

Journal ArticleDOI
TL;DR: In this survey, the naming and routing mechanisms proposed by some of the most prominent ICN research projects are analyzed, compare, and contrast.
Abstract: The concept of information-centric networking (ICN) defines a new communication model that focuses on what is being exchanged rather than which network entities are exchanging information. From the ICN perspective, contents are first class network citizens instead of hosts. ICN's primary objective is to shift the current host-oriented communication model toward a content-centric model for effective distribution of content over the network. In recent years this paradigm shift has generated much interest in the research community and sprung several research projects around the globe to investigate and advance this stream of thought. Content naming and content-based routing are core research challenges in this research community. In this survey, we analyze, compare, and contrast the naming and routing mechanisms proposed by some of the most prominent ICN research projects.

433 citations

Proceedings ArticleDOI
20 Jun 2009
TL;DR: A case is made for a new approach to designing on-chip interconnection networks that eliminates the need for buffers for routing or flow control and new algorithms for routing without using buffers in router input/output ports are described.
Abstract: Buffers in on-chip networks consume significant energy, occupy chip area, and increase design complexity. In this paper, we make a case for a new approach to designing on-chip interconnection networks that eliminates the need for buffers for routing or flow control. We describe new algorithms for routing without using buffers in router input/output ports. We analyze the advantages and disadvantages of bufferless routing and discuss how router latency can be reduced by taking advantage of the fact that input/output buffers do not exist. Our evaluations show that routing without buffers significantly reduces the energy consumption of the on-chip cache/processor-to-cache network, while providing similar performance to that of existing buffered routing algorithms at low network utilization (i.e., on most real applications). We conclude that bufferless routing can be an attractive and energy-efficient design option for on-chip cache/processor-to-cache networks where network utilization is low.

427 citations

Proceedings ArticleDOI
Roch Guerin1, Ariel Orda, D. Williams
03 Nov 1997
TL;DR: The overall goal of this study is to identify a framework and possible approaches to allow deployment of QoS routing capabilities with the minimum possible impact to the existing routing infrastructure.
Abstract: This paper presents and discusses path selection algorithms to support QoS routes in IP networks. The work is carried out in the context of extensions to the OSPF protocol, and the initial focus is on unicast flows, although some of the proposed extensions are also applicable to multicast flows. We first review the metrics required to support QoS, and then present and compare several path selection algorithms, which represent different trade-offs between accuracy and computational complexity. We also describe and discuss the associated link advertisement mechanisms, and investigate some options in balancing the requirements for accurate and timely information with the associated control overhead. The overall goal of this study is to identify a framework and possible approaches to allow deployment of QoS routing capabilities with the minimum possible impact to the existing routing infrastructure.

410 citations

Network Information
Related Topics (5)
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Network packet
159.7K papers, 2.2M citations
92% related
Wireless sensor network
142K papers, 2.4M citations
92% related
Wireless network
122.5K papers, 2.1M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202210
20211
20193
201822
2017264