首页> 外文会议>INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE >Heuristic algorithms for joint configuration of the optical and electrical layer in multi-hop wavelength routing networks
【24h】

Heuristic algorithms for joint configuration of the optical and electrical layer in multi-hop wavelength routing networks

机译:多跳波长路由网络中光电层的联合配置的启发式算法

获取原文

摘要

An efficient and general graph-theoretic model (the wavelength-graph (WG)) has been proposed which enables solution of the static routing and wavelength assignment (RWA) problems in multihop wavelength routing (WR) wavelength division multiplexing (WDM) networks simultaneously, and-as a unique feature-it optimises the optical layer jointly with the electrical one. Based on the proposed WG model the problem has been formulated as an integer linear program (ILP), solved by stochastic algorithms improved by simple heuristics. The topology of the physical layer, the type of each node (e.g., OADM, OXC or EXC), the number of available wavelengths per link and the capacity of each wavelength-channel are assumed given with the aggregated traffic demand of each node-pair. The output of the optimisation is the system of wavelength paths, light paths and semi-light paths. The objective of the optimisation is to reduce resource usage at upper (electrical) layers, subject to the constrained amount of capacity of each wavelength and a limited number of wavelengths. Although the problem to be solved is NP-hard, all methods proposed give a result in a very short time.
机译:已经提出了一种有效且通用的图论模型(波长图(WG)),该模型能够同时解决多跳波长路由(WR)波分复用(WDM)网络中的静态路由和波长分配(RWA)问题,作为一项独特功能,它与电气层一起优化了光学层。在提出的WG模型的基础上,该问题已公式化为整数线性程序(ILP),并通过简单启发式算法改进的随机算法解决了该问题。假定物理层的拓扑结构,每个节点的类型(例如OADM,OXC或EXC),每个链路的可用波长数以及每个波长信道的容量与每个节点对的总流量需求一起给出。优化的输出是波长路径,光路径和半光路径的系统。优化的目的是减少上(电)层的资源使用,这取决于每个波长的容量和有限数量的波长。尽管要解决的问题是NP难题,但所提出的所有方法都能在很短的时间内得出结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号