Resource Sharing in the Most Regular Scheduling: Deterministic Performance and Guarantee - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Resource Sharing in the Most Regular Scheduling: Deterministic Performance and Guarantee

(1) , (2)
1
2

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. It supports each user a flexible rate-matched time sharing with efficient resource scheduling. A generalized system modeling and analytical framework is developed based on the techniques of network calculus. The result extends from single-node scheduling to multiple layered scenarios with deterministic performance guarantees. Potential applications are discussed at last.
Fichier principal
Vignette du fichier
Resource_sharing_in_the_most_regular_scheduling.pdf (4.99 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00745063 , version 1 (24-10-2012)

Identifiers

Cite

Chung Shue Chen, Wing Shing Wong. Resource Sharing in the Most Regular Scheduling: Deterministic Performance and Guarantee. IEEE Military Communications Conference, IEEE, Oct 2006, Washington D. C., United States. ⟨10.1109/MILCOM.2006.302457⟩. ⟨hal-00745063⟩
300 View
282 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More