您可以使用这种类型的组件表示组织树图关系、路由链接拓扑和类似的应用程序。
You can use this kind of component for expressing the kinds of relationships you find in an organization chart, a router-link topology, and similar kinds of applications.
这些对象类型之间的关系是“一对多”，即每个策略可以拥有一个或多个路由对象。
The relationship between these types of objects is one-to-many, where each policy can have one or more route objects.
如果数据的所有关系可以简单地在成员之间划分，那么您将拥有更好的数据缓冲，但是有可能遇到事务路由问题。
If ownership of data is simply split between members, then you will have greater data buffering but you have the potential of having transaction routing issues.
运行时路由应该反映请求者和提供者之间的地理亲缘关系。
Runtime routing should reflect the geographic affinity between requester and provider.
通过确定连接器向哪个路由组传递邮件，可以在发送方与接收方路由组以及拓扑的其余部分之间建立关系。
Identifying the routing group to which the connector delivers messages establishes the relationship between the sending and receiving routing groups and the rest of your topology.
请求应该被路由到 nodeID参数中指定的 Dispatcher。这个参数是高密切关系请求的必需参数，因此必须在请求的 SOAP头部中设置。
The request should be routed to the Dispatcher that is specified in the nodeID parameter which is mandatory for high affinity requests and hence will be set in the request's SOAP header.
路由更新和拓扑信息只在建立邻接关系的路由器之间传递。
Routing updates and topology information are passed only between adjacent routers.
为了支持上述观点利用仿真工具SSFNET验证了“活锁”与路由联盟振荡的相互关系。
To support our viewpoint an experiment is designed by SSFNET, and the experiment result further demonstrates the relationship between "alive-lock" and confederation routing oscillation.
在分析路由属性与路由策略等概念的基础上，定义了路由行为与策略的一致性关系及两类违反一致性的情况。
Definitions were given to describe the attributes of the route, the policy, and the conformance relation between the behavior of the border gateway and the policies.
针对工作流建模的复杂性和模型的安全存取控制问题，提出一种通过建立任务节点和路由节点及其依赖关系来创建工作流模型的方法。
Due to complexity of modeling workflow and problems of secure access control, a method that makes a workflow model by setting up task nodes, route nodes and their dependency is brought forward.
数据的转发可以不用建立路由树，而是直接根据网格的相对位置关系转发。
It forwards packets based on the relative position of the grids rather than a routing tree.
同时给出了从BGP路由表中推理出as相互关系的启发式算法。
It presents heuristic algorithms that infer AS relationships from BGP routing tables.
提出了一种基于SNMP代理发现机制的三层拓扑发现方法，以发现路由器和子网之间的连接关系。
To discover the connections between routers and subnets, a method of discovering IP-level network topology based on SNMP Agents exploring mechanism is presented.
检查MP-BGP配置错误的方法要求每个ASBR或PE路由器分别为它所信任的AS维持一个地址前缀集和AS关系集。
This paper presents an approach which can detect MP-BGP configuration errors based on prefixes sets of neighboring ASes and the AS relationships.
该算法利用邻节点之间的关系，生成邻节点的转发路由表。
The algorithm generated neighboring nodes routing tables by analyzing the neighboring relations.
显示网络连接，路由表，接口统计数据、伪装链接和多播成员关系！
Print network connections, routing tables, interface statis-tics, masquerade connections, and multicast memberships.
显示网络连接，路由表，接口统计数据、伪装链接和多播成员关系！
Print network connections, routing tables, interface statis-tics, masquerade connections, and multicast memberships.
应用推荐