On Tue, Feb 02, 2016 at 03:15:12PM -0500, Russell Bryant wrote:
> On 02/01/2016 02:12 PM, Ben Pfaff wrote:
> > On Mon, Feb 01, 2016 at 10:12:49AM -0500, Russell Bryant wrote:
> >> In general, I definitely agree that this problem is something we need to
> >> work on. I've been wanting to look into
On 02/01/2016 02:12 PM, Ben Pfaff wrote:
> On Mon, Feb 01, 2016 at 10:12:49AM -0500, Russell Bryant wrote:
Thanks a lot for the background and references.
>> In general, I definitely agree that this problem is something we need to
>> work on. I've been wanting to look into adding a way for use
Thanks Ben for providing the background information.
I spent a hour or so on Openstack Congress and my impression is that it will be
evolving into a deductive engine rather than a computation engine that we need
for OVN.
The obvious reason, as Russell has mentioned, is it is Python. Others reaso
On 02/01/2016 02:52 PM, Saurabh Shrivastava (सौरभ श्रीवास्तव) wrote:
> How about reusing Openstack Congress which is already out there and also
> implements something like nlog?
One simple reason is that Congress is written in Python, while OVN is
written in C.
--
Russell Bryant
How about reusing Openstack Congress which is already out there and also
implements something like nlog?
--
Saurabh (सौरभ)
On Mon, Feb 1, 2016 at 11:12 AM, Ben Pfaff wrote:
> On Mon, Feb 01, 2016 at 10:12:49AM -0500, Russell Bryant wrote:
> > On 02/01/2016 05:03 AM, Yusheng Wang wrote:
> > > W
On Mon, Feb 01, 2016 at 10:12:49AM -0500, Russell Bryant wrote:
> On 02/01/2016 05:03 AM, Yusheng Wang wrote:
> > We are trying to propose a new computation model for the ovn-northd
> > application. Currently, ovn-northd computes all logical data path
> > flows for every change. This full computati
On 02/01/2016 05:03 AM, Yusheng Wang wrote:
> We are trying to propose a new computation model for the ovn-northd
> application. Currently, ovn-northd computes all logical data path
> flows for every change. This full computation model is simple and
> helped verifying the concept of logical data pa
??
We are trying to propose a new computation model for the ovn-northd
application. Currently, ovn-northd computes all logical data path flows for
every change. This full computation model is simple and helped verifying the
concept of logical data path design, but it also suffers performance dr
