Websockets in .NET for Fast Web Applications

Organiser
The San Francisco .NET User Group
Date
Thu, 31 May 2012, 01:30 - 04:30 (Add to calendar) GMT
Venue
(Exact location not available) , San Francisco, US
Cost
Free

This month we have an excellent speaker duo from Olivine Labs that will be showing us how to make more responsive web applications using WebSockets.  They will first review what WebSockets are and how they can be used in your applications.  They will create a demo application using sockets to demonstrate bidirectional communication allowing the server to push data to a client without polling.  Sockets also enable full duplex communication allowing client and server to send data simultaneously, and all conversations are protected with the property security protocols

If you want to make your web application faster and enable more flexible communication with the server, this is a talk you need to see.

 

 About our Speaker:

Drew Ditthardt is Senior Engineer for Forio Online Simulations, where he manages the application infrastructure and serves as product and project manager for the core product, Simulate. He has a background in C#, PHP, Java, Object Pascal, and has a passion for architecture and efficiency.

Jack Lawson is Senior UI Engineer at Plum District. He works daily with technologies such as Coffeescript, SASS, Rails, and more, and has a long history with C#. He spends a large majority of his time tinkering with HTML5 and related technologies.

Drew and Jack have put together Olivine Labs and produce open-source libraries and software, and are working on a gaming platform targeted at modern web games.

You might also like...

Comments

Other nearby events

Map

Contribute

Why not write for us? Or you could submit an event or a user group in your area. Alternatively just tell us what you think!

Our tools

We've got automatic conversion tools to convert C# to VB.NET, VB.NET to C#. Also you can compress javascript and compress css and generate sql connection strings.

“In order to understand recursion, one must first understand recursion.”