File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0140-3664(99)00196-6
- Scopus: eid_2-s2.0-0343090947
- WOS: WOS:000085405700012
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A distance-vector routing protocol for networks with unidirectional links
Title | A distance-vector routing protocol for networks with unidirectional links |
---|---|
Authors | |
Keywords | Routing algorithm Distance vector Directed graph Undirectional link Routing information protocol |
Issue Date | 2000 |
Publisher | Elsevier 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? |
Abstract | We 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 Identifier | http://hdl.handle.net/10722/152306 |
ISSN | 2023 Impact Factor: 4.5 2023 SCImago Journal Rankings: 1.402 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lau, FCM | en_US |
dc.contributor.author | Chen, G | en_US |
dc.contributor.author | Huang, H | en_US |
dc.contributor.author | Xie, L | en_US |
dc.date.accessioned | 2012-06-26T06:37:04Z | - |
dc.date.available | 2012-06-26T06:37:04Z | - |
dc.date.issued | 2000 | en_US |
dc.identifier.citation | Computer Communications, 2000, v. 23 n. 4, p. 418-424 | en_US |
dc.identifier.issn | 0140-3664 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/152306 | - |
dc.description.abstract | We 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.language | eng | en_US |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcom | en_US |
dc.relation.ispartof | Computer Communications | en_US |
dc.subject | Routing algorithm | - |
dc.subject | Distance vector | - |
dc.subject | Directed graph | - |
dc.subject | Undirectional link | - |
dc.subject | Routing information protocol | - |
dc.title | A distance-vector routing protocol for networks with unidirectional links | en_US |
dc.type | Article | en_US |
dc.identifier.email | Lau, FCM:fcmlau@cs.hku.hk | en_US |
dc.identifier.authority | Lau, FCM=rp00221 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/S0140-3664(99)00196-6 | en_US |
dc.identifier.scopus | eid_2-s2.0-0343090947 | en_US |
dc.identifier.hkuros | 55365 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0343090947&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 23 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.spage | 418 | en_US |
dc.identifier.epage | 424 | en_US |
dc.identifier.isi | WOS:000085405700012 | - |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Lau, FCM=7102749723 | en_US |
dc.identifier.scopusauthorid | Guihai Chen=7409732200 | en_US |
dc.identifier.scopusauthorid | Hao Huang=7409674633 | en_US |
dc.identifier.scopusauthorid | Li Xie=7409721340 | en_US |
dc.identifier.issnl | 0140-3664 | - |