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 published on a yearly basis
Papers
More filters
••
TL;DR: A hybrid multi-population genetic algorithm is proposed to solve a new city logistics problem arising in the last mile distribution of e-commerce, and the computational results obtained show the effectiveness of the different components of the algorithm.
164 citations
••
08 Dec 1997TL;DR: This paper presents an efficient solution, based on a detection-diagnosis-recovery approach, for the link state routing update authentication problem, which is scalable to handle large networks, applicable to routing protocols that use multiple-valued cost metrics, and applicable even, when link states change frequently.
Abstract: We study methods for reducing the cost of secure link state routing. In secure link state routing, routers may need to verify the authenticity of many routing updates, and some routers such as border routers may need to sign many routing updates. Previous work such as public-key based schemes are very expensive computationally or have certain limitations. This paper presents an efficient solution, based on a detection-diagnosis-recovery approach, for the link state routing update authentication problem. Our scheme is scalable to handle large networks, applicable to routing protocols that use multiple-valued cost metrics, and applicable even, when link states change frequently.
164 citations
••
09 Jul 2003
TL;DR: This work proposes heuristics based on a novel paradigm and shows their effectiveness against publicly available data sets and characterize the time complexity of the above problem, showing both NP-completeness results and efficient algorithms for solving specific cases.
Abstract: The problem of computing the types of the relationships between Internet autonomous systems is investigated. We refer to the model introduced in (ref.1), (ref.2) that bases the discovery of such relationships on the analysis of the AS paths extracted from the BGP routing tables. We characterize the time complexity of the above problem, showing both NP-completeness results and efficient algorithms for solving specific cases. Motivated by the hardness of the general problem, we propose heuristics based on a novel paradigm and show their effectiveness against publicly available data sets. The experiments put in evidence that our heuristics performs significantly better than state of the art heuristics.
163 citations
••
TL;DR: This paper presents Grid-based Routing and Aggregator Selection Scheme (GRASS), a scheme for WSNs that can achieve low energy dissipation and low latency without sacrificing quality, and shows that, when compared to other schemes, GRASS improves system lifetime with acceptable levels of latency in data aggregation and without sacrificing data quality.
163 citations
••
22 Apr 2001TL;DR: Using simulations, it is shown that ADV outperforms AODV and DSR especially in high mobility cases by giving significantly higher (50% or more) peak throughputs and lower packet delays.
Abstract: We present a new routing algorithm called adaptive distance vector (ADV) for mobile, ad hoc networks (MANETs). ADV is a distance vector routing algorithm that exhibits some on-demand characteristics by varying the frequency and the size of the routing updates in response to the network load and mobility conditions. Using simulations we show that ADV outperforms AODV and DSR especially in high mobility cases by giving significantly higher (50% or more) peak throughputs and lower packet delays. Furthermore, ADV uses fewer routing and control overhead packets than that of AODV and DSR, especially at moderate to high loads. Our results indicate the benefits of combining both proactive and on-demand routing techniques in designing suitable routing protocols for MANETs.
163 citations