Optimal Design And Algorithm On Broadcast Networks In F Mode

Along with the development of computer technique, in the Internet information delivering already cause the large expert with the scholar's interest. How to make sure the information delivering time, how to optimize information delivering path for saving network resources etc., is putting in front of people being very having the realistic meaning. In the communication network it is a very important problem to optimize broadcasting.In the classic's broadcast there are three familiar communication methods: one is Whisper mode, a point taking the information can deliver its only one next point the information a time; one is Shouting mode, a point taking the information can deliver its all next points the information a time; another is c mode, a point taking the information can deliver some next points the information a time, the number of the points is not more than c.A new communication method, i.e. f mode, is putted forward in this text, and in this mode following problems in broadcasting are studied. Firstly, how to decide the place of source in order to minimum broadcasting time? An algorithm is provided to look for the optimal source or sources, and the generalization of the algorithm in a connected graph is studied. Secondly, how to decide the structure of a graph to minimum broadcasting time? We newly define the minimal broadcasting graph in f mode, and prove the rationality of the definition. We study the essential characters of the minimal f-broadcasting graph and the especial qualities in an special f, which is familiar in the competition self-combination network. Thirdly, how to decide the broadcasting schedule if the place of the source and the structure of the graph is given? We provide and prove an algorithm to make sure the optimal broadcasting schedule with arbitrary source in an connected graph. Finally the problem of fault broadcasting is studied. In fact, fault is always exists. Then in this case the question of broadcasting is different. In here we study k-fault broadcasting graph in f mode, and give an algorithm to decide the least time in the minimal k-fault f-broadcasting graph. All factors are studied qualitatively.