1) The communication between the trunk node and the destination node also adopts the distributed MIMO mechanism.

2) In the direct methods, the final destination node is selected in one step.

3) Only the source node and the destination node need operation of the asymmetric cryptographic algorithm once in a route computation.

4) When the destination node receives the frame the FCS number is recalculated and compared with the FCS number included in the frame.

5) Upon reaching the destination node the VLAN ID is removed from the packet by the adjacent switch and forwarded to the attached device.

6) In the iterative methods, the final destination node is determined through several iteration steps.

7) Through the location information of the destination node, L-ZRP could determine the packet forwarding domain so that it could limit the scope of the packet forwarding.

8) The destination node may be in another document, in which case the subtree is copied between documents.

9) Those nodes who are in the repair area will receive the packets from the destination node to know the routing path to reach the destination node.

10) In this paper, with the support of the QoS based initial route setup algorithms, based on resource sharing principles,[http:///destination node.html] QoS based destination node joining and leaving algorithms a.

11) Focusing on the AODV routing repair strategy and based on the hop count on the base path and the destination node, HAODV maintenances a repair area around the base path within certain number of hops.

12) The time the datagram remains on the Internet is measured in hops, where one hop represents one gateway on the datagram's path to the destination node.

13) We hope OSPF not only enable to find out the shortest path from the origin node to the destination node but also has the ability to allocate resource of the whole network by extending.

14) Unit data of the routing table should satisfy formula 1, i. e. for all adjacent nodes with the same destination node, the sum of their selection probabilities should be 1.

15) This method uses intermediate nodes' location information to create undirected graph at destination node, and uses Breath-First Search (BFS) algorithm to find another disjoint path.

16) The Destination Options header is used to carry optional information that need be examined only by a packet's destination node(s).

17) This function takes the source node and copies it over as a child under the destination node.

18) MGEAR established multi-path from the source node to the destination node.

19) In a WAN, when the data bits arrive at the destination node, transmission stops right there.

20) You create a pure vector-based drawing here and render a line here from source node to destination node.

21) This algorithm was based on MPH algorithm. It added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least.

22) Recursively copies all the nodes from source node to the destination node.