首页> 外文会议>INFOCOM Workshops 2009 >Dynamic Scheduling of Survivable Connections with Delay Tolerance in WDM Networks
【24h】

Dynamic Scheduling of Survivable Connections with Delay Tolerance in WDM Networks

机译:WDM网络中具有时延容忍的可生存连接的动态调度

获取原文

摘要

In optical wavelength-division multiplexing (WDM) networks, recent technological progress is enabling dynamic optical transport in which leasable circuits (connections) can be set up and released for a specific duration of time, providing large capacity to bandwidth-hungry applications. Set-up times can be flexible or fixed, depending on the type of the application. Since the interruption of a high-speed optical connection could lead to huge loss of data, such connections need to be protected against failures. We study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and particular delay tolerances with shared path protection. The metric of delay tolerance is a measure of customer patience, and it is defined as the time a connection request can be held until it is set up. A connection that cannot be established at the instant of its request could potentially be set up in the remaining duration of its delay tolerance. We show that a reduction of up to 50 percent can be achieved on blocking probability by exploiting delay tolerance in networks without using extra backup capacity. In this study we explore different queuing policies for impatient customers. Different dynamic scheduling algorithms are applied and compared by giving priority to connections according to their arrival rates, delay tolerances and holding times alternatively.
机译:在光波分复用(WDM)网络中,最近的技术进步使得动态光传输成为可能,其中可建立可释放电路(连接)并释放特定时间段的动态光传输,从而为需要大量带宽的应用提供了大容量。设置时间可以灵活或固定,具体取决于应用程序的类型。由于高速光学连接的中断可能导致大量数据丢失,因此需要保护此类连接以防出现故障。我们研究了动态提供用户控制的连接请求的问题,该请求具有指定的保留时间和具有共享路径保护的特定延迟容限。延迟容忍度的度量标准是对客户耐心性的度量,它定义为连接请求在建立之前可以保留的时间。可能会在其延迟容忍的剩余时间内建立无法在其请求瞬间建立的连接。我们表明,通过利用网络中的延迟容限,而无需使用额外的备份容量,可以将阻塞概率降低多达50%。在这项研究中,我们探索了针对不耐烦客户的不同排队策略。通过根据连接的到达速率,延迟容限和保持时间为连接赋予优先级,可以应用和比较不同的动态调度算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号