Originally posted by Ransika deSilva:
I want to develop an application which gets 3000 Asynchronous requests per second and I would be very glad to hear your expert ideas on this? This application is intended for the Wireless market. So far I have done some research on Mobicent application and sounds promising. But I am not very clear on this particular point; if a thread is created to handle an incoming request, we need to create 3000 threads per a second, which I am sure not very good. So what are the frameworks which I can do the research on. Thanks and regards.
This performance profile ( presented at author's site ) compares favorably with traditional fast substring scanning algorithms, such as Boyer Moore. Since Java's character is 16 bit wide, a naive implementation of Boyer Moore would require 65536 machine instructions to initialize its lookup table. This is obviously not acceptable when we are scanning any string shorter than 70000 characters long.
Originally posted by Stan James:
Can you put a load balancer in front of this? The clients hit an IP address which is really an ArrowPoint or similar box that splits traffic among some number of servers. That also helps your reliability - if one goes down the others in the group keep working.[/QB]