When broadband integrated services digital network (B-ISDN) service is implemented, the choice of a routing algorithm for broadcast services will be an important issue. Routing is the problem of deciding which of several nodes already connected to the broadcast node will be advantageous for the connection of new calls. In this respect, the number of viewers on each node would be important information. This paper uses broadcast traffic simulations to examine a method for determining a change in the number of viewers with the minimum number of calculations. The conventional approach would calculate the call transitions until the desired moment, but here the goal is to shorten the calculation time by determining the number of viewers directly at the desired moment. In this examination, under the two conditions M(N)/M/N'and N, M(N)/D/N, two models are proposed for the duration of the ON state of the node (a situation where there is more than one viewer): the exponential distribution approximation and the hypercharacteristic distribution approximation. The number of viewers is modeled by the birth-death process approximation and the normal distribution approximation. The amount of time needed for the calculation depends on the interval to calculate the traffic intensity and the number of viewers, but this is much less than the time needed when the conventional method is used.
|ジャーナル||Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)|
|出版ステータス||Published - 1996 1月|
ASJC Scopus subject areas
- コンピュータ ネットワークおよび通信