(snipped for brevity)
The virtual vs. real Charles predates the OSI model, therefore can not be
fit into any of layers. BTW, thanks for reply; I am trying to derive a
formula for that will build the optimal OSPF design for whatever situation;
such as
(X routers) x (Y networks) + (Available CPU Power) + (Available Mem) =
(This number of routers in an Area)
then
(X Routers) /(This number of routers in an Area) = Number of areas
Voila! and other French words I don't know the meaning of.
All that product and logarithm math scared me (calculus flashback!) ; but I
think I can get a formula from your posting as follows: (X is the number of
each type of route).
1. The product of the number of intra-area routes in Area K and the
logarithm of the number of routers in Area K
2. The number of summarized or explicit inter-area routes seen in Area K
3. The number of routes external to the routing domain seen in Area K
>
> The first term is the actual Dijkstra computation.
> Summarization affects the second term.
> Stubbiness and external aggregation affects the third term.
Area Database Size = ((intra-area routes)* X )+ (Summarized Routes) +
((Inter-area routes)*X) + ((Inter-AS routes)*X)
The above formula would give me the size of the database for an area. I
could then figure out if what routers can handle it, and how many areas the
available resources (CPU) on each router would allow it to handle.
Many thanks! I think I am either gettting an education here, or am deluding
myself...it's about the same feeling! At the very least, I am thinking
about the resource requirements of OSPF as part of the design process;)
Thank you,
Charles
_________________________________
FAQ, list archives, and subscription info: http://www.groupstudy.com/list/cisco.html
Report misconduct and Nondisclosure violations to [EMAIL PROTECTED]
