When an interruption in a network topology occurs, the software running on the networking electronics calculates another route to the desired destination via an alternate available path.

:: Note: In networks that are based upon the partially connected mesh topology, the data that is transmitted between nodes in the network takes many shortest paths between nodes using a technology like Shortest Path Bridging, except in the case of a failure or break in one of the links, in which case the network uses the remaining alternative paths to the destination.

The topology determines the routing table presented to the Internet Layer which makes routing decisions based solely on the destination IP address found in IP packets.

Every destination in the topology table can be marked either as " Passive ", which is the state when the routing has stabilized and the router knows the route to the destination, or " Active " when the topology has changed and the router is in the process of ( actively ) updating its route to that destination.

* Routing table: Stores the actual routes to all destinations ; the routing table is populated from the topology table with every destination network that has its successor and optionally feasible successor identified ( if unequal-cost load-balancing is enabled using the variance command ).

There can be multiple successors for a destination, depending on the actual topology.

The successors for a destination are recorded in the topology table and afterwards they are used to populate the routing table as next-hops for that destination.

None of these techniques, however, makes any difference to the basic principles of EIGRP, which exchanges a vector of distances to each known destination network without full knowledge of the network topology, and, as a matter of fact, similar techniques have been used in other distance-vector protocols ( notably DSDV, AODV and Babel ).

In many cases, in order to hide the network topology and protect the service provider or enterprise packet network, the SBC will terminate a received call and initiate a second call leg to the destination party.

The primary ( successor ) and secondary ( feasible successor ) routes to a destination will be determined with the information in the topology table.

When each router receives a packet, it searches its routing table to find the best match between the destination IP address of the packet and one of the network addresses in the routing table.

As long as that directly connected route's interface is active, the BGP route to the destination will not be put into the routing table.

If a given route is withdrawn by a neighbor, and there is no other route to that destination, the route is removed from the Loc-RIB, and no longer sent, by BGP, to the main routing table manager.

If the router does not have a route to that destination from any non-BGP source, the withdrawn route will be removed from the main routing table.

This lookup table then allows future transmissions to be forwarded to the intended destination only.

Address information is only transferred to each node during a connection set-up phase, when the route to the destination is discovered and an entry is added to the switching table in each network node through which the connection passes.

This is identical to the way other programmers squeezed a series of jumps in a branch table, dispatch table, or virtual method table into a list containing only the destination addresses, and used a small selector to branch to the selected destination.

With hop-by-hop routing, each routing table lists, for all reachable destinations, the address of the next device along the path to that destination: the next hop.

This table contains a list of destination networks in the EIGRP-routed network together with their respective metrics.

Also for every destination, a successor and a feasible successor are identified and stored in the table if they exist.

In the diagrams, the dots mark the squares where the piece can move if no other pieces ( including one's own piece ) are on the squares between the piece's initial position and its destination.

When a pawn advances two squares from its starting position and there is an opponent's pawn on an adjacent file next to its destination square, then the opponent's pawn can capture it en passant ( in passing ), and move to the square the pawn passed over.

For example, if a player's " home " or destination corner is empty ( not an opponent's starting corner ), the player can freely arrange his / her pieces to serve as a ' ladder ' or ' bridge ' between the two opposite ends.

Each frame contains source and destination addresses and error-checking data so that damaged data can be detected and re-transmitted.

Ethernet establishes link level connections, which can be defined using both the destination and source addresses.

A Magic carpet, was legendary carpet that can be used to transport persons who are on it instantaneously or quickly to their destination.

Miguel Alcubierre theorized that it would be possible to create an Alcubierre drive, in which a ship would be enclosed in a " warp bubble " where the space at the front of the bubble is rapidly contracting and the space at the back is rapidly expanding, with the result that the bubble can reach a distant destination much faster than a light beam moving outside the bubble, but without objects inside the bubble locally traveling faster than light.

As a final destination, anyone can also reach Lebanon by ferry from Cyprus or by road from Damascus.

Public transportation systems include urban bubblecars ( individual pods which can be programmed to run on designated lines to the desired destination ) and monorails for longer distances.

The blitter's block copying mode takes zero to three data sources in memory, called A, B and C, performs a programmable boolean function on the data sources and writes the result to a destination area, D. Any of these four areas can overlap.

Many things can happen to packets as they travel from origin to destination, resulting in the following problems as seen from the point of view of the sender and receiver:

A packet's delay varies with its position in the queues of the routers along the path between source and destination and this position can vary unpredictably.

A boat can be ' worked to windward ', to arrive at an upwind destination, by sailing close-hauled with the wind coming from one side, then tacking ( turning the boat through the eye of the wind ) and sailing with the wind coming from the other side.

Travellers can also negotiate with car taxi drivers to go off-route for short distances for an additional charge if one's destination is not exactly on the car taxi's route.

Even though every packet has the same destination address, they can be routed on different paths through the network.

However, Venice's popularity as a major worldwide tourist destination has caused several problems, including the fact that the city can be very overcrowded at some points of the year.

The same process in reverse can be used to lower or circularize the apogee of a magsail's orbit when it arrives at a destination planet.

This could be important for interstellar travel because it means that deceleration at the destination can be performed with a magnetic parachute rather than a rocket.

For most services, the network provides a permanent virtual circuit ( PVC ), which means that the customer sees a continuous, dedicated connection without having to pay for a full-time leased line, while the service-provider figures out the route each frame travels to its destination and can charge based on usage.

The FECN bit can be set to 1 to indicate that congestion was experienced in the direction of the frame transmission, so it informs the destination that congestion has occurred.

Some stateful firewalls, like OpenBSD's pf ( 4 ) packet filter, can act as a proxy for connections: the handshake is validated ( with the client ) instead of simply forwarding the packet to the destination.

In fact, many datagrams in the same group can travel along different paths before reaching the same destination.

Network utilities like Ping can be used to determine the hop count to a specific destination.

It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined.