Scheduling support for multicasting sessions in broadband communication networks

Khalid H. Sheta, M. Singhal
{"title":"Scheduling support for multicasting sessions in broadband communication networks","authors":"Khalid H. Sheta, M. Singhal","doi":"10.1109/ICCCN.1997.623310","DOIUrl":null,"url":null,"abstract":"Multimedia applications require support from the underlying broadband network at the end-to-end communication level. Multicasting is an important paradigm of end-to-end communication. The root node of a multicasting session is responsible for controlling the session including monitoring, maintenance, and the implementation of the multicasting protocol. The job that controls the multicasting session executes as a group of tasks at the root node of a multicasting tree. The scheduling scheme at the root node should give support to a multicasting session by improving the completion time of the jobs controlling the multicasting session, hence increasing throughput and the probability of admitting new multicast sessions. We model the tasks that carry out the multicasting session monitoring and maintenance as a fork-join job executing on a multiprocessor system. We assume that an executing task blocks for device I/O as a part of the activities associated with sending and receiving data packets. We develop two analytic models for scheduling a session control job on a multiprocessor system. The first allows incoming job tasks to multiplex processors with existing tasks of another multicasting session; the other model schedules a task of the incoming job to an idle processor. We assume that the overhead of rescheduling a task to another processor is large. We compare the performance of both models and show the range of conditions under which a model outperforms the other. The results can be used in the design of an adaptive scheduler that uses both models to improve throughput and the probability of admitting new multicast sessions.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Sixth International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.1997.623310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Multimedia applications require support from the underlying broadband network at the end-to-end communication level. Multicasting is an important paradigm of end-to-end communication. The root node of a multicasting session is responsible for controlling the session including monitoring, maintenance, and the implementation of the multicasting protocol. The job that controls the multicasting session executes as a group of tasks at the root node of a multicasting tree. The scheduling scheme at the root node should give support to a multicasting session by improving the completion time of the jobs controlling the multicasting session, hence increasing throughput and the probability of admitting new multicast sessions. We model the tasks that carry out the multicasting session monitoring and maintenance as a fork-join job executing on a multiprocessor system. We assume that an executing task blocks for device I/O as a part of the activities associated with sending and receiving data packets. We develop two analytic models for scheduling a session control job on a multiprocessor system. The first allows incoming job tasks to multiplex processors with existing tasks of another multicasting session; the other model schedules a task of the incoming job to an idle processor. We assume that the overhead of rescheduling a task to another processor is large. We compare the performance of both models and show the range of conditions under which a model outperforms the other. The results can be used in the design of an adaptive scheduler that uses both models to improve throughput and the probability of admitting new multicast sessions.
对宽带通信网络中多播会话的调度支持
多媒体应用需要底层宽带网络在端到端通信层的支持。多播是端到端通信的一个重要范例。组播会话的根节点负责控制会话,包括监控、维护和组播协议的实现。控制多播会话的作业在多播树的根节点上作为一组任务执行。根节点的调度方案应该通过改善控制组播会话的作业的完成时间来支持组播会话,从而提高吞吐量和接纳新组播会话的概率。我们将执行多播会话监视和维护的任务建模为在多处理器系统上执行的fork-join作业。我们假设设备I/O的执行任务块是与发送和接收数据包相关的活动的一部分。在多处理机系统上建立了两个会话控制作业调度的分析模型。第一种允许传入的作业任务与另一组播会话的现有任务多路复用处理器;另一个模型将传入作业的任务调度到空闲处理器。我们假设将任务重新调度到另一个处理器的开销很大。我们比较了两个模型的性能,并展示了一个模型优于另一个模型的条件范围。研究结果可用于自适应调度程序的设计,该调度程序使用这两种模型来提高吞吐量和允许新组播会话的概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信