{"created":"2023-07-25T10:25:35.230362+00:00","id":3981,"links":{},"metadata":{"_buckets":{"deposit":"e3c64a58-ac08-452c-b8ac-84c059ba68ee"},"_deposit":{"created_by":4,"id":"3981","owners":[4],"pid":{"revision_id":0,"type":"depid","value":"3981"},"status":"published"},"_oai":{"id":"oai:naist.repo.nii.ac.jp:00003981","sets":["34:35"]},"author_link":["7471","7472","215","7473","7474"],"item_7_alternative_title_1":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Reducing the Size of Routing Tables for Large-scale Network Simulation","subitem_alternative_title_language":"en"}]},"item_7_biblio_info_9":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2004-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicPageEnd":"1143","bibliographicPageStart":"1134","bibliographicVolumeNumber":"45","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌","bibliographic_titleLang":"ja"}]}]},"item_7_description_19":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_7_description_7":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"ネットワーク規模の増大やネットワーク構造の複雑化にともない，大規模ネットワークにおけるシミュレーションが必要とされている．しかし，計算機で使用できる資源は限られているため，シミュレータに適用可能なネットワークの大きさ，シミュレーションシナリオの規模は制限される．シミュレーションにおいて，計算機資源（特にメモリ容量）を消費する要因の1 つは，各ノードにおいて，到着したパケットを宛先ノードごとにどの隣接ノードに転送すべきかを示す，ルーティングテーブルであることが知られている．N をネットワークに含まれるノードの数とすると，表形式のルーティングテーブルでは，その容量は全体としてO(N 2 )となる．一方，任意の2 ノード間の経路がすべて，全ノードを含むある1 つの木（被覆木）に含まれる特殊な場合にのみ，ルーティングテーブルのデータ構造を被覆木そのものとすることで，ルーティングテーブルの容量をO(N)とする被覆木ルーティング法も提案されているが，任意のルーティングを表現できない制約がある．本論文では，被覆木ルーティング法をもとに，なるべく多くの経路を含む被覆木によるルーティングテーブルと，表形式のルーティングテーブルを組み合わせたルーティングテーブルを構築し，任意のルーティングを表現でき，かつそのルーティングテーブルの容量を削減する方法を提案する．提案手法の評価を行った結果，階層化トポロジにおいて，単純なルーティングテーブルと比較し，容量を90%削減できた．","subitem_description_language":"ja","subitem_description_type":"Abstract"},{"subitem_description":"In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted. Especially, routing tables, which indicate the directions to forward packets, are considered to consume memory space. A general routing table requires O(N 2 ) space where N is the number of nodes. An algorithmic routing recently proposed by Heung et al. only requires O(N) space for rep-resenting routing tables, however this can be applied in the case that all the routes between two nodes are contained in a fixed spanning tree (i.e. very limited routing is allowed). In this paper, we propose a new method to reduce a capacity of routing tables which is applicable to any routing table. In our method, a (near-optimal) algorithmic routing based table is used to represent a part of the given routing table. Our experimental results have shown that our method could reduce about 90% of the routing table size compared with a general routing table in hierarchical networks.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_7_publisher_10":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"一般社団法人情報処理学会","subitem_publisher_language":"ja"}]},"item_7_rights_11":{"attribute_name":"出版者URL","attribute_value_mlt":[{"subitem_rights":"http://id.nii.ac.jp/1001/00010921/ "}]},"item_7_rights_18":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof.","subitem_rights_language":"ja"},{"subitem_rights":"Copyright c 2004 by the Information Processing Society of Japan","subitem_rights_language":"en"}]},"item_7_source_id_12":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_7_source_id_14":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA1150978X","subitem_source_identifier_type":"NCID"}]},"item_7_version_type_20":{"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":[{"creatorNames":[{"creatorName":"廣森, 聡仁","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7471","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"山口, 弘純","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7472","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"安本, 慶一","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"215","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"40273396","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=40273396"}]},{"creatorNames":[{"creatorName":"東野, 輝夫","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7473","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"谷口, 健一","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7474","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-03-02"}],"displaytype":"detail","filename":"IPSJ-JNL4504007.pdf","filesize":[{"value":"447.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"fulltext","objectType":"fulltext","url":"https://naist.repo.nii.ac.jp/record/3981/files/IPSJ-JNL4504007.pdf"},"version_id":"0f469f28-f6b1-43fa-8144-83aa43f5da8b"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"大規模ネットワークシミュレーション向けのルーティングテーブルの容量削減","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"大規模ネットワークシミュレーション向けのルーティングテーブルの容量削減","subitem_title_language":"ja"}]},"item_type_id":"7","owner":"4","path":["35"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2016-11-24"},"publish_date":"2016-11-24","publish_status":"0","recid":"3981","relation_version_is_last":true,"title":["大規模ネットワークシミュレーション向けのルーティングテーブルの容量削減"],"weko_creator_id":"4","weko_shared_id":-1},"updated":"2023-11-17T06:22:34.152830+00:00"}