Using the connectivity matrix for finding separated routes of information exchange in computer networks

Authors:
Boncho Aleksandrov;Petko Kochevski
Affiliations:
Technical University of Gabrovo;Technical College of Lovech
Venue:
Proceedings of the 13th International Conference on Computer Systems and Technologies
Year:
2012

Citing 8
Cited 0

Data networks

Data networks
Digital communication systems

Digital communication systems
Data and computer communications (3rd ed.)

Data and computer communications (3rd ed.)
A control-theoretic approach to flow control

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Computer networks (2nd ed.): protocols, standards, and interfaces

Computer networks (2nd ed.): protocols, standards, and interfaces
Analysis and Implementation of Hybrid Switching

IEEE Transactions on Computers
Computer networks (3rd ed.)

Computer networks (3rd ed.)
Technical Aspects of Data Communication

Technical Aspects of Data Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a new approach for finding optimal separate non-intersecting routes during data exchange in a communication network. This is achieved by maintaining a table, which contains information about the communication nodes that take part in the formation of parallel disjoint paths. An efficient algorithm is proposed, which is illustrated by a model computer network. Modification in finding parallel routes on the basis of the connectivity matrix, without reducing its rows and columns to zero, is suggested.