| Summary: | 碩士 === 國立嘉義大學 === 資訊工程研究所 === 95 === Data dissmination is an important operation for information acknowledgement in communication networks. Broadcast is one of the most commom used data transmission method. There are three models of broadcast: telephone-like model, non-simultaneous model, and simultaneous model. In the simultaneous model, at any unit of time, a node can take one of the following four actions: (1) send a message to an adjacent node, (2) receive a message from an adjacent node, (3) send a message to an adjacent node and receive one message from a different adjacent node, or (4) do nothing. This thesis uses a connected graph to model a communication network to solve broadcasting problems by simultaneous model. The vertices of graphs represent the nodes in the network, and the edges represent the links between nodes. There are three problems that are often considered in broadcasting: (1) Where is the best allocation for the originator? (2) Which design is the best broadcast scheme? and (3) What is the minimum broadcasting time in a given topology? This thesis presents the results for the three problems above in some commom used network topologies such as trees, and grid graphs, etc.
|
|---|
