By predicting the destination node channel, each node can communicate with each other.
利用预算出的目标节点的工作信道进行节点之间的通信。
This function takes the source node and copies it over as a child under the destination node.
此函数接受源节点，并将其作为子节点复制到目标节点下。
The destination node may be in another document, in which case the subtree is copied between documents.
目标节点可以在另一个文档中，在这种情况下，在两个文档之间复制子树。
Then the destination node jointly decodes the messages from the source and relay nodes. We call such a procedure as a network LDPC code.
目的节点可以利用源节点和中继节点的信息进行联合译码，我们称之为网络LDPC编码。
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.
在该区域中的节点，将会收到目的节点的跳数报文，获得到达目的节点的路由。
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.
数据报在因特网上保持的时间以跳跃点(hop)衡量，其中一个跳跃点表示数据报通向目的地节点路径上的一个网关。
Using iterative and maximum a posteriori decoding method, the information can be obtained at the destination node by decoding the codes received in different time.
目的节点采用迭代最大后验概率译码，利用多个时刻收到的码字恢复源 节点发送信息。
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.
通过目的节点的位置信息，L -ZRP能够确定一个包转发域，以此来限制包转发的范围。
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.
因此，我们希望通过对OSPF进行扩展，使它不仅能找到从源点到目的点数据传输的最短路径，而且具备调配整个网络资源的能力。
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.
该算法基于MPH算法的基本思想进行扩展，在满足时延限制条件和多播树代价增加最小的基础上，逐步将目的节点添加到多播树上。
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.
该协议在路由发现以后，以所发现的路径做为基础路径，在其周围一定跳数范围内维护了一个路径修复区域。
It does not necessarily mean that administrative access is possible on any node, but all legitimate destination objects authorized to the hub are vulnerable.
这不一定意味着可以对任何节点进行管理访问，但是被授权访问中心的所有合法目的地对象都很容易受到攻击。
The updated application is extracted to the install destination of the node at the end of synchronization operation.
在同步操作最后，会将已更新的应用程序提取到节点的安装目的地。
When the master repository configuration is synchronized with a node, the application configuration is replicated in the node level repository and extracted in the application install destination.
当主存储配置与节点同步后，应用程序配置将复制到节点级别的存储库中，并提取到应用程序安装目的地中。
In the iterative methods, the final destination node is determined through several iteration steps.
迭代的方法通过几个迭代步骤确定最终目标节点。
At the receiving end, there should be another intermediary node that can decompress and forward the message to its ultimate destination.
在接收端应该有另一个中介体节点，它可以对消息进行解压缩并将消息转发给最终目的地。
Using the hub in this way enables any spoke node to access any destination in the entire network.
以这种方式使用中心将使任何分支节点都能访问整个网络中的任何目的地。
This type of profile is the destination for the migrations of a node both in a cell and not in a cell, although the Custom profile is recommended for federated nodes.
此类概要是计算单元内和计算单元外的节点的迁移目的地，但是对于联合节点建议使用自定义概要。
In the direct methods, the final destination node is selected in one step.
直接方法在一个步骤中选择最终目标节点。
openMosix transparently migrates a process to another node if the load-leveling algorithm thinks the destination has a smaller work load and it is feasible to migrate the process.
如果负载均衡算法认为另一个节点的工作负载较小，而且适于迁移进程，那么openMosix会透明地将进程迁移到目标节点。
For a social graph, these node IDs will be user IDs, but in a graph storing "favorite" tweets, the destination may be a tweet ID.
对于一个社会化网络图，这些顶点id即用户id，但是对于“收藏”推文这样的边，其目标顶点(destinationid)则是一条推文的id。
The destination of a (rerouted) message in a network; the final node.
网络中(重新邮送的)报文的目的地；最终的网点。
The ran information is transferred in RIM containers from the source ran node to the destination ran node by use of messages.
RAN的信息被包含在RIM容器做为消息的一部分从源ran节点到目的RAN节点进行传递。
Multicast algorithm is to build a multicast tree from the source node to destination nodes, and to assign wavelength.
组播算法就是要建立一棵从源节点到目的节点的组播树，并给这棵组播树分配波长。
After consulting the LIB, the MPLS node forwards the packet toward its destination.
经过查找LIB之后，MPLS节点将包转发给它的目的地。
When the network become enough big, there are usually more than one shortest routes from the source node to some destination nodes, and therefore the SPT also will not be the only one.
当网络变得足够大时，从源结点到一些目的结点的最短路径常常不只一条，而由此构成的SPT也就不是惟一的。
The SGSN connected to the destination RAN node decides which RAN node to send the message to based on the destination address or on the RIM routing address.
连接到目的RAN节点的SGSN将根据目的地址或RIM路由地址来决定给哪个RAN节点发送消息。
The SGSN connected to the destination RAN node decides which RAN node to send the message to based on the destination address or on the RIM routing address.
连接到目的RAN节点的SGSN将根据目的地址或RIM路由地址来决定给哪个RAN节点发送消息。
应用推荐