{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00042780","sets":["1164:3696:3772:3776"]},"path":["3776"],"owner":"1","recid":"42780","title":["プリファレンスによる経路制御のモデル"],"pubdate":{"attribute_name":"公開日","attribute_value":"1994-01-27"},"_buckets":{"deposit":"a1e609e9-cea0-4c72-86bd-fc760b56919e"},"_deposit":{"id":"42780","pid":{"type":"depid","value":"42780","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"プリファレンスによる経路制御のモデル","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"プリファレンスによる経路制御のモデル"},{"subitem_title":"Routing by preference model","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1994-01-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学"},{"subitem_text_value":"WIDEプロジェクト"},{"subitem_text_value":"東京大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Waseda University","subitem_text_language":"en"},{"subitem_text_value":"WIDE Project","subitem_text_language":"en"},{"subitem_text_value":"Tokyo 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/42780/files/IPSJ-GN93005012.pdf"},"date":[{"dateType":"Available","dateValue":"1996-01-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GN93005012.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"29"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"596dfb14-7dff-4d9c-9ade-0909bef86a99","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1994 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤原, 和典"},{"creatorName":"村山, 優子"},{"creatorName":"吉田, 茂樹"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazunori, Fujiwara","creatorNameLang":"en"},{"creatorName":"Yuko, Murayama","creatorNameLang":"en"},{"creatorName":"Shigeki, Yoshida","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA1155524X","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":"複数の網を通って通信を行なう場合、各網の異なる主張や方針を考慮に入れて経路制御を行なう必要がある。また、通信を行なうのは終点（発信元と宛先）の意思であるから、その希望にそって経路を選択したい。本稿では、インターネット（域間網）における使用制御と利用者の希望という観点から政策的経路制御について議論し、発信元や宛先の好きな経路を選択することを可能にする経路制御手法とそのモデル化について述べる。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"When communicating across plural networks, routing needs each network's varied policies and assertions. And we want to make a route with each terminal's preference (will) because each communication's core is each terminal's will. This paper describes a policy routing model for enabling the originator and the destination to choose their preferred route and paths. We explore the problem in the inter-domain environment, and come to terms that each one of the end sites of a communication flow - source and destination, has its own preference in routing. Routing by preference is achieved by minimizing costs in unfavourable domains.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"94","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告グループウェアとネットワークサービス（GN）"}],"bibliographicPageStart":"87","bibliographicIssueDates":{"bibliographicIssueDate":"1994-01-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12(1993-GN-005)","bibliographicVolumeNumber":"1994"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":42780,"updated":"2025-01-22T11:16:52.974487+00:00","links":{},"created":"2025-01-18T23:09:20.274070+00:00"}