Skip to main content

WebRTC : Beyond Peer to peer

Why do we need any middleman if i can directly communicate to second computer. That's how Peer to peer communication works. You just need initial signaling to be done with the help of server.

Create an offer from computer initiating communication, pass it to server which in turn check same with peer computer. Once peer acknowledge incoming request, it will share its SDP details.
Once acknowledgement received with peer connection information, computer will be able to directly communicate with peer.





Now in this post, I wish to talk about how WebRTC will be leveraged to implement multiparty video conferencing.

Mesh:

 In this architecture every participant have a connection to each other. So for n participant will have n-1 connection. So total n*(n-1)/2 connections. This is easy to implement as it does not need much changes from existing P2P connection. All the stream handling is done at edge computer. It has drawback of high data consumption and scalability issues. 


Routing:

 In this architecture all participant will be sending their stream to central server which in turn will be sending to other participants. It is scalable and but could be costly. 

Mixing:  

 In this architecture all participant will be sending their stream to central server which in turn consolidate them in single stream and will be sending single stream to all participants. 
It is scalable but costly as server has to do a lot of stream processing. . 

Comments

Post a Comment

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part
3 comments
Read more

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)
Post a Comment
Read more

Scaling application

 We all wish that our application used by maximum people on Earth. To make sure we have the right scalable application, please follow below guidelines  1. Load balancing at all level of application i.e. web server, application server and DB server 2. Remote caching to be enabled for a fast response.  3. Load balancer will equally distribute the traffic to existing servers, what if enough capacity is not enough. We should have a mechanism to increase the server capacity (esp horizontally ).  All the cloud service provider has provision for autoscaling, so do Kubernetes.  Use them.  4. Most of the NoSQL DB comes with good support for horizontal scalability. So if you chosse NoSQL you can easily scale them. But if your application requires RDBMS (SQL) then plan should be with sharding in place.  5. Server should be stateless. Any server should be able to serve an incoming request. No local storage, no IP binding. Having said newly added server will start ...
Post a Comment
Read more