自相似业务流下的星上交换全局优化缓冲分配算法  

A Global Optimal Buffer Allocation Algorithm under Self-similar Traffic for Satellite Switching Systems

作　　者：彭聪 李瑞欣[1] 赵尚弘[1] 黎军[2] 张韵 高航航 PENG Cong;LI Ruixin;ZHAO Shanghong;LI Jun;ZHANG Yun;GAO Hanghang(Information and Navigation College,Air Force Engineering University,Xi′an 710077,China;Key Laboratory of Space Microwave,China Academy of Space Technology-Xi′an Institute ofSpace Radio Technology,Xi′an 710100,China)

机构地区：[1]空军工程大学信息与导航学院,西安710077 [2]中国空间技术研究院西安分院空间微波技术重点实验室,西安710100

出　　处：《电讯技术》2019年第2期157-161,共5页Telecommunication Engineering

基　　金：国家自然科学基金资助项目(91638101)

摘　　要：针对空间信息网络星上交换节点缓冲资源有限,提出一种适用于星上交换的缓冲优化分配算法。采用了Crossbar交换模型,在此基础上建立了虚通道自相似排队模型,通过计算每个虚通道缓冲溢出概率并采用遗传算法来实现缓冲资源全局优化分配。仿真结果表明,与均匀分配算法和贪婪分配算法相比,新算法具有更好的延时性能,在同等分组平均时延、业务流自相似程度为0.6和0.8的情况下,新算法比均匀分配算法可分别节省24.5%和26.4%的缓冲资源,并且分配效率比贪婪分配算法提高约21.9%。For the finite buffer resources in satellite switching nodes of space information network(SIN),an optimal buffer allocation algorithm for satellite switching systems is proposed.Crossbar switching model is used,and on this basis,a virtual channel self-similar queuing model is established.Then the genetic algorithm is used to allocate the resources globally and optimally according to buffer overflow probability of every virtual channel.The simulation results show that,the new allocation algorithm has better delay performance than the uniform allocation algorithm and the greedy allocation algorithm.For the same average packet latency,compared with the uniform allocation algorithm,the new allocation algorithm can save 24.5 % and 26.3 % of buffer consumption when the self-similarity of packet traffic is 0.6 and 0.8.And the efficiency of the new allocation algorithm is about 21.9 % higher than that of the greedy allocation algorithm.

关 键 词：空间信息网络 星上交换系统 自相似排队模型 缓冲分配 遗传算法 

分 类 号：TN919[电子电信—通信与信息系统]