| 000 | 01151nab a22002897 4500 | ||
|---|---|---|---|
| 001 | H004.7 COM | ||
| 003 | AR-sfUTN | ||
| 008 | 190909b xx |||p|r|||| 00| 0 spa d | ||
| 040 | _cAR-sfUTN | ||
| 080 | _aH004.7 COM | ||
| 100 | _aJia, Xiaohua | ||
| 700 | _aWang, Lusheng | ||
| 245 | _aA group multicast routing algorithm by using multiple minimum Steiner trees | ||
| 336 |
_2rdacontent _atexto _btxt |
||
| 337 |
_2rdamedia _asin mediación _bn |
||
| 338 |
_2rdacarrier _avolumen _bnc |
||
| 505 | _aMulticast is a communication abstract in which a process sends a message to a group of processes. Group multicast is a kind of multicast where only members of the group can multicast to the group and every member of the group is allowed to multicast to the group | ||
| 650 | _aCOMPUTER NETWORK | ||
| 650 | _aCOMPUTER SUPPORTED COOPERATIVE WORK | ||
| 650 | _aDISTRIBUTED SYSTEMS | ||
| 650 | _aGROUP COMMUNICATION | ||
| 650 | _aMINIMUM STEINER TREE | ||
| 650 | _aMULTICAST ROUTING | ||
| 773 |
_tComputer communications _wH004.7 COM _nS.T.:H004.7 COM PP2708 _g(vol. 20, nro. 9, Sep. 1997), p. 750-758 |
||
| 942 | _cAN | ||
| 999 |
_c35687 _d35687 |
||