Contention-Free λ-Planes in Optically Burst-Switched WDM Networks

• HIRATA Kouji

  the Graduate School of Engineering, Osaka University

• MATSUDA Takahiro

  the Graduate School of Engineering, Osaka University

• NAGAMOCHI Hiroshi

  the Graduate School of Informatics, Kyoto University

• TAKINE Tetsuya

  the Graduate School of Engineering, Osaka University

抄録

This paper proposes a contention-free burst scheduling scheme for optically burst-switched WDM networks. We construct contention-free wavelength planes (λ-planes) by assigning dedicated wavelengths to each ingress node. Bursts are transmitted to their egress nodes on λ-planes, along routes forming a spanning tree. As a result, contention at intermediate core nodes is completely eliminated, and contention at ingress nodes is resolved by means of electric buffers. This paper develops a spanning tree construction algorithm, aiming at balancing input loads among output ports at each ingress node. Furthermore, a wavelength assignment algorithm is proposed, which is based on the amount of traffic lost at ingress nodes. We show that the proposed scheme can decrease the burst loss probability drastically, even if traffic intensities at ingress nodes are different.

収録刊行物

• IEICE transactions on communications

  IEICE transactions on communications 90 (9), 2524-2531, 2007-09-01

  一般社団法人電子情報通信学会

キーワード

• optical burst switching
• WDM
• wavelength assignment
• burst scheduling

詳細情報

• CRID: 1573105977363374208
• NII論文ID: 110007541065
• NII書誌ID: AA10826261
• ISSN: 09168516
• DOI: 10.1093/ietcom/e90-b.9.2524
• 本文言語コード: en
• データソース種別:
  • CiNii Articles