-
185浏览
-
0点赞
-
0收藏
-
0分享
-
111下载
-
0评论
-
引用
期刊论文
Fuzzy Least-Congested Path Routing and Improved Remote-Path Routing based on Hierarchical Information in WDM Networks*
Photoulc Network Communlcations, 8: 3, 335-340, 2004,-0001,():
Although routing schemes based on global knowledge make most optimal routing decisions, they will occupy many resources to keep the state information of the network up-to-date. In tiffs work, we describe a fuzzy least-congested path (FLCP) routing algorlitm based on hierarchical liformation. Simulation shows that the blocking probability using FLCP is very near to the blocking probability using the least-congested path routing (LCP) algorittm based on global information. Under heavy traffic load, the FLCP alg orlihm is superior to the exhaustive algorittm (EA) and the LCP algorittm with unit information cost. The FLCP algorlitm provides better routing, even withincomplete information. Thus, the algorlitm requires less information of the network, particularly under heavy traffic load. In addition, an improved remote-path routing approach is provided to reduce the blocking probability of connection requests to a node that is many hops away from the source node.
【免责声明】以下全部内容由[徐安士]上传于[2005年06月16日 23时24分53秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果