{"created":"2023-06-19T10:30:28.851445+00:00","id":10917,"links":{},"metadata":{"_buckets":{"deposit":"1c1dd845-96ba-444b-af63-ef5c4a1692f7"},"_deposit":{"created_by":18,"id":"10917","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"10917"},"status":"published"},"_oai":{"id":"oai:muroran-it.repo.nii.ac.jp:00010917","sets":["41:227"]},"author_link":["59383"],"item_81_date_granted_17":{"attribute_name":"学位授与年月日","attribute_value_mlt":[{"subitem_dategranted":"2022-03-23"}]},"item_81_degree_grantor_10":{"attribute_name":"学位授与機関","attribute_value_mlt":[{"subitem_degreegrantor":[{"subitem_degreegrantor_language":"ja","subitem_degreegrantor_name":"室蘭工業大学"},{"subitem_degreegrantor_language":"en","subitem_degreegrantor_name":"Muroran Institute of Technology"}],"subitem_degreegrantor_identifier":[{"subitem_degreegrantor_identifier_name":"10103","subitem_degreegrantor_identifier_scheme":"kakenhi"}]}]},"item_81_degree_name_11":{"attribute_name":"学位名","attribute_value_mlt":[{"subitem_degreename":"博士（工学）","subitem_degreename_language":"ja"}]},"item_81_description_25":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_81_description_7":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"ネットワーク機能の仮想化（ＮＦＶ）ということは、次代のために、仮想化されたネットワーク機能（ＶＮＦ）サービスを提供する新興の方案である。しかし、顧客に異なる資源を配布する効率的な方法を見つけることは難しい。本文の前半は、両面から資源の配分の問題を検討している。まず、DARAという新しいダブルオークションアプローチを開発し、サービス機能チェーン（ＳＦＣ）ルーティングとNFV価格調整の両方に使用され、すべての参加者の利益を最大化することができる。我々の知る限りでは、これはこの分野で初めて採用された策略である。この提案の目的は，NFVブローカー、顧客およびサービスプロバイダという三種類の参加者の利益を最大化することである。次に，ワラシアンオークショングラフィックモデルの樹の多数のノードを提案し，社会的な利益を最大化することができる。仮想化されたサービスをNFV市場で樹評価と定義することは初めてである。そのほか，この手法の正当性を保証するため、アルゴリズムの証明を提出する。すべての理論を考慮して，提案した方法に対して総合のシミュレーションを行った。論文の二番目部分では、深い学習、すなわちサービスとデータ中心の同流スケジュールを含む他のリソースをスケジュールする。第一に、クラウドコンピューティングと深い学習の結合は、最近DLASと呼ばれる新しい技術である。クラウドコンピューティングにおけるプロバイダとユーザの競合市場を設けて，それぞれに二つの効率的な決定と価格戦略を提案する。次に，並列フローの集合であるコーフローをスケジュールする。一つの仕事は一つのコーフローが構成された。共流の依存性を考慮に入れた。完了した性能を保証するために，最後期限とネットワーク容量の制約に基づく「ＭＴＦ」と呼ばれるスケジューラモデルを打ち立ていた。依存コーフローを全体として考慮し，価値的なコーフロースケジューリングの最初のＭＴＦアルゴリズムを提案した。最後に，データセンターにおけるサービスとコーフロースケジューリングとしての深い学習の方法を評価するための広いシミュレーションを行う。","subitem_description_language":"ja","subitem_description_type":"Abstract"},{"subitem_description":" Network function virtualization (NFV) is an emerging scheme to provide virtualized network function (VNF) services for next-generation networks. However, finding an efficient way to distribute different resources to customers is difficult. In the first half of this thesis, we deal with the resource allocation from two aspects. First, we develop a new double-auction approach named DARA that is used for both service function chain (SFC) routing and NFV price adjustment to maximize the profits of all participants. To the best of our knowledge, this is the first work to adopt a double-auction strategy in this area. The objective of the proposed approach is to maximize the profits of three types of participants: NFV broker, customers, and service providers. Second, multiple Walrasian Auction Graphic Model of different bundled tree nodes is proposed to maximize the social effectiveness. It is the first work to define the virtualized service as a tree valuation in NFV market. Moreover, we propose the relevant proof of the algorithms to ensure the correctness of the method. With all theory considered, we conducted a comprehensive simulation to evaluate the proposed method. In the second the thesis, we schedule other resources including deep learning as a service and coflow scheduling for datacenter. Firstly, deep learning combining with cloud computing is a surging technology recently which is a new paradigm called DLAS (deep learning as a service). We formulate a competitive market between a provider and users in cloud computing and propose two efficient decision and pricing strategies called Dealer strategies for users and the provider, respectively. Secondly, we schedule coflow which is a collection of parallel flows, while a job consists of a set of coflows. We take the dependency of coflows into consideration. To guarantee job completion for performance, we formulate a deadline and dependency-based model called MTF scheduler model with the constraints of deadline and network capacity. We consider the dependent coflows as an entirety and propose a valuable coflow scheduling first MTF algorithm. Finally, we conduct extensive simulations to evaluate our methods for deep learning as a service and coflow scheduling in datacenter.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_81_dissertation_number_13":{"attribute_name":"学位授与番号","attribute_value_mlt":[{"subitem_dissertationnumber":"甲第485号"}]},"item_81_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.15118/00010854","subitem_identifier_reg_type":"JaLC"}]},"item_81_subject_9":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"007","subitem_subject_scheme":"NDC"}]},"item_81_text_12":{"attribute_name":"学位の種別","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"課程博士"}]},"item_81_text_14":{"attribute_name":"報告番号","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"甲第485号"}]},"item_81_text_15":{"attribute_name":"学位記番号","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"博甲第485号"}]},"item_81_text_16":{"attribute_name":"研究科・専攻","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"工学専攻"}]},"item_81_version_type_24":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorAffiliations":[{"affiliationNameIdentifiers":[],"affiliationNames":[{"affiliationName":""}]}],"creatorNames":[{"creatorName":"鳥雲, 昭拉","creatorNameLang":"ja"},{"creatorName":"ウユン, チャオラ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{}],"givenNames":[{},{}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2022-06-30"}],"displaytype":"detail","filename":"A485.pdf","filesize":[{"value":"1.6 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"A485","objectType":"fulltext","url":"https://muroran-it.repo.nii.ac.jp/record/10917/files/A485.pdf"},"version_id":"3be1f28b-17ca-4f5f-a362-1f20fea6a198"},{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2022-06-30"}],"displaytype":"detail","filename":"A485_summary.pdf","filesize":[{"value":"769.3 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"A485_summary","objectType":"abstract","url":"https://muroran-it.repo.nii.ac.jp/record/10917/files/A485_summary.pdf"},"version_id":"f46ca54b-b92a-4c32-a4ef-c6ed7e8a1c27"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"doctoral thesis","resourceuri":"http://purl.org/coar/resource_type/c_db06"}]},"item_title":"Efficient multi-resource allocation strategies for emerging virtualized networks","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Efficient multi-resource allocation strategies for emerging virtualized networks","subitem_title_language":"en"},{"subitem_title":"先進的仮想化ネットワークのための効率的なマルチリソース割当戦略","subitem_title_language":"ja"}]},"item_type_id":"81","owner":"18","path":["227"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2022-06-30"},"publish_date":"2022-06-30","publish_status":"0","recid":"10917","relation_version_is_last":true,"title":["Efficient multi-resource allocation strategies for emerging virtualized networks"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2024-01-22T02:08:54.610132+00:00"}