scispace - formally typeset
Search or ask a question
Topic

Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.


Papers
More filters
Journal ArticleDOI
G.J. Foschini1, J. Salz1
TL;DR: A dynamic routing policy where messages that arrive at a certain node are routed to leave the node on the link having the shorter queue, and it is found that the average delay for the dynamic system is better by a factor of K.
Abstract: Diffusion theory has sometimes been successful in providing excellent approximate solutions to difficult queueing problems. Here we explore whether such methods can be used to analyze a basic dynamic routing strategy associated with a single idealized node in a data network. We analyze a dynamic routing policy where messages, or packets, that arrive at a certain node are routed to leave the node on the link having the shorter queue. In the model, message or packet arrivals are Poisson and the service time is exponentially distributed. We explore a heavy traffic diffusion method and we also discuss the limitations of an ad hoc approach to applying diffusion. For a node with K outgoing queues we find, under the assumption of heavy traffic, the optimum dynamic strategy, in the sense of minimizing the average delay. When this optimum dynamic strategy is compared to a static strategy where the outgoing traffic is split among the K queues, we find that the average delay for the dynamic system is better by a factor of K .

198 citations

Proceedings Article
08 May 2006
TL;DR: A new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and generates less maintenance traffic than previous algorithms, and requires an order of magnitude less bandwidth to maintain its trees than CLDP.
Abstract: We present a new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and generates less maintenance traffic than previous algorithms. While geographic routing potentially scales well, it faces the problem of what to do at local dead ends where greedy forwarding fails. Existing geographic routing algorithms handle dead ends by planarizing the node connectivity graph and then using the right-hand rule to route around the resulting faces. GDSTR handles this situation differently by switching instead to routing on a spanning tree until it reaches a point where greedy forwarding can again make progress. In order to choose a direction on the tree that is most likely to make progress towards the destination, each GDSTR node maintains a summary of the area covered by the subtree below each of its tree neighbors. While GDSTR requires only one tree for correctness, it uses two for robustness and to give it an additional forwarding choice. Our simulations show that GDSTR finds shorter routes than geographic face routing algorithms: GDSTR's stretch is up to 20% less than the best existing algorithm in situations where dead ends are common. In addition, we show that GDSTR requires an order of magnitude less bandwidth to maintain its trees than CLDP, the only distributed planarization algorithm that is known to work with practical radio networks.

198 citations

Book ChapterDOI
01 Jan 1998
TL;DR: In this article, Seguin et al. present a real-time decision problem in which a set of vehicles are routed over a particular time horizon (typically, a day) while new service requests are occuring in real time.
Abstract: Real-time decision problems are playing an increasingly important role in the economy due to advances in communication and information technologies that now allow realtime information to be quickly obtained and processed (Seguin et al., 1997). Among these, dynamic vehicle routing and dispatching problems have emerged as an intense area of research in the operations research community. Numerous examples may be found in Haines and Wolfe (1982), Powell, Jaillet and Odoni (1995) and Psaraftis (1995). In these problems, a set of vehicles is routed over a particular time horizon (typically, a day) while new service requests are occuring in real-time. With each new request, the current solution may be reconfigured to better service the new request, as well as those already assigned to a route.

198 citations

Journal ArticleDOI
TL;DR: A dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes is designed and validated and can effectively trade off message overhead and message delay for a significant gain in delivery ratio.
Abstract: Delay tolerant networks (DTNs) are characterized by high end-to-end latency, frequent disconnection, and opportunistic communication over unreliable wireless links. In this paper, we design and validate a dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes. We develop a novel model-based methodology for the analysis of our trust protocol and validate it via extensive simulation. Moreover, we address dynamic trust management, i.e., determining and applying the best operational settings at runtime in response to dynamically changing network conditions to minimize trust bias and to maximize the routing application performance. We perform a comparative analysis of our proposed routing protocol against Bayesian trust-based and non-trust based (PROPHET and epidemic) routing protocols. The results demonstrate that our protocol is able to deal with selfish behaviors and is resilient against trust-related attacks. Furthermore, our trust-based routing protocol can effectively trade off message overhead and message delay for a significant gain in delivery ratio. Our trust-based routing protocol operating under identified best settings outperforms Bayesian trust-based routing and PROPHET, and approaches the ideal performance of epidemic routing in delivery ratio and message delay without incurring high message or protocol maintenance overhead.

198 citations

Proceedings ArticleDOI
07 Nov 2002
TL;DR: A detailed performance evaluation on two location based routing protocols: location-aided routing (LAR) and distance routing effect algorithm for mobility (DREAM) and their implementation provides a simple location service that could be used with other ad hoc network routing protocols.
Abstract: Many location based routing protocols have been developed for ad hoc networks. This paper presents the results of a detailed performance evaluation on two of these protocols: location-aided routing (LAR) and distance routing effect algorithm for mobility (DREAM). We compare the performance of these two protocols with the dynamic source routing (DSR) protocol and a minimum standard (i.e., a protocol that floods all data packets). We used NS-2 to simulate 50 nodes moving according to the random waypoint model. Our main goal for the performance investigation was to stress the evaluated protocols with high data loads during both low and high speeds. Our performance investigation produced the following conclusions. First, the added protocol complexity of DREAM does not appear to provide benefits over a flooding protocol. Second, promiscuous mode operation improves the performance of DSR significantly. Third, adding location information to DSR (i.e., similar to LAR) increases both the network load and the data packet delivery ratio; our results conclude that the increase in performance is worth the increase in cost. Lastly, our implementation of DREAM provides a simple location service that could be used with other ad hoc network routing protocols.

198 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
95% related
Wireless network
122.5K papers, 2.1M citations
93% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Wireless sensor network
142K papers, 2.4M citations
93% related
Server
79.5K papers, 1.4M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202391
2022209
202130
202035
201962
2018132