Using the connectivity matrix for finding separated routes of information exchange in computer networks
Abstract
References
Recommendations
A routing protocol for finding two node-disjoint paths in computer networks
ICNP '95: Proceedings of the 1995 International Conference on Network ProtocolsIn this paper, we present a routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with ...
An agent using matrix for backward path search on MANET
KES-AMSTA'08: Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applicationsWith the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc networks is to search path from a source to a destination with an efficient routing method, which is also an important issue ...
A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks
The loops resulting from either component failures or load changes in a computercommunication network degrade the performance and the adaptability of conventionaldistributed adaptive routing strategies, such as ARPANET's previous routing strategy(APRS). ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 64Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in