A Method of Forming the Optimal Set of Disjoint Path in Computer Networks | Zendy

As’ad Mahmoud As’ad Alnaser | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Method of Forming the Optimal Set of Disjoint Path in Computer Networks

Author(s) -

As’ad Mahmoud As’ad Alnaser

Publication year - 2017

Publication title -

journal of applied computer science and mathematics/journal of applied computer science

Language(s) - English

Resource type - Journals

eISSN - 2066-3129

pISSN - 1843-1046

DOI - 10.4316/jacsm.201701001

Subject(s) - disjoint sets , path (computing) , set (abstract data type) , computer science , computer network , theoretical computer science , mathematics , combinatorics , programming language

This work provides a short analysis of algorithms of \udmultipath routing. The modified algorithm of formation of the \udmaximum set of not crossed paths taking into account their \udmetrics is offered. Optimization of paths is carried out due to \udtheir reconfiguration with adjacent deadlock path. \udReconfigurations are realized within the subgraphs including \udonly peaks of the main and an adjacent deadlock path. It allows \udto reduce the field of formation of an optimum path and time \udcomplexity of its formation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research