路由寻找

词组短语

path finding

与路由寻找相关的网络例句 [注：此内容来源于网络，仅供参考]

In this paper,a new routing approach based on discrete particle swarm optimization algorithm is briefly discussed to obtain the optimum path between two nodes in the network.

针对不同的网络实际条件，提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。

We used column generation to solve the Network Coding based traffic programming problem. First, we relaxed the constraints of the problem by using Lagrange Relaxation, then defined the physical meaning of each relaxation variable.

运用column generation算法对网络编码业务进行规划，为松弛系数赋予具体的物理含义，并据此进行路径更新，有针对性地为每个业务寻找路由。

The multicast routing problem that finding the minimum cost multicast routing tree with many QoS constraints may be formalized to Steiner tree problem in network, which is a NP-complete problem that an algorithm that finds a Steiner tree can not get the best solution in polynomial time.

寻找有多个QoS约束的最小代价组播路由树可以形式化为网络中的Steiner树问题，它是一个NP完全问题，在多项式时间内不能得到最优解，因此研究者所寻求的是一种次优的、在最差情况和平均情况下的性能都接近于最优的解决方案。

To enhance security in Ad-Hoc networks,it is important to evaluate the trustworthiness of other nodes without centralized authorities.In this work,authors focus on the evaluation of trust evidence in Ad Hoc networks.First,the authors introduce the metrics of the trust,the evaluation process is modeled as a path problem on a directed graph,where nodes represent entities,and edges represent trust relations.Using the theory of semirings,a trust evaluation model based on semiring（TD-SEMIRING） is developed,then two nodes can establish an indirect trust relation without previous direct interaction and introduce the application of this model in route election.At last,the feasibility of this model is analyzed.

讨论了对可信事件的评估：首先介绍了可信的相关概念和相关的特性；接着评估过程被建模成一个在有向图寻找最短路径的问题，在该有向图中结点表示实体或者用户，边表示可信关系，通过使用半环理论，建立了一个基于半环的可信性评估模型TD-SEMIRING，在两个以前没有进行相互操作的实体之间建立间接的可信关系，介绍了这个模型在路由选择当中的应用；最后，通过仿真实验，验证、分析了该模型的有效性。

Implementing this approach involves finding all functions and methods that send requests to the server, and rerouting them.

实现这个步骤包括寻找所有发送请求给服务器的函数和方法，对它们重新路由。

A method for retransmitting data in overlay route network include forming overlay route network by laying overlay network node in existing bottom layer network for providing totally transparent overlay route and data retransmission service between user hosts being switched in, packaging and retransmitting as well as unpackaging user IP packet in data retransmission course then sending it to destination host for raising end to end transmission performance.

覆盖路由网络中数据转发的方法属于覆盖网络中的路由和转发技术领域，其特征在于：通过在现有底层网络中部署覆盖网络路由节点形成覆盖路由网络，为接入的用户主机之间提供完全透明的覆盖路由和数据转发服务，在数据转发过程中，用户的IP分组被封装、转发、解封装，最终发送到目的主机，实验表明在较小规模的覆盖路由网络的全连接拓扑里，同时使用跳数受限机制寻找到的路由路径会比Internet路由性能更高，而且底层网络出现故障时，覆盖路由网络能迅速绕过故障区域，从而提高了端到端的传输性能。