From owner-freebsd-hackers Wed Sep 26 9:25:14 2001 Delivered-To: freebsd-hackers@freebsd.org Received: from iguana.aciri.org (iguana.aciri.org [192.150.187.36]) by hub.freebsd.org (Postfix) with ESMTP id 0A1E437B408 for ; Wed, 26 Sep 2001 09:25:07 -0700 (PDT) Received: (from rizzo@localhost) by iguana.aciri.org (8.11.3/8.11.1) id f8QGMAl65454; Wed, 26 Sep 2001 09:22:10 -0700 (PDT) (envelope-from rizzo) From: Luigi Rizzo Message-Id: <200109261622.f8QGMAl65454@iguana.aciri.org> Subject: Re: Netgraph feature request/suggestion In-Reply-To: <3BB1FF55.1460E1E4@digisle.net> from Maksim Yevmenkin at "Sep 26, 2001 9:16:21 am" To: myevmenk@digisle.net (Maksim Yevmenkin) Date: Wed, 26 Sep 2001 09:22:10 -0700 (PDT) Cc: hackers@FreeBSD.ORG X-Mailer: ELM [version 2.4ME+ PL43 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: owner-freebsd-hackers@FreeBSD.ORG Precedence: bulk List-ID: List-Archive: (Web Archive) List-Help: (List Instructions) List-Subscribe: List-Unsubscribe: X-Loop: FreeBSD.ORG Hi, one problem you have to keep in mind with what you want to do (and i am not talking about the implementation that you suggest, just the "delayed processing" aspects) is that sometimes data passed through modules have a limited lifetime and might have become stale by the time the consumer is scheduled to process them. I had a similar problem with dummynet, related to route entries that are passed around and might disappear. Same applies to interface pointers (which, fortunately, are less dynamic). cheers luigi > i'm in the middle of the project that uses Netgraph. > everything is going pretty good, but there is one small > issue. in five words it is "message and data delivery > scheduling". here is an example: > > Node A --> Node B --> Node C > > Node "A" forwards data/messages to Node "B" and Node "B" > in its turn forwards data/messages to Node "C". the issue > is that Node "C" can handle only some small amount of > data/messages at a time. Node "B" is aware of Node "C"'s > limitation and must perform "leaking bucket" type of > scheduling. i.e. Node "B" must queue data inside itself > and then schedule later delivery to Node "C". > > but that is not all. sometimes it is required to send > chunk of data (several messages) from Node "A" to Node "C". > (via Node "B") and until this chunk of data is processed by > Node "C", Node "B" is not allowed to send/accept any more > data. > > i know about kernel threads and task queue, but i would really > like to stay within Netgraph infrastructure and do not perform > any extra synchronization. > > here is the proposal. every hook has two extra methods > "hk_RcvDataShed" and "hk_RcvmMgSched" that performs scheduling. > Node can turn on delivery scheduling on one of its hook by > setting these methods. before actual data/message delivery > Netgraph will call these methods and ask destination node "is > that a good time to deliver this data/message". if it is then > delivery is performed. otherwise depending on "HK_QUEUE" bit > data/message gets queued or dropped. or perhaps turning on > delivery scheduling must turn on "HK_QUEUE" bit automatically. > > thanks, > max > > p.s. i think it should be easy to implement, if people are > interested. i can prepare the patches. > > p.p.s. if anyone knows nice solution to this problem please > let me know. > > To Unsubscribe: send mail to majordomo@FreeBSD.org > with "unsubscribe freebsd-hackers" in the body of the message > To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message