检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学计算机科学与工程学院,南京210096 [2]计算机网络和信息集成教育部重点实验室(东南大学),南京210096
出 处:《北京邮电大学学报》2011年第3期84-88,共5页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金面上项目(61070159);高等学校博士学科点专项科研基金项目(20090092120029)
摘 要:为了解决网络服务中的资源优化分配问题,提出一种价格自适应的链路带宽和缓冲区分配算法.利用有效带宽的生产函数特性分析了以价格为导向、费用最小化为目标的有效带宽资源组合方式,将带宽和缓冲区分配进行解耦,从相对价格和绝对价格调整2个层面提出了追求分配步调一致和高资源利用率的链路带宽和缓冲区分配算法.实验结果表明,算法在控制请求阻塞率的同时可显著提高链路带宽和缓冲区资源利用率.The effective bandwidth, acting as an economic production function of network service, is commonly used to impose admission control on real-time traffic. Yet the allocation of bandwidth and buffer remains as a technical problem and an economic one as well. A price-driven resource composition algorithm is proposed based on Courcoubetis effective bandwidth formula, aiming to keep the allocation of bandwidth and buffer in step while following the objective of charge minimization. Then an adaptive pricing mechanism for bandwidth and buffer allocation is presented to improve the resource utilization ratio, in which prices are adjusted relatively and absolutely at different time scales respectively. Simulation resuits show that the proposed scheme could effectively improve the resource utilization ratio and keep the call blocked ratio at reasonable level.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.21.33.186