Аноним

Broadcasting problem: различия между версиями

Материал из WikiGrapp
нет описания правки
(Новая страница: «'''Broadcasting problem''' --- проблема широковещания. The '''broadcasting problem''' is the problem of information dissemination described in…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Broadcasting problem''' --- проблема широковещания.  
'''Broadcasting problem''' — ''[[проблема широковещания]].''


The '''broadcasting problem''' is the problem of information dissemination described in a
The '''broadcasting problem''' is the problem of information dissemination described in a
group of individuals connected by a communication network. In
group of individuals connected by a communication [[network]]. In
broadcasting, one node knows a piece of information and needs to
broadcasting, one [[node]] knows a piece of information and needs to
transmit it to everyone else. This is achieved by placing
transmit it to everyone else. This is achieved by placing
communication calls over the communication lines of the network. It is
communication calls over the communication lines of the network. It is
Строка 9: Строка 9:
at any given time, and communication between two nodes takes one
at any given time, and communication between two nodes takes one
unit of time. This model implies that we will deal with connected
unit of time. This model implies that we will deal with connected
graphs without loops and multiple edges to model the communication
[[graph, undirected graph, nonoriented graph|graphs]] without [[loop|loops]] and multiple [[edge|edges]] to model the communication
network. Note also that, depending on their cases, we will either
network. Note also that, depending on their cases, we will either
consider a half-duplex or a full-duplex model. In the letter, when
consider a half-duplex or a full-duplex model. In the letter, when
communication takes place along a communication line, the information
communication takes place along a communication line, the information
flows in both directions, while in the former only one direction is
flows in both directions, while in the former only one direction is
allowed. Hence, in the half-duplex model, we will deal with directed
allowed. Hence, in the half-duplex model, we will deal with [[directed graph|directed graphs]], while we will consider undirected graphs in the full-duplex
graphs, while we will consider undirected graphs in the full-duplex
model.
model.
==See also==
==See also==
*''Gossiping problem''.
* ''[[Gossiping problem]]''.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.