检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]InformationTechnologyInstitute,InformationEngineeringUniversityofPLA,Zhengzhou450002,P.R.China
出 处:《High Technology Letters》2005年第1期25-29,共5页高技术通讯(英文版)
基 金:国家高技术研究发展计划(863计划)
摘 要:We investigate the problem of efficiently provisioning connections of arbitrary bandwidth granularities in integrated optical Internet model, and propose a novel dynamic weighted fair routing algorithm (DWFA) that employs QoS-aware flexible adaptive unified routing strategies according to the priority and granularity of the traffic connection request. Performance simulation results of DWFA show that our adaptive approach performs better in terms of traffic blocking ratio, traffic blocking fairness and traffic average logical hop counts than traditional overlay sequential routing scheme such as optical-layer-first routing (OFR) and electrical-layer-first routing (EFR). DWFA is very suitable for solving QoS-based multi-layer integrated routing (MLIR) problem in the next generation multi-granularity integrated optical Internet.
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117