检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王瑞军[1] 王洪君[1] 王大东[1] 高远[1]
出 处:《计算机工程》2005年第21期45-47,共3页Computer Engineering
基 金:国家自然科学基金资助项目(60073059;60273078)
摘 要:总结归纳了复杂域间路由体系中自治系统间的互联关系及其行为模式,指出peer-peer和customer-provider关系是当前域间路由的基础,并由此衍生出若干种复杂关系。分析了各种关系的成因,讨论它们的不同实现技术和当前存在的一些技术瓶颈,进一步给出了一种能够识别自治系统关系并自动约束域间路由行为的增强算法。算法兼容RFC1771系列域间路由规范。A summarization is made on the relationships between autonomous systems and their behaviors in the complex inter-domain routing system. This paper points out that the peer-peer and customer-provider are basic relationships in current inter-domain routing system, coming with a series of complex relationships derived from them. An analysis is given why the existence of these relationships. It discusses their different implementations and some current technology bottle-necks. It also gives an enhanced algorithm, which can identify the relationships between autonomous systems and can constrain the inter-domain routing behavior automatically. The algorithm is in consistent with. RFC1771 series inter-domain routing standards.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.172