一个例外是在v8中，由于mqt路由限制，任何查询谓词引用的事实表列都必须包括在统计视图中。
An exception to this is in V8 where fact table columns referenced in any query predicate must be included in the statistical view definition due to MQT routing limitations.
客户端将与数据所在的服务器直接通信，因此，无需使用本身可能成为瓶颈和限制可伸缩性的路由组件。
Clients communicate directly with the servers on which the data is located, so there is no need for a routing component that could itself become a bottleneck and limit scalability.
如果没有足够的硬盘空间来传递消息，或者您的公司使用路由器控制来限制在环境中发送的消息的大小，那么这会造成问题。
This can cause problems if there is not enough disk space to transfer the message or if your company USES router controls to limit the size of messages sent in the environment.
如果将该服务器用作路由器，其中您只希望某些接口支持DNS，则可以使用此选项将请求限制到某些接口上。
You can use this to limit requests on certain interfaces if you are using the server as a router where you only want certain interfaces to support DNS.
但VPN解决方案中的路由和协议支持会受到一些限制。
But there are limitations to the routing and protocol support within a VPN solution.
一种更高级的配置包括一些设置，只要邮件数据库超过它的限额时这些设置就会限制路由器发送和接收新消息的能力。
A more advanced configuration involves Settings that limit the router's ability to send or receive new messages for as long as the mail database exceeds its quota.
业务部门却认为实现限额来限制通过路由器的消息的流动是不可接受的，会因此引起商业风险。
The lines of business felt that implementing quotas to restrict the flow of messages through the router was not acceptable and would create risk within the business.
同步块被限制在一个JVM上，请求被路由到集群中的另一个节点并引起接收节点中的并发异常，这种可能性仍然存在。
The synchronization block was limited to one JVM and a possibility still existed that a request is routed to another node in a cluster and causes the concurrency exception in the receiving node.
用于分发客户机请求的路由器的类型直接影响超级集群的应用和相关限制。
The type of router that is used to distribute client requests directly influences the use of a super cluster and its associated limitations.
可以使用服务器配置文档来配置LotusDomino环境，以便路由器限制用户向他们的邮件数据库传递消息的能力。
You can configure the Lotus Domino environment using a Server Configuration document so that the router limits users' ability to have messages routed to their mail database.
在本文中，您将了解如何避开目前ESB中的各种限制，并实现Web服务的运行时动态路由。
In this article you'll learn how to circumvent the current restrictions in ESB and implement dynamic routing at runtime for Web services.
同时，根据节点密度调整了路径长度限制，使得区域间的路由查询和路由维护能够更快地收敛。
Also, MZRP modifies the limit of route length based on the node density, and results in rapider convergence during route query and maintenance in IERP.
另外，如果提供更多的虚拟通道，该路由算法能使用这些额外的通道使限制的数目更少。
In addition, if more than the minimum number of virtual channels are available, the routing algorithm can use these additional channels with the fewest possible number of restrictions.
由于能量和存储空间的限制，其自组网协议必须维持较小的路由信息并尽可能地减少能量消耗。
Due to the limitation of power and memory size, the self-organized protocol must maintain small router information and reduce the power usage as much as possible.
该算法采用限制泛洪改进机制，解决了AODV路由协议报文的广播风暴问题，节约节点的能量消耗。
The agreement introduces restrictions on broadcast mechanism to solve the AODV routing protocol broadcast storm problem, and saves the energy consumption of node.
它使用限制计时器避免路由回圈-预设为180秒。
It USES holddown timers to prevent routing loops - default is 180 seconds.
该文探讨了包交换计算机网络中，具有端到端时延限制的多播路由问题。
This paper studies the problem of multicast routing with end-to-end delay constraint in packet-switched computer networks.
而路由器中的交换网络又是限制其容量和性能的主要因素。
Moreover, the switching system is the key factor which limits the performance and capacity of routers.
本发明能够在不增加硬件成本的基础上提高快速重路由的切换速度，并且既能保证网络稳定性，又不受中间节点个数的限制。
The invention can promote quick heavy-route switching speed without increasing hardware cost, guarantees network stability and is not limited by middle node number.
该文研究了多限制路径选择问题，提出了一种基于有限选择洪泛的源路由预计算的服务质量路由算法。
This paper discusses the NP-complete multi-constrained path problem, and a precomputation source routing algorithm based on limited selective flooding is presented.
提出了一种满足端到端时延限制的低代价多播路由算法。
A new heuristic algorithm is presented for constructing low-cost multicast tree with end-to-end delay constraints.
提出了一种满足端到端时延限制的低代价多播路由算法。
A new heuristic algorithm is presented for constructing low-cost multicast tree with end-to-end delay constraints.
应用推荐