Synthesis of subscriber access network

3.2.1 Study sub item 2.1, 2.3.1, 2.3.2, 2.3.3 of the Key statements.

3.2.2 Build a cable network of subscriber's access for which the minimum of expenses for the line structure is provided.

There given: the list of network points (n = 10) and a matrix of distances between them. As the capacity of distance matrixes take advantage of weight matrix obtained while performing the Task 3.1 considering values of ribs weight as distances in kilometres. Absent elements values of weight matrix should be considered as infinitely big distances, i.e. physical cable laying between some pairs of points is impossible.

Cost of one line structures kilometre along all directions is the same and equal to 10 c.u.

3.2.3 On the synthesized network for which the minimum of the line structure cost is provided, define the point where it is expedient to place basic networks knot (BK) of subscriber's access from the point of view of minimization of the general extent of subscriber’s lines from BK to all subscriber's points (SP).

Remarks. For the synthesized network it is necessary to build a matrix of distances between all points of a subscriber's network which should be used as initial data for the solution of this problem.

3.2.4 For the organization of a subscriber's network with a stationary radio access it is necessary to provide selection of base station (BS) location, providing a resistant to radio communication at comparatively small power of the radio-transmitting set.

There given: the list of points (n =10) and a matrix of distances between them. As the last one take advantage of weight matrix obtained while performing the Task 3.1. Absence of matrix elements values should be considered as absence of directly radio visibility between them.

3.2.5 Show the problem set in the form of verbal and mathematical models, the results of their solutions matching to your initial data alternative and explanations to their solutions methods in the explanatory note.

3.2.6 Answer the following key questions in writing:

- What is the assignment of subscriber's access network?

- List requirements which the solving the problem of minimum cost network synthesis should satisfy.

- What graph is called covering tree?

- Formulate the idea of Tonic algorithm providing minimum cost network setting.

- Can Tonic algorithm be applied for minimum cost network setting? If it can, then what way?

- Can Tonic algorithm be applied at incomplete initial distances matrix? What does it mean?

- Is Tonic algorithm exact or heuristic?

- What apex is called a graph median? What are initial data for its definition?

- Formulate algorithm of graph median definition by a matrix of distances between all pairs of graph avertices.

- What vertex is called the graph centre?

- Formulate the algorithm of graph centre definition.