摘要
本文研究了支持分组交换通信的波长路由光网的逻辑拓扑设计问题,并将它表示为混合整数线性规划问题(MILP),其目标函数为最小化平均分组跳数目在约束条件中同时考虑了分组传输时延和排队时延我们以6结点的网络为例,对于不同的收发机数目和时延边界,数值结果表明最小化平均分组跳数目等价于最小化网络拥塞小的平均分组跳数目可以保证网络通信时具有较小的时延最后,对于不同的通信模式,我们比较分析了网格的优化性能参数。
this paper considers the problem of designing a logical topology for a wavelength routed optical network supporting packet switched traffic.It is formulated as a mixed integer linear programming (MILP) problem,the objective function is to minimize the number of average packet hops.The packet propagation delay and queuing delay are considered in the constraints.It is taken a six node network as an example.For various values of the transceivers per node and delay bounds,the numerical results shows minimizing the number of average packet hops is equivalent to minimizing congestion of the network.The fewer the number of average packet hops,the shorter the average delay for each node pair.Finally,It is analyzed the network optimal performance for different traffic patterns.Some results contribute to proposing better heuristic algorithms.
出处
《光子学报》
EI
CAS
CSCD
1999年第2期146-150,共5页
Acta Photonica Sinica
基金
国家863计划
国家自然科学基金
上海科技发展基金
关键词
波长路由光网
分组交换
逻辑拓扑
平均分组跳
Wavelength routed optical network
Packet switched
Logical topology design
Mixed integer linear programming
Average packet hops