查询词典 balancing network

DNS load balancing is probably the simplest method to build network service cluster.

基于DNS的负载均衡可能是构筑网络服务集群的最简单的方法。

Through simulation,the new algorithm has better performance than classical method in balancing nodes' energy costs as well as extending the lifetime of the network.

通过与传统分簇算法的仿真比较证明新算法有效地均衡了网络中节点的能耗，延长了网络生命周期。

To solve QoS-constrained routing problem and the problem of balancing network load, an algorithm based on tabu search is proposed, which has a better ability of balancing the cost of the multicast tree and the network load; upon this algorithm, a new algorithm based on degree-constrained and load-balance is proposed, which has a nicer integrative performance on equipoise the cost of multicast tree and the load of links and nodes.

2针对网络负载均衡的QoS问题，提出基于禁忌搜索的负载均衡QoS组播路由算法，算法能平衡组播树代价和网络链路负载均衡状况；在此基础上提出了基于度约束和负载均衡的QoS组播路由算法，算法在满足QoS约束的基础上，均衡了组播树代价、网络链路负载和节点负载三者之间的关系，综合性能良好。

In the three phases submerged electric furnace of ferroalloys, because of the difference of the length and arrangement of the short network and the difference of the voltage of the short network , the way of using the current balancing can not make the three electrodes get the same power (that means there are strong phase and weak phase), and this effects the remelt result.

矿热电炉由于短网的长度与布置不同，短网压降不同，采用电流平衡的结果使得三根电极不能得到同样的功率，影响冶炼效果。

In the computer simulation aspect, following work has been down:At first, the Wolfgang Schreiner's model is employed and extended to a new computer arteriole optimal growing model. Many new algorithms are described, such as signal tracing, resistance calculating, resistance balancing and flow balancing. With these algorithms and methods, the arteriole networks can be grown successfully on microcomputer.Secondly, a growing-network ordering method, which is called auto-centripetal ordering method of the growing networks, can be employed to order the growing networks to calculate the average parameters of the networks in level series.

在计算机模型及仿真方面：首先本文改进、推广了WolfgangSchreiner模型，提出小动脉计算机优化生长模型，以及信号灯追踪、计算网络阻力、阻力平衡和流量平衡新算法，利用这种模型和算法成功地在微机上生长出了小动脉网络；第二，本文提出生长网络自动向心分级法，对生长网络进行了自动分级，并将网络参数的分级统计结果与A。

To obtain efficient survivability, this paper presents a novel restorable lightpath selection algorithm based on the automatically switched optical network frame. A numerical simulation is made in term of this routing selection algorithm. The result shows that the traffic has an obvious balancing trend; the block probability of connection requests has been reduced. At the same time, this algorithm has an excellent performance on bandwidth utility and sharing of the restoration resources.

摘要为了获得高效的网络生存性能，基于自动交换光网络的框架，该文提出了一种新型的可恢复路径选择算法-联合可变权重可恢复路径选择算法，并进行了数值仿真分析，仿真结果表明，此恢复路径选择算法具有明显的业务量均衡能力，并降低了动态连接请求的阻塞概率，同时具有良好的带宽利用率和恢复资源共享效率。

In this paper, firstly, that is analyzed which is the systemic composition of cluster network parallel computing, message passing environment: PVM, parallel programming of PVM on Win32 platform, scheduling strategy of load balancing and the general model of scheduling problem and stimulatingly the factors affecting the scheduling efficiency are summarized.

基于上述工作，结合&网络并行计算的可视化研究&问题，在可移植异构的并行开发环境PVM，本文设计和开发了一个可视化的并行调度程序。程序用C++编写，通过渊用PVM库函数提供对并行虚拟机的访问。

A major challenge of the heterogeneous wireless networks is how to jointly utilize the resources of different radio access technologies in an efficient manner. Because of the different system capacities of BS/AP and ununiformity of traffic distribution in different cells, quantities of new calls may be blocked in the overloaded cell in some hot spots; whereas its neighboring under-loaded BS/AP have superfluous bandwidth. In order to raise resource utilization of heterogeneous networks, several novel load balancing strategies are proposed, which combine the call admission control and multi-hop routing protocol of ad-hoc network.

异构无线网络的主要挑战是如何高效利用各种接入网的无线资源，针对异构无线网络基站或AP的容量差异及业务分布不均，导致通信热点地区的新呼叫因负载过重大量阻塞，而相邻轻负载小区却有容量盈余的现象，本文提出了几种联合呼叫接纳控制及ad hoc网络多跳路由算法的负载均衡策略，以提高整个异构网络的资源利用率。

A two-tier overlay network model is presented in this paper. Some consecutive nodes form an unstructured group and different groups are connected by a globally structured overlay with the Chord protocol. The model uses the Hilbert-based level search and the dynamic load balancing policy of a two-tier ring structure on top of the overlay network.This strategy has not only the characteristics of load balancing but also enough flexibility for searching.

Chord模型可以保证搜索系统中特定数据对象的跳跃次数在O的范围内，但只能根据数据对象的键进行准确匹配查询，不支持多关键字、部分关键字、通配符或是参数取值区间组成的复杂查询[1]；其次，相容散列的理论证明了当系统中有N个结点和K个键值的情况下，在每个结点上运行O个虚拟结点时，每个结点的键值范围可以无限趋于K/N。

Computation mobility is very important in balancing network workloads and resource towards computing.

计算的移动在计算机网络的负载平衡以及资源倾向性的计算中都有很重要的意义。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。