Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

Which algorithms are used for high routing?

Status
Not open for further replies.
A

anandanips

Junior Member level 1
Joined
Dec 21, 2007
Messages
18
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,439
what are algorithm used for high routig?...
other than btree...
 

Re: routing

Static routing algorithm
Dynamic routing algorithms
Dijkstra's algorithm

Routing algorithms can be classified by type. Key differentiators include these:

•Static versus dynamic

•Single-path versus multipath

•Flat versus hierarchical

•Host-intelligent versus router-intelligent

•Intradomain versus interdomain

•Link-state versus distance vector
 

Re: routing

where i can learn more about these alogos...any book or link...?
 

Re: routing

There is a lot of papers.
I think the "Computer Networks" by Tanenbaum is best for start.
there are alot of book about network and microsoft exam.
also you can see about Cisco Routers:
www.cisco.com
 

Re: routing

also u can refer Data Communications Networking by Behrouz A. Forouzan
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top