Resource sharing in the most regular scheduling: deterministic performance and guarantee

  • Authors:
  • Chung Shue Chen;Wing Shing Song

  • Affiliations:
  • LORIA, CNRS, Villers Les Nancy, France and Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong

  • Venue:
  • MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Providing performance guarantee is one of the most important issues in a heterogeneous network for a large number of concurrent sessions. A common question in the network control and resource scheduling is how to provide end-to-end delay bounds and offer service guarantees in a relatively distributed manner. In this paper, we will narrow down the question and address specifically on the MRBS multiple access [25]. It supports each user a flexible ratematched time sharing with efficient resource scheduling. A generalized system modeling and analytical framework is developed based on the techniques of network calculus [13]. The result extends from single-node scheduling to multiple layered scenarios with deterministic performance guarantees. Potential applications are discussed at last.