anthony@batserver.cs.uq.oz.au (Anthony Lee) (11/12/90)
Could someone please explain the following routing and termination algorithms ? 1. Hunting, 2. bridging, 3. coverage, 4. least-cost routing. Are there others? Anthony Lee ACSnet: anthony@batserver.cs.uq.oz TEL:+(61)-7-371-2651 Internet: anthony@batserver.cs.uq.oz.au +(61)-7-377-4139 (w) SNAIL: Dept Comp. Science, University of Qld, St Lucia, Qld 4072, Australia