4-随机化教程.ppt

3-* Bittorrent schematic Seed (peer with entire file) peer peer peer new peer tracker 3-* Bittorrent: 为谁上载? Tit-for-tat: 为哪些在过去30秒内为自己提供上载最多的对等体提供上载服务(默认4个对等体) ? 刺激各个对等体去上载，从而自己可以被其他节点选择作为服务的对象! 3-* Bittorrent : 发送哪一个片? Rarest-first: 在自己邻居中选择在组中最少的那一片 1 2 1 1 2 3 * Since the biggest problem in network design today is the uncertainty in the traffic matrix, let’s say a few words about it. 网络设计的最大问题网络流量矩阵的不确定性； This is a sample traffic matrix for the backbone network. In general, for a network with N nodes, the traffic matrix is an NxN matrix whose (i,j)th entry gives the rate of demand from node i to node j. If we want to know the future traffic matrix, there are N^2 numbers that have to be predicted, which is extremely difficult to do. 》预测骨干节点到节点的流量是十分困难的；n*n个元素的值都需要预测； On the other hand, the aggregate rate in and out of a node is much easier to predict. 》流入某个节点或者流出某个节点的流量相对容易预测； 日夜模式；区域的人口数量都有关系；有不少方法可以预测； In this picture, backbone node i is connected to some access networks on one side, and the rest of the backbone on the other side. The aggregate rate r_i is easily known or estimated. For example, it can be the total access capacity coming into the node, or can be estimated based on the population of the region. The aggregate rate corresponds to the row and column sums of the traffic matrix, which are only N numbers. 观测，预测； 相当于预测 流量矩阵的某行或者某列的和； 相对容易一些； * 物理网络布好之后，可以通过覆盖网络或者隧道的技术让每个节点直接都有连接； Here is the homogeneous同性质的, 同类的 network that we’ve just seen. The backbone nodes are interconnected by physical links, which are represented with a cloud. * We establish a full mesh of circuits over the underlying physical topology. 在低层物理网络上，建立全连接线路 Routing is done in two stages on the full mesh. … 路由通过2阶段； 如果所有的链路的带宽 能够达到2r/N，可以对付所有的流量； This means, with a total link capacity of 2r at each node, we can serve all traffic matrices. I believe this is only possible with load balancing, and the scheme has been proved to be optimal by Keslassy. 负载均衡；开销较小； This also means, i