搜索资源列表
ComputeHurst
- 该代码为原创,用vc实现。代码实现的功能为计算网络流量的自相似指数hurst。里面包括了一个试验数据文件packetnumber1.dat,有需要的可以验证代码的正确性。-the original code using vc achieve. Code the function to calculate the flow of network self-similarity index hurst. Includes a pilot packetnumber1.dat data files, n
minSu3
- 利用lingo求解网络流量分配矩阵,网络节点数可修改,默认为20。首先输入K条路径矩阵以及其他网络信息,以最小化链路利用率的平方为优化目标对流量进行分配。-Use lingo solving network traffic assignment matrix, the network nodes can be modified, the default is 20. First, enter the path matrix K and other network information to m
FW
- Frank-Wolfe算法 被广泛应用于求解网络均衡流量分布问题,尤其是特别适用于UE规划问题的求解 -Frank-Wolfe algorithm is widely used to solve network equilibrium flow distribution problems, especially particularly suitable for UE Planning Problem