检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马钰璐[1] 罗忠生[1] 王重钢[2] 程时端[2]
机构地区:[1]中兴通讯股份有限公司,上海200231 [2]北京邮电大学程控交换技术与通信网国家实验室,北京100876
出 处:《计算机学报》2002年第11期1231-1235,共5页Chinese Journal of Computers
摘 要:该文提出关于实时IP多播流基于速率弹性的公平性定义,并结合有关多播组规模估计的机制和多播拥塞控制算法,实现了一种基于门限的实时多播业务的等级拥塞控制策略,使实时多播流在满足瞬态弹性公平性的同时,也基本满足稳态的比例公平性,并对此进行了仿真验证.This paper proposes a new elastic fairness for real-time IP multicast traffic. The definition can be applied in performing flow and congestion control for real-time IP multicast traffic, together with multicast group measurement and multicast congestion control mechanisms. Different services have different service requirements, and data service is more sensitive for bandwidth, although real-time service focuses more on delay and jitter. Elastic fairness specifies different levels for different sessions from the jitter point of view. So fairness is guaranteed not only in bandwidth, but also in rate variation. Authors further devise two algorithms to apply the generalized fairness concept in congestion control. Time-based algorithm adjusts sending rate gradually in a step length of round trip times. Loss rate-based algorithm adjusts sending rate by different equation, which depends on the session weights. Therefore, real-time multicast flow meets both elastic fairness in small time scale and proportional fairness in large time scale.
关 键 词:实时多播流 弹性公平性 门限 拥控制策略 INTERNET 仿真 计算机网络
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.225