TL;DR: A new routing protocol called GRID is proposed, which tries to exploit location information in route discovery, packet relay, and route maintenance, and can reduce the probability of route breakage, reduce the number of route discovery packets used, and lengthen routes' lifetime.
Abstract: A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. One prospective direction to assist routing in such an environment is to use location information provided by positioning devices such as global positioning systems (GPS). In this paper, we propose a new routing protocol called GRID, which tries to exploit location information in route discovery, packet relay, and route maintenance. Existing protocols, as compared to ours, are either not location-aware or partially location-aware in that location knowledge is not fully exploited in all these three aspects. One attractive feature of our protocol is its strong route maintenance capability --- the intermediate hosts of a route can perform a "handoff" operation similar to that in cellular systems when it roams away to keep a route alive. This makes routes in the MANET more stable and insensitive to host mobility. Simulation results show that our GRID routing protocol can reduce the probability of route breakage, reduce the number of route discovery packets used, and lengthen routes' lifetime.
TL;DR: In this article, a multi-layer network element for forwarding received packets from an input port to one or more output ports is presented, where a packet is examined to look for first and second forwarding information.
Abstract: A multi-layer network element for forwarding received packets from an input port to one or more output ports. The packet is examined to look for first and second forwarding information. A packet is also assigned to a class and provided with default packet forwarding information. An associative memory is searched once for each type of information. The results from the two searches are combined with the default packet forwarding information to forward the packet to the appropriate one or more output ports. In some instances, the results of the first search dominate the forwarding decision, in other, the results of the second search dominate the forwarding decision, and in still other instances, the default information dominates.
TL;DR: In this paper, the authors describe a router having a first memory for active routes and a second memory to store inactive routes, which can be used to dynamically store network routes for a communication network.
Abstract: Example methods and apparatus to dynamically store network routes for a communication network are disclosed. A disclosed example method involves receiving data via a router having a first memory to store active routes and a second memory to store inactive routes. A destination address associated with the data is identified and in response to detecting that no destination address entry stored in the first memory matches the destination address associated with the data, a default route stored in the first memory is selected to forward the data using a multicast transport protocol.
TL;DR: In this paper, a system and method for assisting in controlling real-time transport protocol flow through multiple networks via media flow routing is disclosed, where a second or intermediate computer performs an inbound screen on route information received from the first computer, to determine if the received route information should be discarded; if the route information is not discarded, comparing the received and screened route information to a local policy defined within the second computer, performing an outbound screen, prior to transmitting the received-and screened-route information to the first-computer, and selecting a primary route from the received
Abstract: A system and method for assisting in controlling real-time transport protocol flow through multiple networks via media flow routing is disclosed. A second or intermediate computer performs an inbound screen on route information received from the first computer, to determine if the received route information should be discarded; if the route information is not discarded, comparing the received and screened route information to a local policy defined within the second computer; performing an outbound screen on the received and screened information prior to transmitting the received and screened route information to the first computer; and selecting a primary route from the received route information and local route information in accordance with the local policy, wherein the primary route is a path from the second computer to the first computer via the group of associated computers.
TL;DR: In this paper, a route calculation server receives starting point data and destination data corresponding to a starting point and a destination which a user designates by the user terminal, and calculates a route from the starting point to the destination.
Abstract: The route calculation server receives starting point data and destination data corresponding to a starting point and a destination which a user designates by the user terminal, and calculates a route from the starting point to the destination. The map server includes a map database, and communicates with the user terminal via the network. The route calculation server stores calculated route data together with route identification information associated with the route data, and transmits the route identification information to the user terminal via the network. The map server receives the route identification information from the user terminal via the network, obtains the route data associated with the route identification information from the route calculation server, produces route display picture data including map picture on which the calculated route is represented, and transmits the route display picture data to the user terminal.