File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient nearer-ancestor algorithm for network routing

TitleEfficient nearer-ancestor algorithm for network routing
Authors
KeywordsComputer Communications
Network Routing
Routing Algorithm
Issue Date1996
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcom
Citation
Computer Communications, 1996, v. 19 n. 12, p. 1014-1019 How to Cite?
AbstractThis research note addresses the problem of efficiently updating routing tables in computer networks. Network routing usually involves the collection of network status information and the execution of routing algorithms based on which routing tables for each network node are created. Nearer-ancestor finding algorithm is an important part of the routing algorithm. Therefore, provisions of efficient nearer-ancestor finding algorithms will help to improve the overall performance of the routing algorithm. This note presents an efficient and practical solution for finding nearer-ancestors.
Persistent Identifierhttp://hdl.handle.net/10722/152258
ISSN
2015 Impact Factor: 2.099
2015 SCImago Journal Rankings: 0.889
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLam, KYen_US
dc.contributor.authorHui, LCKen_US
dc.date.accessioned2012-06-26T06:36:47Z-
dc.date.available2012-06-26T06:36:47Z-
dc.date.issued1996en_US
dc.identifier.citationComputer Communications, 1996, v. 19 n. 12, p. 1014-1019en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://hdl.handle.net/10722/152258-
dc.description.abstractThis research note addresses the problem of efficiently updating routing tables in computer networks. Network routing usually involves the collection of network status information and the execution of routing algorithms based on which routing tables for each network node are created. Nearer-ancestor finding algorithm is an important part of the routing algorithm. Therefore, provisions of efficient nearer-ancestor finding algorithms will help to improve the overall performance of the routing algorithm. This note presents an efficient and practical solution for finding nearer-ancestors.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.subjectComputer Communicationsen_US
dc.subjectNetwork Routingen_US
dc.subjectRouting Algorithmen_US
dc.titleEfficient nearer-ancestor algorithm for network routingen_US
dc.typeArticleen_US
dc.identifier.emailHui, LCK:hui@cs.hku.hken_US
dc.identifier.authorityHui, LCK=rp00120en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/S0140-3664(96)01143-7en_US
dc.identifier.scopuseid_2-s2.0-0030264977en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0030264977&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume19en_US
dc.identifier.issue12en_US
dc.identifier.spage1014en_US
dc.identifier.epage1019en_US
dc.identifier.isiWOS:A1996WA53400008-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridLam, KY=55196946700en_US
dc.identifier.scopusauthoridHui, LCK=8905728300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats