节点文献

Contention avoidance using dual-fuzzy assembly threshold algorithm in optical burst switching networks

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 杨九如王钢贾世楼

【Author】 YANG Jiu-ru 1,2,WANG Gang 1,JIA Shi-lou 1(1.Communication Research Center,Harbin Institute of Technology,Harbin 150001,China;2.School of Electronic Engineering,Heilongjiang University,Harbin 150080,China)

【机构】 Communication Research Center,Harbin Institute of TechnologySchool of Electronic Engineering,Heilongjiang University

【摘要】 To avoid burst contention efficiently,on the basis of feedback-based source flow-rate control(SFC) strategy,a novel fuzzy-control-based assembly algorithm,called dual-fuzzy assembly threshold(DFAT),is proposed in an optical burst switching network.In our algorithm,according to the variations of burst assembly period and the interarrival of burst control packet,the traffic states of edge-switching nodes and core-switching nodes are first obtained.Then,the assembly threshold of bursts is set dynamically in order to operate the source traffic management from the information of traffic states.The performance of DFAT algorithm on burst loss probability is evaluated,and simulation results show that,compared with conventional assembly algorithms,the proposed scheme can constrain the birth of burst contention efficiently,when being a heavy load state of network.

【Abstract】 To avoid burst contention efficiently,on the basis of feedback-based source flow-rate control(SFC) strategy,a novel fuzzy-control-based assembly algorithm,called dual-fuzzy assembly threshold(DFAT),is proposed in an optical burst switching network.In our algorithm,according to the variations of burst assembly period and the interarrival of burst control packet,the traffic states of edge-switching nodes and core-switching nodes are first obtained.Then,the assembly threshold of bursts is set dynamically in order to operate the source traffic management from the information of traffic states.The performance of DFAT algorithm on burst loss probability is evaluated,and simulation results show that,compared with conventional assembly algorithms,the proposed scheme can constrain the birth of burst contention efficiently,when being a heavy load state of network.

【基金】 Sponsored by the Science and Technology Project of Education Department of Heilongjiang Province (Grant No. 11521212)
  • 【文献出处】 Journal of Harbin Institute of Technology ,哈尔滨工业大学学报(英文版) , 编辑部邮箱 ,2009年04期
  • 【分类号】TN929.1
  • 【下载频次】26
节点文献中: 

本文链接的文献网络图示:

本文的引文网络