skip to main content
10.1145/2383276.2383311acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

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

Published: 22 June 2012 Publication History

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.

References

[1]
Ali Syed R.; "Digital Switching Systems: System Reliability and Analysis"; McGraw-Hill, New York, 1997.
[2]
Bertsekas D., Gallager R.; "Data Network"; Englewood Cliffs; Prentice-Hall; New York; 1987.
[3]
Black U., Computer Networks Protocols, Standards and Interfaces, Prentice-Hall, 1990.
[4]
Karttunen T.; Harju J.; Martikainen O.; "Introduction to Intelligent Networks"; Proceedings of the IFIP workshop on intelligent networks; Finland, Lappeenranta; 1994, pp. 1÷33.
[5]
Keshav S. "A Control-Theoretic Approach to Flow Control"; ACM Computer Communication Review; vol. 21; NO 4; 1991; September; pp.3÷15.
[6]
McDonald J.; "Fundamentals of Digital Switching"; Plenum press; New York; 1990.
[7]
McNamara J.; "Techical Aspekts of Data Communication"; Bedford; Digital Press; 1988.
[8]
Peebles P.; "Digital Communication Systems"; Englewood Cliffs; Prentice-Hall; New York; 1987.
[9]
Shin K.; Daniel S.; "Analysis and Implementation of Hybrid Switching", IEEE Transaction on Computers, vol. C-45, No 6, 1996, pp. 39÷50.
[10]
Stallings W., Data and Computer Communication, Macmillan Publishing Company, USA, 1991.
[11]
Tanenbaum A., Computer Networks, Prentice Hall, New Jersey, 1996.
[12]
Torrieri D., Algorithm for Finding an Optimal Set of Short Disjoint Paths in a Communication Network, IEEE Transaction on Communications, 1992, p.1698÷1702.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CompSysTech '12: Proceedings of the 13th International Conference on Computer Systems and Technologies
June 2012
440 pages
ISBN:9781450311939
DOI:10.1145/2383276
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. computer networks
  2. connectivity matrix
  3. optimal separated routes

Qualifiers

  • Research-article

Conference

CompSysTech'12

Acceptance Rates

Overall Acceptance Rate 241 of 492 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 64
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media