Project Links Logo Artwork
Graph Theory: Networking
Home > Graph Theory: Networking > Telephone Networks > DNHR
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

DNHR

Telephone Networks: Dynamic Non-Hierarchical Routing (DNHR)

The simplest (but non-optimal) routing algorithm would be:

The call is accepted if and only if the one-hop path to the destination is available.

Problem 8:

Why is this algorithm not optimal? Why is DNHR a better solution?

Answer

 
 
go backgo forward
go backgo forward