Path: utzoo!utgpu!news-server.csri.toronto.edu!clyde.concordia.ca!uunet!know!zaphod.mps.ohio-state.edu!sdd.hp.com!elroy.jpl.nasa.gov!decwrl!hayes.ims.alaska.edu!accuvax.nwu.edu!nucsrl!telecom-request
From: anthony@batserver.cs.uq.oz.au (Anthony Lee)
Newsgroups: comp.dcom.telecom
Subject: Routing and Termination Algorithms
Message-ID: <14598@accuvax.nwu.edu>
Date: 12 Nov 90 04:08:14 GMT
Sender: news@accuvax.nwu.edu
Reply-To: anthony@batserver.cs.uq.oz.au
Organization: TELECOM Digest
Lines: 16
Approved: Telecom@eecs.nwu.edu
X-Submissions-To: telecom@eecs.nwu.edu
X-Administrivia-To: telecom-request@eecs.nwu.edu
X-Telecom-Digest: Volume 10, Issue 811, Message 10 of 11


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