助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[196]条 当前为第41条到60条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
dynamic traffic
As network loading forms the basis of many dynamic traffic assignment solution algorithms, we consider in this paper four macroscopic link models that are widely used in DTA studies as the building blocks of certain network loading procedures.
      
This paper presents an attempt to integrate dynamic traffic models and location choice models in a more consistent way than the four-step planning scheme.
      
Feedback Control Solutions to Network Level User-Equilibrium Real-Time Dynamic Traffic Assignment Problems
      
A new method for performing Dynamic Traffic Assignment (DTA) is presented which is applicable in real time, since the solution is based on feedback control.
      
In addition, the SPR-PW required signaling, upon and before the failure occurrence, is limited, which makes SPR-PW a scheme suitable for highly dynamic traffic scenarios, in which flows are subject to frequent changes.
      
Dynamic Survivability in WDM Mesh Networks Under Dynamic Traffic
      
In this paper, we systematically consider the problem of dynamic survivability with dynamic single link failure in WDM networks under dynamic traffic demands.
      
Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA).
      
Results show that during highly dynamic traffic conditions, AHRP possesses the lowest blocking probability, shorter setup delay, and less signaling overhead.
      
Dynamic traffic is becoming important in WDM networks.
      
In the transition towards full dynamic traffic, WDM networks optimized for a specific set of static connections will most likely also be used to support on-demand lightpath provisioning.
      
Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations.
      
Combining GA with Splitting Methods for Rearrangeably Nonblocking Grooming of Dynamic Traffic in SONET Ring Networks
      
Since traffic often changes frequently, the problem of supporting dynamic traffic patterns with minimum number of ADMs and wavelengths becomes incresingly important, which is referred to as grooming of dynamic traffic.
      
In this paper, we will deal with rearrangeably nonblocking grooming of arbitrary dynamic traffic in such ring networks.
      
This paper considers the problem of provisioning dynamic traffic using WBS in a WDM mesh network.
      
In this work, we have proposed and studied efficient online algorithms for shared path protection under dynamic traffic conditions in survivable WDM optical mesh networks.
      
In this paper, we consider the problem of traffic grooming in optical wavelength division multiplexed (WDM) mesh topology-based networks, under dynamic traffic conditions.
      
We also conduct a systematic performance evaluation of a limited grooming optical network supporting dynamic traffic requests.
      
We evaluate the proposed placement algorithms given static sets of multicast sessions as well as under dynamic traffic conditions, which are routed using our splitter constrained multicast routing algorithm.
      
 

首页上一页12345下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社