ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "91b87972-1adb-428a-8ab7-f6267500a915"}, "_deposit": {"created_by": 21, "id": "1504", "owners": [21], "pid": {"revision_id": 0, "type": "depid", "value": "1504"}, "status": "published"}, "_oai": {"id": "oai:ir.soken.ac.jp:00001504", "sets": ["19"]}, "author_link": ["0", "0", "0"], "item_1_biblio_info_21": {"attribute_name": "書誌情報(ソート用)", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2009-09-30", "bibliographicIssueDateType": "Issued"}, "bibliographic_titles": [{}]}]}, "item_1_creator_2": {"attribute_name": "著者名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "ORAWIWATTANAKUL, Tananun"}], "nameIdentifiers": [{"nameIdentifier": "0", "nameIdentifierScheme": "WEKO"}]}]}, "item_1_creator_3": {"attribute_name": "フリガナ", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "オラウィワタナクン, タナナン"}], "nameIdentifiers": [{"nameIdentifier": "0", "nameIdentifierScheme": "WEKO"}]}]}, "item_1_date_granted_11": {"attribute_name": "学位授与年月日", "attribute_value_mlt": [{"subitem_dategranted": "2009-09-30"}]}, "item_1_degree_grantor_5": {"attribute_name": "学位授与機関", "attribute_value_mlt": [{"subitem_degreegrantor": [{"subitem_degreegrantor_name": "総合研究大学院大学"}]}]}, "item_1_degree_name_6": {"attribute_name": "学位名", "attribute_value_mlt": [{"subitem_degreename": "博士(情報学)"}]}, "item_1_description_1": {"attribute_name": "ID", "attribute_value_mlt": [{"subitem_description": "2009524", "subitem_description_type": "Other"}]}, "item_1_description_12": {"attribute_name": "要旨", "attribute_value_mlt": [{"subitem_description": "  Optical burst switching (OBS) is a promising switching technology for\u003cbr /\u003enext-generation Internet backbone networks. The main objectives of the dissertation\u003cbr /\u003ewas to provide fairness from various aspects, including rate and distance fairness, to\u003cbr /\u003eOBS networks without degrading the loss probability or throughput.\u003cbr /\u003e  This dissertation proposes a rate fairness preemption (RFP) scheme to achieve\u003cbr /\u003emax-min fair bandwidth allocation (FBA) or rate fairness in OBS networks. Core\u003cbr /\u003eswitches in RFP do not need to have a function for monitoring both the arrival and\u003cbr /\u003eloss rates of flows. Methods of adaptive and fixed max-min rate allocation are\u003cbr /\u003eintroduced. RFP based on fixed max-min rate allocation is the simplest way of\u003cbr /\u003eachieving max-min FBA in OBS networks because it does not require any additional\u003cbr /\u003econtrol message to update the arrival or fairly allocated rates as required by existing\u003cbr /\u003eFBA schemes. A discrete-time Markov chain-based model for analysis of the burst\u003cbr /\u003eloss probability for flows in RFP-based OBS networks is proposed. The performance\u003cbr /\u003eof RFP was demonstrated through both analyses and simulations.\u003cbr /\u003e  In addition, this dissertation proposes a technique of deflection routing (DR),\u003cbr /\u003ecalled max-min DR (MMDR), to reduce losses when max-min FBA is achieved in\u003cbr /\u003eOBS networks. The proposed DR strategy can be adapted to preemption-based and\u003cbr /\u003erate-control-based FBA schemes. In this research, we integrated MMDR with RFP\u003cbr /\u003eand derived a new scheme called rate fairness preemption with deflection routing\u003cbr /\u003e(RFP-DR). The simulation results indicate that RFP-DR can isolate and protect\u003cbr /\u003eservices as RFP does, but RFP-DR yields the lower total burst loss probability.\u003cbr /\u003e  Although FBA can be achieved in OBS networks, the actual transmission rate of\u003cbr /\u003eflows not only depends on the fairly allocated rate but also its burst loss probability\u003cbr /\u003edue to the high-loss characteristic of OBS. The burst loss probability of flows in OBS\u003cbr /\u003enetworks tends to increase with larger hop counts. Therefore, rate fairness or FBA\u003cbr /\u003eshould be provided with distance fairness (fairness among flows with different hop\u003cbr /\u003ecounts) so that we can achieve real fairness in the sense of fair transmission rates.\u003cbr /\u003eConsequently, this dissertation introduces a rate and distance fairness preemption\u003cbr /\u003e(RDFP) scheme to achieve max-min FBA while ensuring distance fairness for traffic\u003cbr /\u003etransmitted under the max-min rate.\u003cbr /\u003e  The analytical and simulation results indicate that the proposed schemes\u003cbr /\u003eeffectively solve fairness problems in OBS networks without degrading the total\u003cbr /\u003eburst loss probability. In addition, the proposed schemes are simple enough to\u003cbr /\u003eimplement in practical networks because of their low computational complexity.", "subitem_description_type": "Other"}]}, "item_1_description_7": {"attribute_name": "学位記番号", "attribute_value_mlt": [{"subitem_description": "総研大甲第1289号", "subitem_description_type": "Other"}]}, "item_1_select_14": {"attribute_name": "所蔵", "attribute_value_mlt": [{"subitem_select_item": "有"}]}, "item_1_select_16": {"attribute_name": "複写", "attribute_value_mlt": [{"subitem_select_item": "印刷物から複写可"}]}, "item_1_select_17": {"attribute_name": "公開状況", "attribute_value_mlt": [{"subitem_select_item": "要旨のみ公開"}]}, "item_1_select_8": {"attribute_name": "研究科", "attribute_value_mlt": [{"subitem_select_item": "複合科学研究科"}]}, "item_1_select_9": {"attribute_name": "専攻", "attribute_value_mlt": [{"subitem_select_item": "17 情報学専攻"}]}, "item_1_text_10": {"attribute_name": "学位授与年度", "attribute_value_mlt": [{"subitem_text_value": "2009"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "ORAWIWATTANAKUL, Tananun", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "0", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-02-17"}], "displaytype": "simple", "download_preview_message": "", "file_order": 0, "filename": "甲1289_要旨.pdf", "filesize": [{"value": "244.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_11", "mimetype": "application/pdf", "size": 244400.0, "url": {"label": "要旨・審査要旨", "url": "https://ir.soken.ac.jp/record/1504/files/甲1289_要旨.pdf"}, "version_id": "32ff31e4-04fc-4505-9af5-5dc2d7f29de0"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "thesis", "resourceuri": "http://purl.org/coar/resource_type/c_46ec"}]}, "item_title": "Fairness Provisioning in Optical Burst Switching Networks", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Fairness Provisioning in Optical Burst Switching Networks"}, {"subitem_title": "Fairness Provisioning in Optical Burst Switching Networks", "subitem_title_language": "en"}]}, "item_type_id": "1", "owner": "21", "path": ["19"], "permalink_uri": "https://ir.soken.ac.jp/records/1504", "pubdate": {"attribute_name": "公開日", "attribute_value": "2010-06-09"}, "publish_date": "2010-06-09", "publish_status": "0", "recid": "1504", "relation": {}, "relation_version_is_last": true, "title": ["Fairness Provisioning in Optical Burst Switching Networks"], "weko_shared_id": -1}
  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
タイトル
言語 en
タイトル Fairness Provisioning in Optical Burst Switching Networks
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_46ec
資源タイプ thesis
著者名 ORAWIWATTANAKUL, Tananun

× ORAWIWATTANAKUL, Tananun

WEKO 0

ORAWIWATTANAKUL, Tananun

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

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

WEKO 0

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

Search repository
著者 ORAWIWATTANAKUL, Tananun

× ORAWIWATTANAKUL, Tananun

WEKO 0

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
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3