Description: A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which
resource demands take place, and a collection of arcs whose capacities have multiple operational states. Platform: |
Size: 114503 |
Author:郑林 |
Hits:
Description: A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which
resource demands take place, and a collection of arcs whose capacities have multiple operational states. Platform: |
Size: 114688 |
Author:郑林 |
Hits:
Description: 本文将排队论(又称随机服务系统)的思想和方法应用到校园信息网线路调节收费问题中，建立了相应于网络收费方案的用户与服务端口的M/M/n/n排队模型，对端口的利用率，用户能被服务的概率等，给出了合理的算式。合理的提出了该校网络按时间长收费的价格参照表。最后，对M//n/n排队模型进一步优化，在改进模型中，我们加入了用户网络流量与设备利用率的关系，从而使价格的制定更加合理，使设备的利用率进一步提高。文章还收集、整理了某高校校园网网络管理中的实际数据，代入模型进行实证分析，获得了相关技术指标。-In this paper, queuing theory (also known as stochastic service system) of ideas and methods applied to the campus information network in the line-conditioning charges, set up a charging scheme in the network of users and service port of the M/M/n/n queuing model on the utilization of the port, the user can be the probability of such services, given a reasonable formula. Put forward a reasonable time the school network by charging the price of the light table. Finally, the M// n/n queuing model was further optimized to improve the model, we joined the user utilization of network traffic and equipment, in order to enable the formulation of a more reasonable price, so that to further improve the utilization of equipment. The article also collect, organize a campus network in a practical network management data into the model, empirical analysis, access to the relevant technical indicators. Platform: |
Size: 36864 |
Author:姜某人 |
Hits:
Description: 介绍计算机算法的设计方法与分析技巧。主要内容包括：算法概述、递归与分治策略、动态规划、贪心算法、回溯法、分支限界法、随机化算法、线性规划与网络流、NP完全性理论与近似算法等。书中既涉及经典与实用算法及实例分析，又包括算法热点领域追踪等。-ntroduce the design method and analysis technique of computer algorithm. The main contents include: algorithm overview, recursive and divide and conquer strategy, dynamic programming, greedy algorithm, backtracking method, branch and bound method, stochastic algorithm, linear programming and network flow, NP completeness theory and approximation algorithm. The book includes both classic and practical algorithms and examples of analysis, including hot-spot tracking algorithm. Platform: |
Size: 95123456 |
Author:王懿 |
Hits:
Search - stochastic-flow network