首页> 外文会议>COCOON 2008;Annual International Conference on Computing and Combinatorics >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 Multilog网络的线性规划对偶方法

获取原文

摘要

In an optical crossConnect architecture, two routes sharing a common switching element suffer from crosstalk. Vaez and Lea [16] introduced a parameter c which is the maximum number of distinct switching elements a route can share with other routes in the crossConnect. We present a new method of analyzing strictly nonblocking d-ary multilog networks under this general crosstalk constraint using linear programming duality. We improve known results on several fronts: (a) our sufficient conditions are better than known sufficient conditions for log_d(N,0,m) to be nonblocking under the general crosstalk constraint, (b) our results are on d-ary multilog networks while known results are on binary networks, and (c) for several ranges of the parameter c, we give the first known necessary conditions for this problem which also match our sufficient conditions from the LP-duality approach.
机译:在光学交叉连接体系结构中,共享一个公共交换元件的两条路由会受到串扰。 Vaez和Lea [16]引入了一个参数c,它是一个路由可以与crossConnect中的其他路由共享的最大不同交换元件的数量。我们提出了一种使用线性规划对偶性在这种一般串扰约束下分析严格无阻塞的dary多对数网络的新方法。我们在几个方面改进了已知结果:(a)我们的充分条件要好于已知的充分条件,以便在一般的串扰约束下使log_d(N,0,m)无阻塞;(b)我们的结果是在d元多对数网络上尽管已知结果在二进制网络上,并且(c)对于参数c的多个范围,我们给出了该问题的第一个已知必要条件,该条件也与LP对偶方法的充分条件相匹配。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号