Estimate the time complexities to execute the following routing algorithms: adaptive decen- tralized routing and lookahead routing.
Adaptive decentralized routing algorithm:
O (N logN) for an SN-DN pair in an N-node network.
Lookahead routing algorithm: O(r log N) for an SN-DN pair with r-hop lookahead (i.e.,
rlookAhead) in an N-node network.
Computer Science & Information Technology
You might also like to view...
The second version of a piece of software, alpha version, is tested by a sample of users
Indicate whether the statement is true or false
Computer Science & Information Technology
How is the ? wildcard different from the * wildcard?
What will be an ideal response?
Computer Science & Information Technology