Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
0Activity

Table Of Contents

2.1.1. Limitations of the protocol
2.2.1. Dealing with changes in topology
2.2.2.1. Split horizon
2.2.2.2. Triggered updates
2.3.1. Message formats
2.3.2. Addressing considerations
2.3.3. Timers
2.3.4.1. Request
2.3.4.2. Response
2.3.5. Output Processing
2.3.6. Compatibility
2.4. Control functions
3.1.1. Protocol overview
3.1.2. Definitions of commonly used terms
3.1.3. Brief history of link-state routing technology
3.2.1. The shortest-path tree
3.2.2. Use of external routing information
3.2.3. Equal-cost multipath
3.2.4. TOS-based routing
3.3.1. The backbone of the Autonomous System
3.3.2. Inter-area routing
3.3.3. Classification of routers
3.3.4. A sample area configuration
3.3.5. IP subnetting support
3.3.6. Supporting stub areas
3.3.7. Partitions of areas
3.4.1. Inter-area routing
3.4.2. AS external routes
3.4.4. Basic implementation requirements
3.4.5. Optional OSPF capabilities
3.5. Protocol Data Structures
3.6. The Area Data Structure
0 of .
Results for:
No results containing your search query
P. 1
RIP-OSPF

RIP-OSPF

Ratings: (0)|Views: 0 |Likes:
Published by Alexandru Apostol
Routing Algorithms
Routing Algorithms

More info:

Categories:Types, Research
Published by: Alexandru Apostol on Apr 09, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

04/09/2013

pdf

text

original

You're Reading a Free Preview
Pages 5 to 41 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->