Forming a plurality of disjoint routes between border routers MPLS network
Main Article Content
Abstract
This paper proposes a way to organize multi-path routing in the MPLS network. Formation of the table tags is based on the modified method of "branch and bound", in which simultaneously generates a plurality of non-intersecting paths with minimal time complexity. For the formation of the tree stands ways, the degree vertices is the main criterion. The path is extended to the top with a minimal degree. Between boundary routers MPLS network proposed the tags tables formation algorithm. The process of formation of the table labels by using LDP label distribution protocol by exchanging signaling packets between neighboring routers. The marks tables between boundary routers MPLS network and a time chart are presented as an example. Determined the computational complexity of the proposed algorithm and provides a comparison of it with the computational complexity of Dijkstra's algorithm.
References 5, figures 2, table 8.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
Lemeshko, A. V., Evseeva, O. Yu., Garkusha, S. V. (2015). Research on Tensor Model of Multipath Routing in Telecommunication Network with Support of Service Quality by Greate Number of Indices. Telecommunications and RadioEngineering. Vol.73. No 15. Pp. 1339-1360.
Mahalakshmi, C., Ramaswamy, M. (2012). Multipath Data Transfer Scheme for Virtual Private Networks. International Journal of Computer Applications. Volume 44. No.8. Рp.27-31.
Kulakov, Y., Kogan, A. (2014). The method of plurality generation of disjoint paths using horizontal exclusive scheduling. The science advanced. Issue 9. Pp.16-18.
Dibrova, M., Kogan, A., Kutsenko, V. (2015). The process of designing traffic in Grid systems. Proceedings of the National Technical University of Ukraine "KPI": Informatics, Management and Computer Science. K.: OOO "VEK +", Vol. 62. Pp.65-69. (Rus)
RFC 3036 LDP Specification. L. Andersson, P. Doolan, N. Feldman, A. Fredette, B. Thomas. January 2001 http://www.ietf.org/rfc/rfc3036.txt
