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

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

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.

Consistent Hashing

I will try to explain consistent hashing with a real world example. Let's assume I have a restaurant with 60 tables and 5 servers (waiter). Each server is given an equal number of tables to serve. Now let's assume we have addition of a new server (waiter), so his addition will be marked in the circle and he will be receiving tables from the previous server to his distance only. Check the attached example. Assume a server (waiter) has left the organisation and we have only 4 servers now. Server3 has left the restaurant, so his table will be assigned to server 4. I am sure you have noticed the load is not equally distributed. But to make the system less prone to addition/removal we just rotate in clockwise and assign range from the previous server to present server.  To make sure load is balanced or optimally balanced we need to use virtual nodes. Check links here: http://tom-e-white.com/2007/11/consistent-hashing.html https://www.toptal.com/big-data/...