论文部分内容阅读
本文研究了支持分组交换通信的波长路由光网的逻辑拓扑设计问题，并将它表示为混合整数线性规划问题（ＭＩＬＰ），其目标函数为最小化平均分组跳数目在约束条件中同时考虑了分组传输时延和排队时延我们以６结点的网络为例，对于不同的收发机数目和时延边界，数值结果表明最小化平均分组跳数目等价于最小化网络拥塞小的平均分组跳数目可以保证网络通信时具有较小的时延最后，对于不同的通信模式，我们比较分析了网格的优化性能参数，这些结果有助于提出更好的启发式算法
This paper studies the design of logical topology for wavelength-switched optical networks supporting packet-switched communications and presents it as a mixed integer linear programming (MILP) problem whose objective function is to minimize the number of average packet-hops, taking into account both the constraints Packet transmission delay and queuing delay We take a 6-node network as an example. For different transceiver numbers and delay boundaries, the numerical results show that minimizing the average packet-hop number is equivalent to minimizing the network congestion. The number of packet hops guarantees that there is less delay in the network communication. Finally, we compare and analyze the optimal performance parameters of the grid for different communication modes. These results help to propose better heuristic algorithms.