Research of Virtual Channels Scheduling Algorithm Based on Priority in Packet Telemetry System

Ye Tian, Zijing Zhang, Yanqin Zhang, Xiao GuangyuanInternational Journal of Wireless and Microwave Technologies 2012 · DOI

Abstract

This research investigates priority-based virtual channel (VC) scheduling algorithms within packet telemetry systems. By analyzing the probability of physical channel occupation and packet loss rates for the highest-priority VC under Poisson arrival conditions, the study establishes that these metrics converge to fixed values over time. The provided mathematical framework offers a robust reference for engineering buffer designs in space communication systems.

In space missions, a single physical communication link—the downlink—is responsible for transmitting a diverse array of data, from time-critical "express" telemetry to routine engineering logs. To manage this, the Consultative Committee for Space Data Systems (CCSDS) utilizes Virtual Channels (VCs), which are logical paths sharing the physical link through time-division multiplexing.

The primary challenge lies in the scheduling algorithm: determining which VC occupies the next available time slot. While priority-based scheduling ensures urgent data is prioritized, predicting exact bandwidth consumption and potential packet loss due to buffer overflows is complex. Without precise mathematical models, engineers often over-provision hardware, a costly practice in aerospace.

Methodology

The study models a system with four distinct virtual channels:

  1. VC2 (Highest Priority): Critical express data.
  2. VC1 (Second Priority): General engineering data.
  3. VC3 (Lowest Priority): Bulk download data.
  4. VC4 (Idle): Used only when all other buffers are empty.

Traffic is modeled using a Poisson distribution to represent random, independent packet arrivals. The researchers derived recursive formulas to track the state of the VC2 buffer at each scheduling interval. These theoretical models were then validated against computer simulations to ensure accuracy.

Key Insights: Predictable Convergence

A significant finding of this research is that the system reaches a "steady state." Despite the inherent randomness of packet arrivals, the probability that the high-priority channel (VC2) will occupy the physical link stabilizes into a fixed value as the system operates.

Occupation probability of VC2 over time, showing convergence and model validation.

This predictability allows for the creation of precise buffer design tools. By utilizing the derived formulas, designers can input a target packet loss rate and calculate the exact buffer capacity ($M$) required, optimizing hardware usage without compromising reliability.

Results and Validation

The simulation results closely mirror the theoretical mathematical curves, confirming the model's validity.

Probability of losing one packet over time, demonstrating steady-state behavior.

Key performance metrics observed include:

  • Occupation Probability: In the test scenario, the probability of VC2 occupying the channel converged to approximately 0.17.
  • Packet Loss Precision: The model successfully predicted low-frequency events, such as the probability of losing a single packet (calculated in the $10^{-4}$ range), which is vital for high-reliability telemetry.

Conclusion and Future Directions

While this research provides a solid foundation for modeling high-priority channel behavior, it primarily focuses on the "winner" of the scheduling process. Future work could explore the impact of "starvation" on lower-priority channels (VC1 and VC3) and investigate performance under non-Poisson, "bursty" traffic patterns. Additionally, exploring dynamic scheduling methods like Weighted Fair Queuing could reveal if similar convergence properties apply beyond fixed-priority systems.

Summary updated

Abstract

We make research on the virtual channels scheduling algorithm based on priority in packet telemetry system. Probability of occupying physical channel and packets losing rate of the virtual channel with the highest priority are considered, on condition that the packet arrival rate contribution is Poisson contribution. Theoretical analysis and simulation results show that when the running time of the scheduling module is long enough, probability of occupying physical channel by the virtual channel with the highest priority converge on a fixed value. Formulas of calculating packets losing rate are also given, which can offer reference to engineering design.
BibTeX
@article{tian2012research,
  author = {Ye Tian and Zijing Zhang and Yanqin Zhang and XIAO Guangyuan},
  title = {{Research of Virtual Channels Scheduling Algorithm Based on Priority in Packet Telemetry System}},
  journal = {International Journal of Wireless and Microwave Technologies},
  year = {2012},
  doi = {10.5815/ijwmt.2012.02.09},
}
Figure