摘要
本文运用排队理论对N.F.Maxemchuk提出的话音与数据综合业务局域网协议的系统条件吞吐量及建立话音分组时延进行了数学分析和推导,并用计算机仿真结果加以验证。此外,本文还对Maxemchuk协议及优先权Maxemchuk协议的性能进行仿真比较。结果表明,后者将改善话音分组时延。
This thesis deals、with the performance analysis of the integr-ated voice/data local area network protocol proposed by N.F.Maxemchuk。We analyse the packet delay of the established voice stations in maths anddeduce the formula of the systetn conditional throughput by using the que-ue theory. This thesis proves the results of the theoretical analysis withthe computer simulation,And,it compares the simulation results of Maxe-mchuk protocol with that of the priority Maxemchuk protocol and the resultshows that the delay of the voice packets will be improved by thepriorityMaxemchuk protocol.
关键词
计算机通信
数字通信
局部网络
computer communication, digital communication, local area network,voice data processing,time-delay equalization