A virtual channels scheduling algorithm with broad applicability based on movable boundary
type: Item
instance of: scholarly article
title: A virtual channels scheduling algorithm with broad applicability based on movable boundary
zbMATH Open document ID: 1299.90163
DOI: 10.1155/2013/391493
author: J. Herrera
author: Sumit K. Garg
published in: Mathematical Problems in Engineering
publication date: 2014-11-24T00:00:00Z
review text: Summary: A virtual channels scheduling algorithm with broad applicability based on movable boundary is proposed. According to the types of date sources, transmission time slots are divided into synchronous ones and asynchronous ones with a movable boundary between them. During the synchronous time slots, the virtual channels are scheduled with a polling algorithm; during the asynchronous time slots, the virtual channels are scheduled with an algorithm based on virtual channel urgency and frame urgency. If there are no valid frames in the corresponding VC at a certain synchronous time slot, a frame of the other synchronous VCs or asynchronous VCs will be transmitted through the physical channel. Only when there are no valid frames in all VCs would an idle frame be generated and transmitted. Experiments show that the proposed algorithm yields much lower scheduling delay and higher channel utilization ratio than those based on unmovable boundary or virtual channel urgency in many kinds of sources. Therefore, broad applicability can be achieved by the proposed algorithm.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6372255
Wikidata QID: Q59024340
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/391493
OpenAlex ID: W2168551783
description: scientific article; zbMATH DE number 6372255