File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A distance-vector routing protocol for networks with unidirectional links

TitleA distance-vector routing protocol for networks with unidirectional links
Authors
Lau, FCMChen, GHuang, HXie, L
KeywordsRouting algorithm
Distance vector
Directed graph
Undirectional link
Routing information protocol
Issue Date2000
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcom
Citation
Computer Communications, 2000, v. 23 n. 4, p. 418-424 How to Cite?
DOI: http://dx.doi.org/10.1016/S0140-3664(99)00196-6
AbstractWe propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting 'from' information, and the other one for generating and propagating 'to' information. Like the RIP protocol, this one can handle dynamic changes and tolerate node and link failures in the network.
Persistent Identifierhttp://hdl.handle.net/10722/152306
ISSN
0140-3664
2021 Impact Factor: 5.047
2020 SCImago Journal Rankings: 0.627
ISI Accession Number ID
WOS:000085405700012
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorLau, FCMen_US
dc.contributor.authorChen, Gen_US
dc.contributor.authorHuang, Hen_US
dc.contributor.authorXie, Len_US
dc.date.accessioned2012-06-26T06:37:04Z-
dc.date.available2012-06-26T06:37:04Z-
dc.date.issued2000en_US
dc.identifier.citationComputer Communications, 2000, v. 23 n. 4, p. 418-424en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://hdl.handle.net/10722/152306-
dc.description.abstractWe propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting 'from' information, and the other one for generating and propagating 'to' information. Like the RIP protocol, this one can handle dynamic changes and tolerate node and link failures in the network.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcomen_US
dc.relation.ispartofComputer Communicationsen_US
dc.subjectRouting algorithm-
dc.subjectDistance vector-
dc.subjectDirected graph-
dc.subjectUndirectional link-
dc.subjectRouting information protocol-
dc.titleA distance-vector routing protocol for networks with unidirectional linksen_US
dc.typeArticleen_US
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/S0140-3664(99)00196-6en_US
dc.identifier.scopuseid_2-s2.0-0343090947en_US
dc.identifier.hkuros55365-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0343090947&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume23en_US
dc.identifier.issue4en_US
dc.identifier.spage418en_US
dc.identifier.epage424en_US
dc.identifier.isiWOS:000085405700012-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.scopusauthoridGuihai Chen=7409732200en_US
dc.identifier.scopusauthoridHao Huang=7409674633en_US
dc.identifier.scopusauthoridLi Xie=7409721340en_US
dc.identifier.issnl0140-3664-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats