首页> 外文期刊>Journal of Combinatorial Optimization >A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints
【24h】

A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints

机译:在一般串扰约束下分析严格无阻塞的dary多对数网络的线性规划对偶方法

获取原文
获取原文并翻译 | 示例
           

摘要

When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two routes share too many switching elements, then crosstalk introduced at those switching elements degrades signal quality. Vaez and Lea (IEEE Trans. Commun. 48:(2)316–323, 2000) introduced a parameter c which is the maximum number of distinct switching elements a route can share with other routes in the network. This is called the general crosstalk constraint. This paper presents a new method of analyzing strictly nonblocking multi-log networks under this general crosstalk constraint using linear programming duality.
机译:当使用交换网络拓扑结构来构建光学交叉连接时,如在电路交换情况下,不允许两条路由共享一条链路。但是,如果两条路径共享太多的交换元件,则在那些交换元件处引入的串扰会降低信号质量。 Vaez和Lea(IEEE Trans。Commun。48:(2)316–323,2000)引入了一个参数c,该参数c是一条路由可以与网络中其他路由共享的最大不同交换元素的数量。这称为一般串扰约束。本文提出了一种新的方法,该方法使用线性规划对偶性在这种一般的串扰约束下分析严格无阻塞的多对数网络。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号