ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 020 学位論文
  2. 複合科学研究科
  3. 17 情報学専攻

Fairness Provisioning in Optical Burst Switching Networks

https://ir.soken.ac.jp/records/1504
https://ir.soken.ac.jp/records/1504
7c33073e-fd13-43d5-80b9-25562ebe9585
名前 / ファイル ライセンス アクション
甲1289_要旨.pdf 要旨・審査要旨 (244.4 kB)
Item type 学位論文 / Thesis or Dissertation(1)
公開日 2010-06-09
タイトル
タイトル Fairness Provisioning in Optical Burst Switching Networks
タイトル
タイトル Fairness Provisioning in Optical Burst Switching Networks
言語 en
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_46ec
資源タイプ thesis
著者名 ORAWIWATTANAKUL, Tananun

× ORAWIWATTANAKUL, Tananun

ORAWIWATTANAKUL, Tananun

Search repository
フリガナ オラウィワタナクン, タナナン

× オラウィワタナクン, タナナン

オラウィワタナクン, タナナン

Search repository
著者 ORAWIWATTANAKUL, Tananun

× ORAWIWATTANAKUL, Tananun

en ORAWIWATTANAKUL, Tananun

Search repository
学位授与機関
学位授与機関名 総合研究大学院大学
学位名
学位名 博士(情報学)
学位記番号
内容記述タイプ Other
内容記述 総研大甲第1289号
研究科
値 複合科学研究科
専攻
値 17 情報学専攻
学位授与年月日
学位授与年月日 2009-09-30
学位授与年度
値 2009
要旨
内容記述タイプ Other
内容記述 Optical burst switching (OBS) is a promising switching technology for<br />next-generation Internet backbone networks. The main objectives of the dissertation<br />was to provide fairness from various aspects, including rate and distance fairness, to<br />OBS networks without degrading the loss probability or throughput.<br />  This dissertation proposes a rate fairness preemption (RFP) scheme to achieve<br />max-min fair bandwidth allocation (FBA) or rate fairness in OBS networks. Core<br />switches in RFP do not need to have a function for monitoring both the arrival and<br />loss rates of flows. Methods of adaptive and fixed max-min rate allocation are<br />introduced. RFP based on fixed max-min rate allocation is the simplest way of<br />achieving max-min FBA in OBS networks because it does not require any additional<br />control message to update the arrival or fairly allocated rates as required by existing<br />FBA schemes. A discrete-time Markov chain-based model for analysis of the burst<br />loss probability for flows in RFP-based OBS networks is proposed. The performance<br />of RFP was demonstrated through both analyses and simulations.<br />  In addition, this dissertation proposes a technique of deflection routing (DR),<br />called max-min DR (MMDR), to reduce losses when max-min FBA is achieved in<br />OBS networks. The proposed DR strategy can be adapted to preemption-based and<br />rate-control-based FBA schemes. In this research, we integrated MMDR with RFP<br />and derived a new scheme called rate fairness preemption with deflection routing<br />(RFP-DR). The simulation results indicate that RFP-DR can isolate and protect<br />services as RFP does, but RFP-DR yields the lower total burst loss probability.<br />  Although FBA can be achieved in OBS networks, the actual transmission rate of<br />flows not only depends on the fairly allocated rate but also its burst loss probability<br />due to the high-loss characteristic of OBS. The burst loss probability of flows in OBS<br />networks tends to increase with larger hop counts. Therefore, rate fairness or FBA<br />should be provided with distance fairness (fairness among flows with different hop<br />counts) so that we can achieve real fairness in the sense of fair transmission rates.<br />Consequently, this dissertation introduces a rate and distance fairness preemption<br />(RDFP) scheme to achieve max-min FBA while ensuring distance fairness for traffic<br />transmitted under the max-min rate.<br />  The analytical and simulation results indicate that the proposed schemes<br />effectively solve fairness problems in OBS networks without degrading the total<br />burst loss probability. In addition, the proposed schemes are simple enough to<br />implement in practical networks because of their low computational complexity.
所蔵
値 有
戻る
0
views
See details
Views

Versions

Ver.1 2023-06-20 15:58:33.491163
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3