Please use this identifier to cite or link to this item:
|Title:||Efficient nearer-ancestor algorithm for network routing||Authors:||Lam, K.-Y.
|Issue Date:||Oct-1996||Citation:||Lam, K.-Y., Hui, L.C.K. (1996-10). Efficient nearer-ancestor algorithm for network routing. Computer Communications 19 (12) : 1014-1019. ScholarBank@NUS Repository. https://doi.org/10.1016/S0140-3664(96)01143-7||Abstract:||This 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.||Source Title:||Computer Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/99260||ISSN:||01403664||DOI:||10.1016/S0140-3664(96)01143-7|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.