Bie Y.-X.,Nanjing University of Science and Technology |
Bie Y.-X.,Dalian University |
Pan C.-S.,Nanjing University of Science and Technology |
Pan C.-S.,Liaoning Province Key Laboratory of Communication Networks and Information Processing |
And 4 more authors.
Tongxin Xuebao/Journal on Communications | Year: 2012
In order to efficiently transmit different types of high-capacity and burst data, based on virtual channel multiplexing technology on advanced orbiting systems (AOS), a Hurst and priority adaptive random early detection (RED) combined with dynamic scheduling algorithm named HPRED-DS was proposed. In queue management state, the algorithm designed an adaptive two-level packet dropping strategy based on Hurst parameter and priority. In virtual channel scheduling state, a VIP, synchronous and asynchronous mixed virtual channels scheduling mode was designed. Meanwhile, the algorithm efficiently combined queue management and virtual channel scheduling. Experimental results show that on the basis of maintaining high treatment efficiency and throughput, the algorithm stabilizes queue length, reduces delay and delay jitter, can meet various services' transmitting requirement.
Bie Y.,Nanjing University of Science and Technology |
Bie Y.,Dalian University |
Liu H.,Dalian University |
Liu H.,Liaoning Province Key Laboratory of Communication Networks and Information Processing |
And 2 more authors.
Information and Control | Year: 2013
For multi-type and high-capacity of space data based on AOS (advanced orbiting system) virtual channel multiplexing technology, the constraints problem on AOS virtual channel scheduling are analyzed, and an AOS virtual channel scheduling model is established. Furthermore, an AOS virtual channel scheduling algorithm based on adaptive entropy estimating genetic algorithm (AEEGA) is proposed. The algorithm can adaptively adjust the crossover probability and mutation probability according to populations' entropy and individuals' fitness. The virtual channels' scheduling flow is designed based on evolution operation. Experimental results show that the algorithm can maintain high-priority services' excellent performances of packets residual, packets dropping rate and delay, and keep preferable fairness for all virtual channels. Meanwhile, it has stronger global searching ability than adaptive genetic algorithm and higher overall satisfaction than dynamic priority scheduling algorithm.