Data Communication Systems and Their Performance: Proceedings of the Third IFIP TC6/WG 7.3 International Conference on Data Communication Systems and Their Performance, Rio de Janeiro, Brazil, 22-25 June, 1987Luís F. M. Moraes, E. de Souza e Silva, Luiz F. G. Soares |
From inside the book
Results 1-3 of 12
Page 126
... node can reach all the nodes within its transmission range . However , most of the work done so far has concentrated ... center node who does not know the exact number of nodes inside his transmission range . We concentrate only on the ...
... node can reach all the nodes within its transmission range . However , most of the work done so far has concentrated ... center node who does not know the exact number of nodes inside his transmission range . We concentrate only on the ...
Page 127
... center node waits for a cer- tain timeout period before he makes the next move : Either sends a new broadcast ... center site just broad- casts a series of queries , and wait for all the responses to come back before he proceeds to ...
... center node waits for a cer- tain timeout period before he makes the next move : Either sends a new broadcast ... center site just broad- casts a series of queries , and wait for all the responses to come back before he proceeds to ...
Page 129
... center node can and will use the maximum k likelihood estimator ( also called the maximum a posteriori estimator ) to estimate the number of destination nodes . The maximum likelihood estimator has been shown to exhibit many pro ...
... center node can and will use the maximum k likelihood estimator ( also called the maximum a posteriori estimator ) to estimate the number of destination nodes . The maximum likelihood estimator has been shown to exhibit many pro ...
Contents
AllOptical Ultra Fast Networks | 3 |
Performance of Priority Protocols on High Speed Token Ring Networks | 13 |
An Integrated Multiservice Local Network | 23 |
Copyright | |
33 other sections not shown
Other editions - View all
Common terms and phrases
algorithm analysis approximation architecture Area Networks arrival assumed assumption average bandwidth blocking broadcast buffer busy period center node channel client communication networks Computer Computer Networks Congestion Control considered CSMA/CD cycle data communications defined denoted destination node distribution Elsevier Science Publishers equations exponential Fast Packet Switching FDDI Figure flow control function server given IEEE IEEE Trans interface interval ISDN load Local Area Networks low priority maximum mean modules multiple node obtained optical optimal Packet Switching parameters Performance Evaluation priority queue probability processor protocol Publishers B. V. North-Holland queue length queueing delay queueing model queueing network queueing system random variables retransmission routing RPAC scheme Science Publishers B.V. signal simulation slot solution station terminal Theorem throughput token Token Ring topology traffic transmission transmitted values W-policy workstation z-transform