检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学计算机科学与技术学院,武汉430074
出 处:《计算机科学》2008年第6期55-59,共5页Computer Science
基 金:国家“863”项目MSR城域网实用化项目(项目编号:2005AA121411)资助
摘 要:研究了在区分服务体系结构中传统的标记算法,传统的标记算法不能提供标记的准确性和按比例共享带宽的公平性。在此基础上,提出了一种改进的标记算法。该算法在进行数据包的标记时,同时考虑平均速率和瞬时速率两个参数,提高了标记的准确性。当流的速率超过目标速率时,按照正比于数据流的速率的概率将超过速率的流标记为黄色,这样提高了对剩余带宽的公平共享性。试验证明,ITCM算法与传统的标记算法相比,不仅能提高吞吐量,还可以达到剩余带宽的按比例共享。The traditional traffic markers cannot provide precision of marking and proportional fairness in the current Differentiated Service (DiffServ) networks. To solve these problems, the Innovation Three Color Marker(ITCM) algorithm is proposed in this paper. ITCM algorithm calculates both the long term average rate and the instantaneous rate of traffic when marking the packet. Moreover, ITCM algorithm achieves the proportional fair sharing among aggregates by marking the packet as yellow with probability in proportion to CIR. This paper has compared the performance of ITCM marker with traditional markers. Simulation results show that ITCM algorithm performs better than traditional markers in the case of under-subscription. It not only achieves the target rate, but also achieves proportional fairness of sharing the excess bandwidth.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249