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
TL;DR: In this paper, the relation between this problem and other vehicle routing problems is investigated and a heuristic construction procedure is suggested, which is successfully applied to a real-life problem as well as test instances introduced in the literature earlier in order to try to determine favorable settings for the parameters used in the solution approach.
Abstract: Recently, the increasing focus on environmental protection has led to significant changes in logistics processes In addition to the distribution process to the customers, re-usable packaging and goods to be recycled or remanufactured have to be transported in the reverse direction If both tasks have to be performed simultaneously at the customers' locations which are serviced by a fleet of vehicles stationed in a depot or distribution/redistribution center, the vehicle routing problem with simultaneous delivery and pick-up arises In this paper, the relation between this problem and other vehicle routing problems is investigated A heuristic construction procedure is suggested The proposed algorithm is successfully applied to a real-life problem as well as test instances introduced in the literature earlier In addition, randomly generated instances are tackled in order to try to determine favorable settings for the parameters used in the solution approach

388 citations

Proceedings ArticleDOI
01 Oct 1998
TL;DR: Extensions to the basic QoS routing are developed that can achieve good routing performance with limited update generation rates and the impact on the results of a number of secondary factors such as topology, high level admission control, and characteristics of network traffic.
Abstract: Recent studies provide evidence that Quality of Service (QoS) routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of traffic. However, there are still strong concerns about the increased cost of QoS routing, both in terms of more complex and frequent computations and increased routing protocol overhead. The main goals of this paper are to study these two cost components, and propose solutions that achieve good routing performance with reduced processing cost. First, we identify the parameters that determine the protocol traffic overhead, namely (a) policy for triggering updates, (b) sensitivity of this policy, and (c) clamp down timers that limit the rate of updates. Using simulation, we study the relative significance of these factors and investigate the relationship between routing performance and the amount of update traffic. In addition, we explore a range of design options to reduce the processing cost of QoS routing algorithms, and study their effect on routing performance. Based on the conclusions of these studies, we develop extensions to the basic QoS routing, that can achieve good routing performance with limited update generation rates. The paper also addresses the impact on the results of a number of secondary factors such as topology, high level admission control, and characteristics of network traffic.

387 citations

Proceedings ArticleDOI
01 Jun 2000
TL;DR: This paper proposes a set of guidelines for an AS to follow in setting its routing policies, without requiring coordination with other ASes, and proves that following these guidelines guarantees route convergence.
Abstract: The Border Gateway Protocol (BGP) allows an autonomous system (AS) to apply diverse local policies for selecting routes and propagating reachability information to other domains. However, BGP permits ASes to have conflicting policies that can lead to routing instability. This paper proposes a set of guidelines for an AS to follow in setting its routing policies, without requiring coordination with other ASes. Our approach exploits the Internet's hierarchical structure and the commercial relationships between ASes to impose a partial order on the set of routes to each destination. The guidelines conform to conventional traffic-engineering practices of ISPs, and provide each AS with significant flexibility in selecting its local policies. Furthermore, the guidelines ensure route convergence even under changes in the topology and routing policies. Drawing on a formal model of BGP, we prove that following our proposed policy guidelines guarantees route convergence. We also describe how our methodology can be applied to new types of relationships between ASes, how to verify the hierarchical AS relationships, and how to realize our policy guidelines. Our approach has significant practical value since it preserves the ability of each AS to apply complex local policies without divulging its BGP configurations to others.

387 citations

Journal ArticleDOI
TL;DR: This paper presents a model for designing wormhole routing algorithms based on analyzing the directions in which packets can turn in a network and the cycles that the turns can form, which produces routing algorithms that are deadlock free, livelockfree, minimal or nonminimal, and highly adaptive.
Abstract: This paper presents a model for designing wormhole routing algorithms. A unique feature of the model is that it is not based on adding physical or virtual channels to direct networks (although it can be applied to networks with extra channels). Instead, the model is based on analyzing the directions in which packets can turn in a network and the cycles that the turns can form. Prohibiting just enough turns to break all of the cycles produces routing algorithms that are deadlock free, livelock free, minimal or nonminimal, and highly adaptive. This paper focuses on the two most common network topologies for wormhole routing, n-dimensional meshes and k-ary n-cubes without extra channels

385 citations

Journal ArticleDOI
TL;DR: Simulation results show that the proposed LARP outperforms the existing routing protocols in terms of packet delivery ratio and normalized routing overhead, and are expected to be of greater value than other existing solutions in underwater environment.
Abstract: As the network communications technology developing, a new type of networks has appeared in the daily life which is named underwater sensor networks (UWSNs). UWSNs are a class of emerging networks that experience variable and high propagation delays and limited available bandwidth. There are comprehensive applications in this area such as oceanographic data collection, pollution monitoring, offshore exploration, assisted navigation and so on. Due to the different environment under the ocean, routing protocols in UWSNs should be re-designed to fit for the surroundings. In particular, routing protocols in UWSNs should ensure the reliability of message transmission, not just decrease the delay. In this paper, we propose a novel routing protocol named Location-Aware Routing Protocol (LARP) for UWSNs, where the location information of nodes is used to help the transmission of the message. Simulation results show that the proposed LARP outperforms the existing routing protocols in terms of packet delivery ratio and normalized routing overhead. We expect LARP to be of greater value than other existing solutions in underwater environment.

384 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