| 一种基于分组对的分层组播拥塞控制机制 |
| |
| 引用本文： | 任立勇.一种基于分组对的分层组播拥塞控制机制[J].电子科技大学学报（自然科学版）,2002,31(6):602-607. |
| |
| 作者姓名： | 任立勇 |
| |
| 作者单位： | 1.电子科技大学计算机科学与工程学院 成都 610054 |
| |
| 基金项目： | 信息产业部生产发展基金资助项目 |
| |
| 摘 要： | 分析了现有分层组播拥塞控制协议的基本原理,提出了一种基于分组对推测网络可用带宽的分层组播拥塞控制机制PLMCC。其中间节点和接收者利用逐级向下的分组对来推测本地可用带宽,实现对本地可用带宽的准确、快速推测。接收者只需向其父节点发送反馈报文,就可以在最短的时间内获得其允许的最佳接收速率。仿真试验证明,PLMCC不仅具有快速的收敛速度,同时具有良好的协议间公平性和可伸缩性。
|
| 关 键 词： | 分层组播 分组对 拥塞控制 带宽推测 |
| 收稿时间： | 2002-07-01 |
A Packet-Pair-Based Layered Multicast Congestion Control Schemes |
| |
| Affiliation: | 1.College of Computer Science and Engineering,UEST of China Chengdu 610054 |
| |
| Abstract: | Layered transmission of data is the general recommended solution to the problem of varying bandwidth constraints in multicast applications. In this paper, several existing layered multicast congestion control protocols are analyzed and their inherent shortcomings are pointed out. Then a novel layered multicast congestion control, PLMCC that is based on packet-pair, is presented. In PLMCC, middle nodes and receivers infer local available bandwidth accurately and quickly by hop-by-hop downward packet-pair. Moreover, each receiver can obtain its optimal throughput in the least time just only sending feedback message to its parent. Simulation results show that PLMCC not only can converge fast, but also is TCP-friendly and scalable. |
| |
| Keywords: | |
| 本文献已被 维普 等数据库收录！ |
| 点击此处可从《电子科技大学学报（自然科学版）》浏览原始摘要信息 |
|
点击此处可从《电子科技大学学报（自然科学版）》下载全文 |
|
