A method of routing is in the computer
networks of integral maintenance
Yurii Kulakov1, professor, D.S., &
Mikhail Stakhniv1, post graduate student
1 Computer System Department, Faculty of Information
and Computing Technique, National Technical University of Ukraine “Kyiv
Polytechnic Institute”, Address: 37, Prospect Peremohy,
03056, Kyiv-56,
Networks of integral
maintenance are intended for passing large volume of information. Development
and creation such networks and choice method of routing in these networks
requires improvement of existent methods of routing depending on the service
quality in existing networks.
One of way to organize
networks of integral maintenance is to use Multiprotocol Label Switching (MPLS)
technology. This technology combines possibilities of traffic engineering, which
are proper for data link layer, and scalability and flexibility of protocols, which
are proper for a network layer. The main feature of MPLS technology is separation
process of package commutation from the IP-address analysis in its header. This
allows carrying out packages commutation considerably quicker. In accordance
with MPLS technology routers and switches on every routing table access point
appropriate special mark and transmit this mark the nearby devices.
The required service quality
in integral networks obtains by routing with QoS
(Quality of Service). This type of routing requires
not only finding the shortest route from a source to the addressee but also
guaranteeing, that this route will satisfy all quality conditions which are
required by QoS.
Usually MPLS technology
utilizes one of three routing protocols: link-state routing protocol OSPF (Open
Shortest Path First), another link-state routing protocol IS-IS (Intermediate
System to Intermediate System), BGP protocol (Border Gateway Protocol). OSPF
and IS-IS protocols are oriented on finding the shortest route among all
possible with a minimum links loading while providing QoS.
Routing algorithms of these protocols are based on controlling links states. BGP
protocol is known as a path vector protocol. The main principle of path vector
protocol is that choice of route based on shortest distance between the
systems, determined by the number of sending. Routing algorithm of path vector
protocol usually take into account only the number of sending in a route.
On the basis of the conducted
researches it is offered a method of routing based on the link-state routing
algorithm which takes into account descriptions of communication links. This
method provides needed parameters which heterogeneous traffic requires.