Re: Throughput patches

I guess then we're talking about some quite long term for this
modifications to take place, right?


On Nov 26, 2007 3:31 PM, Vincent CHAVANIS <[email protected]> wrote:
>
> The main issue is located to the fact we are using the same thread in order
> to send/receive(=ack) a message.
> We need to think about a global fix which result in modifying the actual
> structure of kannel (=> implicates compatibility breaker)
> I will take a look when i will have some time.
> The main idea to temporatily fix thjis is to check for each msg, if they
> have already been received.
> If yes, then drop it. If not, insert it into your db.
>
> Vincent
> --
> Telemaque - 06560 SOPHIA-ANTIPOLIS - (FR)
> Service Technique/Reseau - NOC
> Developpement SMS/MMS/Kiosques
> http://www.telemaque.fr/
> [email protected]
>
>
> ----- Original Message -----
> From: "Juan Nin" <[email protected]>
> To: <[email protected]>
> Sent: Monday, November 26, 2007 4:10 PM
> Subject: Re: Throughput patches
>
>
> > Hi!
> >
> > Any feedback on this?
> >
> > Thanks in advance
> >
> > Juan
> >
> > On Nov 16, 2007 12:35 PM, Juan Nin <[email protected]> wrote:
> >> Hi!
> >>
> >> I've been reading the different threads about the problem with
> >> throughput, being this the last one (I think):
> >> http://www.mail-archive.com/[email protected]/msg06847.html
> >>
> >> Apparently that fixes the outgoing traffic throughput, but impacts
> >> incoming ACKs.
> >>
> >> Is there any new version of the patch which fixes this, or any plans
> >> on fixing it soon?
> >> Seems to me to be something important, since many SMSCs limit their
> >> inbound traffic, and not being able to correctly set the throughput
> >> parameters is a big problem.
> >>
> >> Also, that patch is EMI/UCP specific and Stuart Beck ported it to SMPP.
> >> If there are intentions on fixing it on Kannel, will it be coded on
> >> each smsc implementation, or will it be abstracted to some more global
> >> place (don't know if it's possible)
> >>
> >> Thanks in advance,
> >>
> >> Juan
> >>
> >
> >
>
>
>
>