Webrtc series - Nomination and ice of 7-ice supplement for network transmission_ Model

In the introduction of the previous course , We know ice Will collect a lot of candidate, At the same time, it will be connected with the opposite candiadate The remote end that responds with certain rules candidate form candidate pair , Then there will be many candidate Yes , If each pair needs to be tested, it may take a lot of time , therefore ICE The specification provides nominations to solve such problems , When the nomination is accepted , The same... Will be used on the opposite end pair To test , When the connection is established, the back row is in the back pair Will no longer be tested ;
Before you start nominating, understand two concepts ：

• CONTROLLING Control terminal Among the valid candidate pairs, you can specify which candidate pairs will be used for the media ; You can use either conventional or radical nominations ;
• CONTROLLED Controlled end After receiving the request, all pairs Look for the same pair, Then, the controlled end sends the connectivity detection to the controlled end ;

1. Nomination

stay ice file rfc5245 Of 2.6 Nominations are described in , as follows :
The control end nominates by using one of the following two methods ICE Selected pairing ： routine (regular) Nominated or radical (aggressive) Nomination .

• If its peer has a thin (ICE Lite) The implementation of the , The other end must use a conventional nomination algorithm .
• If its peer uses a..., which is not supported by the current end ICE Options （ There is