IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/391493.html
   My bibliography  Save this article

A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary

Author

Listed:
  • Ye Tian
  • Qingfan Li
  • Yongxin Feng
  • Xiaoling Gao

Abstract

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.

Suggested Citation

  • Ye Tian & Qingfan Li & Yongxin Feng & Xiaoling Gao, 2013. "A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-13, September.
    • Handle: RePEc:hin:jnlmpe:391493
    DOI: 10.1155/2013/391493
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2013/391493.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2013/391493.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/391493?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:391493. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.