Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options

Re: Re: Re: Efficient non-blocking UDP server

by calin (Deacon)
on Mar 21, 2004 at 19:19 UTC ( #338501=note: print w/replies, xml ) Need Help??

in reply to Re: Re: Efficient non-blocking UDP server
in thread Efficient non-blocking UDP server

liz, thanks for feedback. I didn't realize Tread::Queue could be so costly ; my suggestion was the result of a mere query on CPAN by the word queue ; the module looked interesting.

There's another thing: I suppose the OP requires hundreds of packets per second as a burst condition, right? The perspective of coping with a sustained condition like that, I mean receiving and processing that amount in pure Perl, in real time, looks dim. Even if the receiving routine is fast enough, the queue would quickly fill up. (there's a discussion on what the "processing" amounts to). Anyway, that calls for optimized C code, IMHO.

All in all, I think the main idea of my original reply (treat your network code as an interrupt handling routine) is still valid in the context of datagram protocols.

  • Comment on Re: Re: Re: Efficient non-blocking UDP server

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://338501]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (6)
As of 2016-10-27 08:04 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (355 votes). Check out past polls.