Static routing

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

Network Routing: Algorithms, Protocols, and Architectures

Abstract: Introduction / Part I: Packet Routing / Part II: Circuitswitched (Voice) Routing / Part III: Transport Routing / Part IV: Router and Switching Architecture / Part V: Integrated Routing & New Directions

Routing in Internet of Vehicles: A Review

Abstract: This work aims to provide a review of the routing protocols in the Internet of Vehicles (IoV) from routing algorithms to their evaluation approaches. We provide five different taxonomies of routing protocols. First, we classify them based on their transmission strategy into three categories: unicast, geocast, and broadcast ones. Second, we classify them into four categories based on information required to perform routing: topology-, position-, map-, and path-based ones. Third, we identify them in delay-sensitive and delay-tolerant ones. Fourth, we discuss them according to their applicability in different dimensions, i.e., 1-D, 2-D, and 3-D. Finally, we discuss their target networks, i.e., homogeneous and heterogeneous ones. As the evaluation is also a vital part in IoV routing protocol studies, we examine the evaluation approaches, i.e., simulation and real-world experiments. IoV includes not only the traditional vehicular ad hoc networks, which usually involve a small-scale and homogeneous network, but also a much larger scale and heterogeneous one. The composition of classical routing protocols and latest heterogeneous network approaches is a promising topic in the future. This work should motivate IoV researchers, practitioners, and new comers to develop IoV routing protocols and technologies.

RSVP: A New Resource ReSerVation Protocol: Novel design features lead to an Internet protocol that is flexible and scalable.

Abstract: This chapter tries to make the general design of RSVP relatively independent of the architectural components. Clearly, a particular implementation of RSVP is tied quite closely to the flowspec and interfaces used by the routing and admission control algorithms. However, the general protocol design should be independent of these. In particular, the protocol should be capable of establishing reservations across networks that implement different routing algorithms, such as IP unicast routing, IP multicast routing, the recently proposed core based tree (CBT) multicast routing, or some future routing protocols. This design goal makes RSVP deployable in many contexts. For optimally efficient routing decisions, however, routing selection and resource reservation should be integrated—so the choice of route can depend on the quality of service requested, and the stability of the route can be maintained over the duration of the reservation. The first RSVP design is verified by a detailed simulation and preliminary implementation. Much testing remains to be done in the context of larger scale simulations, as well as in real prototype networks, such as DARTnet.

Comparative performance evaluation of routing protocols for mobile, ad hoc networks

Abstract: We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay and routing load for a given traffic and mobility model. It is observed that the new generation of on-demand routing protocols use a much lower routing load. However the traditional link state and distance vector protocols provide, in general, better packet delivery and delay performance.