2.1.1 Task № 2.1:
- using basic data of topology of network of IP (picture 2.1), it is necessary to choose the shortest way on the method of Daxter
between tops 1 and 5;
- the choice of variant of tasks comes true on the list of magazine of teacher;
- scan a two-color image on lines (to two colors dark-and-light will correspond 0 and 1). As a result will get the binary vector of data are basic data for, presented on a picture 2.1, driven to application B
pic 2.1 – Initial topology of network
- - To select the list of tasks carried out by the magazine of the teacher:
- To determine the shortest route to an IP network between routers Dijkstra method;
- Describe the operation of the network protocols. Options are presented in Appendix G.
2.1.2 Methodical pointing to the job № processing 2.1. An algorithm of Дейкстры is the algorithm on columns, invented by the scientist of Netherlands Э. Дейкстрой in 1959. Finds the shortest distance from one of tops of count to all other. An algorithm is widely used in programming and technologies, for example, he is used by protocols of routing of OSPF (Open Shortest Path First) and IS - IS (Intermediate System to Intermediate System).
Thus in this algorithm to every top of count, where a router is set, we will confront a mark - well-known distance is minimum from one top to other. An algorithm works incrementally - on every step he visits one top and tries to decrease marks. Work of algorithm is completed, when all tops are visited.
We will consider an example implementation of algorithm on the example of topology of network of the telecommunications, presented on a picture 2.2, consisting of four routers. Between routers there are channels. Distance between routers oh The numbers of tops mark in mugs.
Picture 2.2 is Count of network
The mark of initial top of "а" relies equal to the zero, marks of other tops of endlessness. What this means is that distance from "а" to other tops while unknown (picture 2.3).
tops.
Picture 2.3 is the Zero stage
A zero stage is fixed on only purpose to specify an eventual site with a top "1", the mark of that is equal to the zero.
A top has a minimum mark 1. Her neighbours are tops 2 and 3 (picture 2.4).
Picture 2.4 is the First step
First in turn neighbour of top 1 is a top 2, because a way to her is minimum (5). Thus a pathlength is equal to the sum of the shortest distance to the top 1, id est 0+5=5. This value less current mark of top 2, endlessnesses, therefore the new mark of a 2-1 top is equal to 5 (picture 2.5).
Picture 2.5 is the New mark of the first top
We will continue analogical operations with a top 3 (picture 2.6)
Picture 2.6 is the New mark of the third top
All neighbours of top 1 tested. We will blot out her from a count, to mark that this top is visited (picture 2.7).
Pic. 2.7 – New mark of the third top
Again we find the nearest from the unvisited tops. It is a top 2 with the current shortest distance to her equal five (picture 2.8).
Picture 2.8 is Visit of top 2
Again we try to decrease the marks of neighbours of the chosen top, trying to get in them through the second top. By the neighbours of top 2 there are 3 and 4. First in turn neighbour of top 2 is a top 1, but she is already visited, therefore with the first top nothing we do. A next neighbour is a top 3, because she has a minimum mark from the tops (8) marked however visited. If to go to her through a top 2, then length of such way will be equal to 16 (5+11). But current mark 3 tops 8 is equal<16, a mark does not change therefore.
Picture 2.9 is Visit of top 2 (a mark does not change)
Another neighbour of top 2 is a top 4. Way to her through a top 2 14. will make Because 14<, we set the mark of top 4 equal 14 (picture 2.10).
Picture 2.10 is Visit of top 4
All neighbours of top 2 tested. We will blot out her from a count, to mark that this top is visited (picture 2.11)
.
Picture 2.11 is Mark of top 2 as noted
We repeat like choosing a top 3 (picture 3.12). As a result of treatment she will be canceled.
Рисунок 2.12 – Отметка вершины 3 как помеченной
Повторяем для оставшейся вершины 4 (рисунок 2.13).
Picture 2.13 is Mark of top 4 as noted
Completion of implementation of algorithm takes place then, when all tops are canceled. As a result got short cuts from a top 1 to 2 5 makes, to 3 8 makes and 4 14 makes.
2.1.2 Methodical pointing to implementation of work 2.1.2. In accordance of variant to study and describe work of network protocol.
List of reductions
PC is the personal computer
FEET - a network is telephone the general use
ARP (Address Resolution Protocol) is protocol of permission of addresses
DHCP (Dynamic Host Configuration Protocol) is protocol of dynamic configuration of host
DNS (Domain Name System) is the system of the domain names
FTP (File Transfer Protocol) is protocol of exchange by files
H.323 is a stack of protocols for a transmission audio and video informations on a network
HDLC - hdlc
HTTP is protocol of transmission of hypertext
ICMP is protocol of межсетевых signalling messages
IGMP is management protocol by the groups of Internet
IRC is protocol of communication of users
IS - IS (Intermediate System to Intermediate System) is protocol of routing of the intermediate systems
ISUP (ISDN User Part) is an user ISDN
IP (Internet Protocol) is межсетевой protocol
MGCP (Media Gateway Control Protocol) is management protocol by sluices
MPLS – многопротокольная коммутация по меткам
SSH – безопасная оболочка
RMON – расширение SNMP
RTCP (RTP Control Protocol) – протокол, использующийся совместно с RTP.
RTP (Real-Time Transport Protocol) – протокол для передачи данных реального времени
RIP (Routing Information Protocol) – протокол маршрутизации
RTSP – потоковый протокол передачи реального времени
RSVP – протокол резервирования ресурсов
OSPF (Open Shortest Path First) – выбор кратчайшего пути
SCTP – новый транспортный протокол
SIP (Session Initiation Protocol) – протокол инициирования сессий
SNMP – простой протокол управления сетью
SMTP – простой протокол передачи электронной почты
TCP (Transmission Control Protocol) – протокол управления передачей
UDP (User Datagram Protocol) – протокол пользовательских датаграмм
VoIP – голос поверх IP
Appendix А
Basic data to a task №1
Variant 1 | Variant 2 | Variant 3 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Variant 4 | Variant 5 | Variant 6 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Variant 7 | Variant 8 | Variant 9 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Variant 10 | Variant 11 | Variant 12 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч |
Continuation of appendix A
Variant 13 | Variant 14 | Variant 15 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Variant 16 | Variant 17 | Variant 18 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Variant 19 | Variant 20 | Variant 21 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||
Variant 22 | Variant 23 | Variant 24 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч |
Continuation of appendix A
Variant 25 | Variant 26 | Variant 27 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Variant 28 | Variant 29 | Variant 30 | |||||||||||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | ||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | |||||||||||||
Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч | Ч |
The Task appendix B to RGR№1.2
Variant | |||
Procedures | Automatic detection of the gatekeeper (Н.323) | Process of registration, registration cancellation (Н.323) | Connection of terminals without gatekeeper (Н.323) |
Variant | |||
Процедуры установления соединения | Via the readdressing server (SIP) | Via the proxy server (SIP) | Between terminals H.323 |
Variant | |||
Procedures | Management of access to network resources (Н.323) | Determination of location of the equipment in a network (Н.323) | Poll of current state of the equipment (Н.323) |
Variant | |||
Procedures Н.323 | Release of a pass-band | Detection and registration of the device | Establishment of an intra-zone call |
Variant | |||
Procedures Н.323 | Poll of current state of the equipment | Release of a pass-band | Teams of management protocol. Н.245 |
Variant | |||
Procedures | Establishment of connection on to protocols. Н.245 | Termination of a communication session (Н.323) | Connection of SIP from FEET |
Variant | |||
Procedures | Н.323 Connection of SIP from FEET | Н.323 separation of a session | The elementary call by the SIP protocol |
Variant | |||
Procedures | СТОП-IP-СТОП | СТОП-VoIP | VoIP- СТОП |
Variant | |||
Procedures | Between the SIP hubs | Между узлами SIP (ISAP) | The redirection of inquiries in SIP |
Variant | |||
Procedures | Establishment of connection (Н.323) | Interactions of locks with agents (MGCP) | Establishment of an interzone call (Н.323) |
The Task appendix B to RGR№1.2
Variant | Distance between routers, km | |||||
а | б | в | г | д | ж | |
The Task appendix G to RGR№2.2.
Variant | |||||
Protocol | IP | IGMP | RIP | RSVP | UDP |
Variant | |||||
Protocol | TCP | DNS | DHCP | HTTP | OSPF |
Variant | |||||
Protocol | ARP | ICMP | TELNET | SNMP | RMON |
Variant | |||||
Protocol | RTCP | RTP | SIP | H323 | MGCP |
Variant | |||||
Protocol | MPLS | SCTP | FTP | HDLC | SNMP |
Variant | |||||
Protocol | SSH | RSVP | SMTP | IRC | RTSP |
Список литературы
1 Романчева Н.И. Современные Интернет-технологии: Учебное пособие. - М.: МГТУ ГА, 2007. – 104 с.
2 Баскаков И. В., Пролетарский А. В., Мельников С. А., Федотов Р. А., IP-телефония в компьютерных сетях. Учебное пособие – Москва, 2008г.
3 Яновский Г. Г. Качество обслуживания в сетях IP // Вестник связи, – Алматы, 2008. – № 1. – С1-15.
4 Гольдштейн Б.С., Пинчук А.В., Суховицкий А.Л. ІР-Телефония. - М.: Радио и связь, 2006. – 336с.
5 Таненбаум Э. Компьютерные сети. 4-е изд. – СПб.: Питер, 2006.- 992 с.
6 Олифер В., Олифер Н., Компьютерные сети. Принципы, технологии, протоколы. – СПб.:Питер, 2006 – 958 с.
7 Электронный источник – www.sipnet.ru
8 Яновский Г. Г. Качество обслуживания в сетях IP // Вестник связи, – Алматы, 2008. – № 1. – С1-15.
9. Чежимбаева К.С., Мирзакулова Ш.А. Основы IP телефонии: Конспект лекций. – А.:АУЭС, 2014. – 50с.