[Nsi-wg] Topology virtualisation
Gigi Karmous-Edwards
gigi_ke at ncsu.edu
Sun Jun 27 21:25:22 CDT 2010
I too have the second picture in mind. I assume policy is advertised by
each domain, then path computation reads this policy as constraints
during path computation. This brings up a question:
I assume that if a GOLE is policy free, then the connection between a
domain and a GOLE is really based on the domain connecting to the GOLE.
If this is a true statement, then is there any policy regarding links
interconnecting two GOLEs? whose policy is used if both endpoints of
this link are policy free GOLEs?
Thanks,
Gigi
Freek Dijkstra wrote:
> Gigi Karmous-Edwards wrote:
>
>
>> I do realize that this is different than traditional approach and I
>> realize that today in our real world, GOLEs are not all interconnected.
>> The above statements are based on an "ideal" network.
>>
>
> Food for thought: do the networks connect the GOLEs together or do the
> GOLEs connect the networks together?
>
> Both are true, though I usually have the second picture in mind. If this
> makes a distinction for path finding, I don't know.
>
> Out of curiousity, how does GIRRA take policy into account?
>
> Freek
> _______________________________________________
> nsi-wg mailing list
> nsi-wg at ogf.org
> http://www.ogf.org/mailman/listinfo/nsi-wg
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.ogf.org/pipermail/nsi-wg/attachments/20100627/ef291cc6/attachment.html
More information about the nsi-wg
mailing list