A Graph-Theoretic Model of Routing Hierarchies

Yvonne Lai, W. Lai
{"title":"A Graph-Theoretic Model of Routing Hierarchies","authors":"Yvonne Lai, W. Lai","doi":"10.1109/WAINA.2009.94","DOIUrl":null,"url":null,"abstract":"We present a graph-theoretic model of routing hierarchies that abstracts the generic properties of standard routing protocols such as PNNI and OSPF/BGP. These protocols are currently deployed in operational networks. Our model is based on purely topological constructs, without referring to protocol details. Through graph partitioning and refinements, a multi-level hierarchy of sibling and child clusters is obtained. By hiding the topology of a cluster from outside, this structure allows routing protocols to scale to support large networks. Without revealing intra-cluster details, a cluster cost graph is defined in terms of entry-to-exit transit costs. This graph is advertised to other clusters. Each node within a cluster combines the cost graphs from other clusters to construct a routing graph for routing traffic. The limited view of a routing graph may sometimes lead to suboptimal path selection. Additionally, routing between sibling clusters may have loops; protocol restrictions are needed for loop avoidance.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2009.94","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

We present a graph-theoretic model of routing hierarchies that abstracts the generic properties of standard routing protocols such as PNNI and OSPF/BGP. These protocols are currently deployed in operational networks. Our model is based on purely topological constructs, without referring to protocol details. Through graph partitioning and refinements, a multi-level hierarchy of sibling and child clusters is obtained. By hiding the topology of a cluster from outside, this structure allows routing protocols to scale to support large networks. Without revealing intra-cluster details, a cluster cost graph is defined in terms of entry-to-exit transit costs. This graph is advertised to other clusters. Each node within a cluster combines the cost graphs from other clusters to construct a routing graph for routing traffic. The limited view of a routing graph may sometimes lead to suboptimal path selection. Additionally, routing between sibling clusters may have loops; protocol restrictions are needed for loop avoidance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
路由层次的图论模型
我们提出了一个路由层次的图论模型,抽象了标准路由协议(如PNNI和OSPF/BGP)的一般属性。这些协议目前部署在业务网络中。我们的模型基于纯粹的拓扑结构,而不参考协议细节。通过图的划分和细化,得到了一个多层次的兄弟簇和子簇结构。通过对外部隐藏集群的拓扑结构,这种结构允许路由协议扩展以支持大型网络。在不透露集群内部细节的情况下,集群成本图是根据入口到出口的运输成本来定义的。此图将发布到其他集群。集群中的每个节点结合来自其他集群的代价图来构建路由流量的路由图。路由图的有限视图有时会导致次优路径选择。此外,兄弟集群之间的路由可能有环路;为了避免环路,需要协议限制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Efficient Routing Mechanism Based on Heading Angle A Semantic Approach for Trust Information Exchange in Federation Systems Knowledge Extraction and Extrapolation Using Ancient and Modern Biomedical Literature Secure Safety Messages Broadcasting in Vehicular Network A Proposal of Tsunami Warning System Using Area Mail Disaster Information Service on Mobile Phones
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1