Research Of The Multiplexing Technology Based On Advanced Orbiting System Under The Self-similar Traffic

Contributing to the rapid development of aerospace technology,the advanced orbiting system(AOS) has been exerting an increasing influence on the field of aerospace,the data transmission of space task and the system of space management has been becoming more sophisticated.Recently, a number of researches which have shown that network of any type is characteristic of self-similar have exsited.Therefor,the multiplexing technology based on advanced orbiting system under the self-similar traffic is mainly analyzed in the paper.First of all,the common self-similar features in the various network are analyzed in detail.The core research contents are the self-similar models and the self-similar traffic generating methods.And the typical generating methods are simulated through the Matlab software.And then,the theoretical formulas of the performance parameters in the frame generating process are deduced.Choosing the reasonable traffic model of the self-similar traffic and establishing the novel source packet arriving model,the theoretical formulas of the equal time frame generation algorithm and the high efficiency frame generation algorithm are deduced successively.The theoretical formulas contain the followed contents:MPDU multiplexing efficiency and average packet time delay in the equal time frame generation algorithm, average frame generating time and average packet time delay in the high efficiency frame generation algorithm.And then,the deducing solution is intended to be applied to the formulas deducing under the Poisson traffic.Afterwords,exploiting the the Matlab software to simulate those formulas respectively.The simulation results strongly prove that the correctness of the deduced formulas and the rationality of the deducing solution.Finally,compare the different performances in the second level multiplexing of AOS between two virtual channel scheduling algorithms under the self-similar traffic.The traditional dynamic priority scheduling algorithm(TDPSA) and scheduling algorithm of moving boundary based on frame urgency(SAMBFU) are choosed to make comparison in terms of the average virtual channel scheduling delay,the Longest virtual channel scheduling delay of system, the average scheduling delay of system,the Longest delay of system and the utilization of virtual channel.The simulation results presents that the scheduling algorithm of moving boundary based on frame urgency is still more superior than the traditional dynamic priority scheduling algorithm even under the self-similar traffic,and another conclusion can be arrived that the scheduling algorithm of moving boundary based on frame urgency is suitable to conduct the research of self-similar traffic model as well.