• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Design and optimization of packet switching and traffic grooming in WDM optical networks.
【24h】

Design and optimization of packet switching and traffic grooming in WDM optical networks.

机译：WDM光网络中分组交换和流量疏导的设计和优化。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Optical packet switching is a long-term strategy to provide high-speed transmission, data transparency, and reconfigurability. Optical buffers are used in the switches to resolve contentions that occur whenever two packets are destined to the same output at the same time slot. Due to the lack of optical random access memory, fiber delay line (FDL) is currently the only way to implement optical buffering. In general, optical buffering structures can be categorized in two classes: feed-forward and feedback, both of which have advantages and disadvantages. In this research, we proposed a more effective hybrid buffering architecture that combines the merits of both schemes. It requires smaller optical device sizes and fewer wavelengths and has less noise than feedback architecture. At the same time, it can facilitate preemptive priority routing which feed-forward architecture cannot support. Based on this architecture, we described two switch designs---single plane and multiple plane. The numerical results showed that the new switch architecture can significantly reduce the packet loss probability.; The objective of traffic grooming is to save electronics cost by effectively assigning low-rate circuits onto high-speed channels. Generally, we can treat the traffic grooming problem as two steps: circuit construction and circuit grooming. In this research, we focused on developing efficient algorithms for circuit construction. Two heuristics based on Random Hill-climber and Simulated Annealing were proposed. Our algorithms are more aggressive in splitting the connections to achieve efficient circuit construction. Numerical results showed that the algorithms have good performance in reducing the low-rate circuit number and end node number.; We also studied the problem of weighted edge-decompositions of graphs which is related to circuit grooming. The research was focused on grooming symmetric traffic that we can always construct full low-rate circuits. The objective is to minimize the number of add/drop multiplexers by using the minimum number of wavelengths. Through numerical estimates, we obtained useful tight bounds of some special cases of k-decompositions of a graph.
机译：光分组交换是提供高速传输，数据透明性和可重新配置性的长期策略。交换机中使用光缓冲器来解决每两个数据包在同一时隙到达同一输出时发生的争用。由于缺少光学随机存取存储器，因此光纤延迟线（FDL）是当前实现光学缓冲的唯一方法。通常，光学缓冲结构可分为两类：前馈和反馈，两者都有优点和缺点。在这项研究中，我们提出了一种更有效的混合缓冲体系结构，该体系结构结合了两种方案的优点。与反馈架构相比，它需要更小的光学设备尺寸和更少的波长，并且具有更少的噪声。同时，它可以促进前馈架构无法支持的抢占式优先级路由。基于此架构，我们描述了两种开关设计-单平面和多平面。数值结果表明，新的交换架构可以大大降低丢包率。疏导流量的目的是通过有效地将低速率电路分配到高速通道上来节省电子设备成本。通常，我们可以将流量疏导问题分为两个步骤：电路构造和电路疏导。在这项研究中，我们专注于开发用于电路构建的高效算法。提出了两种基于随机爬山和模拟退火的启发式算法。我们的算法在断开连接以实现高效电路构造方面更具攻击性。数值结果表明，该算法在减少低速率电路数和终端节点数方面具有良好的性能。我们还研究了与电路修饰有关的图的加权边缘分解问题。该研究的重点是整理对称流量，我们始终可以构建完整的低速率电路。目的是通过使用最小数量的波长来最小化分插复用器的数量。通过数值估计，我们获得了图的k分解的一些特殊情况的有用紧边界。

著录项

  • 作者

    Li, Lin.;

  • 作者单位

    The University of Nebraska - Lincoln.;

  • 授予单位 The University of Nebraska - Lincoln.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2004
  • 页码 89 p.
  • 总页数 89
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号