检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马震远[1,2] 周杰[1,2] 陈楚 张凌[1,2]
机构地区:[1]华南理工大学计算机学院,广州510640 [2]广东省计算机网络重点实验室,广州510640
出 处:《西安交通大学学报》2010年第2期44-49,共6页Journal of Xi'an Jiaotong University
基 金:国家重点基础研究发展规划资助项目(2009CB320505);国家科技支撑计划资助项目(2008BAH37B08)
摘 要:针对现有的任播通信(anycast)模型无法在具有可扩展性的同时提供QoS支持,提出了一种分段测量的任播通信模型(SMA).通过任播通信组成员之间的竞争将最优成员的单播地址存储到相应路由器,由此解决了路由表膨胀问题.同时,提出了一种由分段延迟变化估计总体延迟变化上界的方法,通过组成员和路由器之间的小范围网络参数的测量、分享和估计,支持带QoS约束的任播通信请求.PlanetLab上的实验表明,所提方法的准确性较高.模拟真实Internet结构的网络拓扑仿真证明,SMA不但具有较高的最优组成员发现效率,而且还具有良好的可扩展性和可实现性.Since the existing anycast communication models can not achieve scalability and provide QoS guarantee simultaneously, an anycast communication model-SMA is proposed based on segmental measurement. The routing table is restricted by the competition among anycast group members, and only one winner can write its unicast address to the related routers. A method to estimate the variation upper bound of end-to-end delay is proposed. The anycast requests with QoS constraint are supported by measuring, sharing and estimating network parameters between routers and anycast members in a small region. Experiments on PlanetLab show that the proposed estimation method is accurate. Simulations in a nearly real Internet topology show that the SMA is efficient in the selection of best members and has good scalability and reliability as well.
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.223.125.111