文件名称:rongliangfenpei
介绍说明－－下载内容均来自于网络，请自行研究使用
星形网络设计环境要求：Windows2000/XP/7
功能要求：
设有n个节点（依次编号为１、２、……，ｎ）和一个中心，每个节点都有ni个终端，每个终端至节点的报文达到率都相等为λ，报文长度都相等为１／μ，确定该网络设计的总容量为C，编写一个程序，对于输入节点数ｎ、ｎｉ、λ、μ，算出网络的最佳容量分配及相应的延时。注意，一条链路的平均延时时间计算参考公式T=1 /(μC-λ)，其中１／μ是以比特为单位的报文分组平均长度；C是以该链路的容量，单位是比特/秒；λ是平均流量，单位是分组/秒。
以ｎ＝7，λ＝0.006报文／秒，1／μ＝1000比特／报文，C=4500bit/s，7个节点的终端数分别为5、4、3、4、3、2、3为例运行程序得出结果。
若n=8，8个节点的终端数分别为6、5、4、3、4、3、2、3得出结果。并对结果进行比较。-Star network design environment requirements: Windows2000/XP/7 functional requirements: with n nodes (sequentially numbered 1,2, ......, n) and one center each node ni terminals, each terminal to node packet reaches rates are equal to λ, packet length is equal to 1/μ, determine the total capacity of the network design for C, write a program to input nodes n, ni, λ, μ, calculate network optimal capacity allocation and the corresponding delay. Note that the average delay time of a link is calculated by reference to the formula T = 1/(μC-λ), where 1/μ is in units of bits of the packet average packet length C is the capacity of the link, the unit is bits/sec λ is the average flow rate in units of packets/sec. With n = 7, λ = 0.006 packets/second, the number of terminals 1/μ = 1000 bits/packet, C = 4500bit/s, 7 respectively 5,4,3,4,3,2,3 node Run the program as an example the outcome. If n = the number of terminals 8,8 nodes were 6,5,4,3,4,3,2,3 outcome. And the results were compared.
功能要求：
设有n个节点（依次编号为１、２、……，ｎ）和一个中心，每个节点都有ni个终端，每个终端至节点的报文达到率都相等为λ，报文长度都相等为１／μ，确定该网络设计的总容量为C，编写一个程序，对于输入节点数ｎ、ｎｉ、λ、μ，算出网络的最佳容量分配及相应的延时。注意，一条链路的平均延时时间计算参考公式T=1 /(μC-λ)，其中１／μ是以比特为单位的报文分组平均长度；C是以该链路的容量，单位是比特/秒；λ是平均流量，单位是分组/秒。
以ｎ＝7，λ＝0.006报文／秒，1／μ＝1000比特／报文，C=4500bit/s，7个节点的终端数分别为5、4、3、4、3、2、3为例运行程序得出结果。
若n=8，8个节点的终端数分别为6、5、4、3、4、3、2、3得出结果。并对结果进行比较。-Star network design environment requirements: Windows2000/XP/7 functional requirements: with n nodes (sequentially numbered 1,2, ......, n) and one center each node ni terminals, each terminal to node packet reaches rates are equal to λ, packet length is equal to 1/μ, determine the total capacity of the network design for C, write a program to input nodes n, ni, λ, μ, calculate network optimal capacity allocation and the corresponding delay. Note that the average delay time of a link is calculated by reference to the formula T = 1/(μC-λ), where 1/μ is in units of bits of the packet average packet length C is the capacity of the link, the unit is bits/sec λ is the average flow rate in units of packets/sec. With n = 7, λ = 0.006 packets/second, the number of terminals 1/μ = 1000 bits/packet, C = 4500bit/s, 7 respectively 5,4,3,4,3,2,3 node Run the program as an example the outcome. If n = the number of terminals 8,8 nodes were 6,5,4,3,4,3,2,3 outcome. And the results were compared.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
rongliangfenpei
...............\rongliangfenpei.cpp
...............\要求.doc