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

HTTP/2 : what and why

HTTP History In 1989, the hypertext transfer protocol have been invented. HTTP/1.1 has been released in 1997 and took the longest pause in evolution. In 2015, Google has redrafted its inhouse SPDY protocol to HTTP/2 to optimize the web page load time.  HTTP/1.1 Pitfalls Too heavy and big protocol. Too many parts have been added as optional led to complicating the protocols with less of usage. Since HTTP1.1 release, web technology have seen tremendous change. Page size has been increased to MBs, the number to pages increased manifolds and parallel components making HTTP calls increased too.  Each HTTP request has a separate TCP connection and its handshake does add to page load time.  Head of line blocking has slowed the page load. We can have a maximum 8 parallel connection to the same domain. Due to increase in multiple components making separate HTTP calls, this has been a bottleneck.  HTTP/2 Solution Binary framing layer: HTTP/1.1 was text-only messaging, which wa...

Two numbers with minimum difference

Find the two numbers whose difference is minimum among the set of numbers. For example the sequence is 5, 13, 7, 0, 10, 20, 1, 15, 4, 19 The algorithm should return min diff = 20-19 = 1. Make an efficient algorithm, yeah best could be O(n). Not sure if i could use DP here, will post a solution tommorow. Let me know if you find a answer. Algorithm:MiniMumDiffN Get the size of array , say n. Get the range of array, range. Bucket Sort the above array. Search the above sorted array for minimum difference. This will be the minimum difference numbers. Now question comes where the range of above given array is very big. Algorithm:DivideArray Take an random element. Search for its position in array. Return the index of element. Algorithm:MiniMumDiff if array_range > MAXRANGE int mid = divideArray (arr,start,end); d1,max1 = MiniMumDiff( arr,start,mid-1); d2,max2 = MiniMumDIff(arr,mid+1,end); d3 = difference max1 and arr[mid] d4 = difference max2 and arr[mid] return minimum( d1,d2...