Open AccessForming a plurality of disjoint routes between border routers MPLS network
Author(s) -
Y. O. Kulakov,
M. A. Dybrova,
Alla Kohan
Publication year - 2016
Publication title -
èlektronika i svâzʹ
Language(s) - English
Resource type - Journals
eISSN - 2312-1807
pISSN - 1811-4512
DOI - 10.20535/2312-1807.2016.21.1.80594
Subject(s) - computer science , multiprotocol label switching , table (database) , dijkstra's algorithm , routing table , network packet , path (computing) , computer network , disjoint sets , tree (set theory) , computational complexity theory , routing (electronic design automation) , routing protocol , algorithm , shortest path problem , theoretical computer science , mathematics , graph , combinatorics , data mining , quality of service