【24h】

Survivable inter-domain routing based on topology aggregation with disjointness information in multi-domain optical networks

机译:基于多域光网络中的拓扑信息来生存域间路由的域间路由

获取原文

摘要

In a multi-domain network, domains can be defined geographically or administratively. Since only a limited amount of information of each domain is allowed to be broadcasted by domain service providers, Topology Aggregation (TA) is usually adopted. The amount of information provided by each domain may vary based on the service provider. For instance, some domains may provide only a single shortest path between two border nodes, while others may be capable of providing a pair of disjoint paths with minimum total cost. In this case, inter-domain path routing with protection needs to consider and utilize the different levels of information provided by different domains in order to find the best solution. In this paper, we propose two approaches that find a pair of disjoint inter-domain paths with minimum total cost based on a matrix for each domain that includes disjointness information between the aggregated links inside the domain.
机译:在多域网络中,可以在地理上或管理地区定义域。 由于允许通过域服务提供商广播每个域的有限量的信息,因此通常采用拓扑聚合(TA)。 每个域提供的信息量可能因服务提供商而异。 例如,一些域可以仅提供两个边界节点之间的单个最短路径,而其他域可以提供具有最小总成本的一对不相交的路径。 在这种情况下,具有保护的域间路径路由需要考虑并利用不同域提供的不同信息才能找到最佳解决方案。 在本文中,我们提出了两种方法,该方法是基于每个域的矩阵找到具有最小总成本的一对域间路径的方法,该路径包括在域内的聚合链路之间的折叠信息。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号