{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00034818","sets":["1164:2836:2876:2877"]},"path":["2877"],"owner":"1","recid":"34818","title":["QoSルーティングにおけるメトリック情報の良し悪しに応じたLSAの時間間隔制限手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-11-15"},"_buckets":{"deposit":"dc7cd450-120e-4984-8dcb-5a13c7107c95"},"_deposit":{"id":"34818","pid":{"type":"depid","value":"34818","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"QoSルーティングにおけるメトリック情報の良し悪しに応じたLSAの時間間隔制限手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"QoSルーティングにおけるメトリック情報の良し悪しに応じたLSAの時間間隔制限手法"},{"subitem_title":"Time interval restriction of QoS routing LSA depending on whether metric is better or worse","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-11-15","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京都大学"},{"subitem_text_value":"Trans New Technology"},{"subitem_text_value":"京都大学"},{"subitem_text_value":"京都大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Trans New Technology","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/34818/files/IPSJ-DPS01105005.pdf"},"date":[{"dateType":"Available","dateValue":"2003-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS01105005.pdf","filesize":[{"value":"634.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"9139256d-8b36-4f8f-9d55-9fbc52ad1fb4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐々木, 基晴"},{"creatorName":"小山, 洋一"},{"creatorName":"藤川, 賢治"},{"creatorName":"岡部, 寿男"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Sasaki, Motoharu","creatorNameLang":"en"},{"creatorName":"Koyama, Youichi","creatorNameLang":"en"},{"creatorName":"Fujikawa, Kenji","creatorNameLang":"en"},{"creatorName":"Okabe, Yasuo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"QoS（Quality of Service）ルーティングは従来のルーティングと異なり、残り帯域のような資源の予約／解放によって頻繁に変動する情報を扱うことになる。また、QoSには帯域の他に遅延や優先度、課金などの種々のパラメータが考えられる。種々のQoS要求に応えるためには、ルーティング情報は単純なスカラー値ではなく、ベクトルの列で与えられることになる。ここで、ルーティングトラフィックやそれによって引き起こされるルーターのCPUコストを抑え、一方で経路制御情報の正確性を保持する仕組みが必要になる。本研究では、ルーティング情報間に良し悪しの定義を与え、それに応じてルーティング情報の送受信間隔に時間制限を設ける手法を提案し、シミュレーション実験によって評価を行なった。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"QoS-based routing is different from conventional best-effort routing in that QoS-based routing must handle the information such as bandwidth which is frequently changed by resource's reservation/release. To support different QoS requirement, metirc becomes not simple scalar value but a list of vector. Here the mechanism that suppresses routing trafic to tolerable size but holds some kind of accuracy of routing information is needed.In this work, we define ordered relation such as better or worse between each metrics, propose the technique that control interval times of Link State Advertisement according to this ordered relation, and evaluate this technique by simulation experiment.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"30","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"25","bibliographicIssueDates":{"bibliographicIssueDate":"2001-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"107(2001-DPS-105)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":34818,"updated":"2025-01-22T15:00:28.068115+00:00","links":{},"created":"2025-01-18T23:03:18.776443+00:00"}