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
Proceedings ArticleDOI
01 Oct 1993
TL;DR: This paper investigates the dynamics of routing information flow as presented to the NSFNET backbone network, which represents the connectivity stability of the Internet.
Abstract: The Internet is a complex mesh of networks that use a common suite (TCP/IP) of networking protocols. A key feature of the Internet is that all of these constituent networks are interconnected, thereby providing system wide communication. The magnitude and pattern of the flow of routing information directly represents the connectivity stability of the Internet. The NSFNET backbone network provides transit services to a large portion of the global Internet and maintains routing tables reflecting this current connectivity. These routing tables are constantly updated based on information received by the attached networks. This paper investigates the dynamics of routing information flow as presented to the NSFNET backbone network.

48 citations

Book ChapterDOI
TL;DR: A new protocol designed to support unicast routing over both bidirectional and unidirectional links in ad hoc networks, while preserving low bandwidth utilization and providing faster and more reliable packet delivery is presented.
Abstract: Mobile ad hoc networks may exhibit unidirectional links due to the nature of wireless communication. Presence of unidirectional links interferes with the control flow of many existing unicast routing protocols for such networks, which adversely effects their performance and limits their applicability. In this paper, we present a new protocol designed to support unicast routing over both bidirectional and unidirectional links in ad hoc networks, while preserving low bandwidth utilization and providing faster and more reliable packet delivery. The WAR (Witness-Aided Routing) protocol is based on the concept of witness host, whose role is to help in bypassing a unidirectional or a failed link along the path. We present a preliminary analysis to compare the expected performance of WAR with the Dynamic Source Routing (DSR) protocol.

48 citations

Journal ArticleDOI
TL;DR: A robust routing algorithm to reach the higher network energy efficiency, which is based on optimization problem and a weight adaptive strategy is brought forth to reduce the link congestion and enhance the robustness of the network.
Abstract: This paper studies the routing problem in energy-efficient networks for cloud computing. We propose a robust routing algorithm to reach the higher network energy efficiency, which is based on optimization problem. To attain the highly energy-efficient routing in energy-efficient networks for cloud computing, the link of low utilization is turned into the sleeping state to save the network energy. At the same time, the low link traffic is aggregated to the link with high utilization to enhance the link utilization and to sleep the links as many as possible. We present an optimized link sleeping method to maximize the number of the sleeping links. By targeting the network robustness, a weight adaptive strategy is brought forth to reduce the link congestion and enhance the robustness of the network. Simulation results indicate that our algorithm is effective and feasible to achieve energy-efficient networks for cloud computing.

48 citations

Journal ArticleDOI
TL;DR: This paper presents a new hierarchical network architecture designed to solve the problems with existing network architectures and adaptive routing algorithms when they are applied to very large networks and compares it with others previously proposed from the standpoint of the savings in routing overhead and the optimality of the paths obtained.

48 citations

Proceedings ArticleDOI
08 Oct 2007
TL;DR: A path weight function based on the ETT metric and interference minimisation is proposed that provides higher packet delivery ratio and lower end-to-end delay when compared to the single path WCETT metric, a maximally disjoint path selection metric, and the CAM metric.
Abstract: This paper investigates the problem of selecting multiple routing paths to provide better reliability in multi-radio, multi-channel mesh networks with stationary nodes. Providing reliability is difficult in wireless networks because of unreliable transmissions. Previous work has investigated the use of additional data redundancy to improve the packet delivery rate, but requires node-disjoint paths to be used. In this paper we investigate multipath routing with packet duplication and non-disjoint paths for achieving better reliability and low delay. We propose a path weight function based on the ETT metric and interference minimisation. Our solution provides higher packet delivery ratio and lower end-to-end delay when compared to the single path WCETT metric, a maximally disjoint path selection metric, and the CAM metric.

48 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