Opening book details…
Can I read Efficient Nearer-ancestor Algorithm for Network Routing on EtoBox?
Efficient Nearer-ancestor Algorithm for Network Routing by Kwok-Yan Lam; Lucas C.K. Hui is a Computer Science article available to read on EtoBox.
What is Efficient Nearer-ancestor Algorithm for Network Routing about?
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.
Who reads Efficient Nearer-ancestor Algorithm for Network Routing?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Kwok-Yan Lam; Lucas C.K. Hui
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0140-3664)
- Published
- 1996
- Language
- EN
- Field
- Computer Science (Physical Sciences)