Topic
Routing table
About: Routing table is a research topic. Over the lifetime, 16589 publications have been published within this topic receiving 336842 citations. The topic is also known as: routing information base & RIB.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This paper proposes a vehicular mobility model that reflects real-world vehicle movement and introduces a two-phase routing protocol (TOPO) that incorporates road map information and argues that the TOPO can serve as a framework that integrates existing VANET routing protocols.
Abstract: A vehicular ad hoc network (VANET) is a highly mobile wireless ad hoc network that is targeted to support vehicular safety, traffic monitoring, and other applications. Mobility models used in traditional mobile ad hoc networks cannot directly be applied to VANETs since real-world factors such as road layouts and traffic regulations are not considered. In this paper, we propose a vehicular mobility model that reflects real-world vehicle movement and study the performance of packet-routing protocols. First, we study the routing in small-scale VANETs and propose two routing schemes: (1) connection-based restricted forwarding (CBRF) and (2) connectionless geographic forwarding (CLGF). With the insights obtained, we consider routing in large-scale VANETs. Since road complexity and traffic variety may cause many potential problems that existing routing protocols cannot address, we introduce a two-phase routing protocol (TOPO) that incorporates road map information. The proposed protocol defines an overlay graph with roads of high vehicular density and access graphs that are connected to the overlay. While in the overlay, packets are forwarded along a precalculated path. As far as access routing is concerned, we employ the aforementioned CBRF and CLGF schemes and send packets to the overlay or handle packets delivered from the overlay. We argue that the TOPO can serve as a framework that integrates existing VANET routing protocols. We also consider data diversity in VANETs and design the TOPO as an intelligent transportation system (ITS)-friendly protocol. To validate our design philosophy and the routing protocol, we use different areas in the city of Orlando, FL, and generate vehicular mobility traces, following our mobility models. We feed the traces to network simulators and study the routing behavior. Simulation results demonstrate the performance and effectiveness of the proposed routing protocols for large-scale VANET scenarios.
73 citations
•
11 May 2001
TL;DR: In this paper, a method and data network for routing data packets is described, where switches are connected in a three-dimensional architecture (11) to form a switching fabric providing horizontal data routing according to addresses and vertical data routing based on packet types, an allocation procedure is then executed to manage the bandwidth resources of said fabric resulting with assigning routing tables at the switches and portals.
Abstract: A method and data network for routing data packets is described. Switches are connected in a three-dimensional architecture (11) to form a switching fabric providing horizontal data routing according to addresses and vertical data routing according to packet types. An allocation procedure is then executed to manage the bandwidth resources of said fabric resulting with assigning routing tables at the switches and portals, prior to forwarding packets to the switch fabric a hop-by-hop packet flow is executed through said switches of said switch fabric. Packet flow is controlled by an output port having an output port state machine and an output port concentrator.
73 citations
••
TL;DR: It is proved that construction of a minimum α-MOC-CDS is NP-hard in a general graph and a heuristic algorithm is proposed for construction of α- MOC- CDS to improve the performance of CDS based broadcasting and routing.
Abstract: Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named α Minimum routing Cost CDS (α-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum α-MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of α-MOC-CDS.
73 citations
•
06 Jun 2007TL;DR: In this article, the authors present a method for tagging packets and forwarding packets in a wireless mesh network using stored forwarding information for the tag, wherein the forwarding information is according to a centrally determined routing method and tag distribution method.
Abstract: Embodiments of the present invention include a method, an apparatus, and logic encoded in one or more computer-readable tangible medium to carry out a method. One method includes tagging packets and forwarding packets in a wireless mesh network using stored forwarding information for the tag, wherein the forwarding information is according to a centrally determined routing method and tag distribution method.
73 citations
•
01 May 1995TL;DR: In this paper, a topology manager compacts the circuit topology while at the same time optimizing the routing of the interconnections among the circuit elements, standard cells and/or cell blocks of the circuit design.
Abstract: An automated routing tool for routing interconnections between circuit elements, standard cells and/or cell blocks of cell-based designs which incorporates the best features of both currently known gate array routing techniques with currently known cell-based routing techniques. The invention eliminates the disadvantages of permitting the detailed router to adjust the relative positions of the circuit elements, standard cells and/or cell blocks during the detailed routing process. The method employs a topology manager which iteratively compacts the circuit topology while at the same time optimizing the routing of the interconnections among the circuit elements, standard cells and/or cell blocks of the circuit design. The method employs bin-based global routing, which identifies expandable boundaries and which provides input to a compaction routine which expands or contracts the expandable areas in accordance with the result of the global routing process. The detailed routing step is not performed until after the relative positions of the circuit elements, cells and/or cell blocks have been already fixed.
73 citations