{"created":"2025-01-18T23:01:11.236906+00:00","updated":"2025-01-22T16:23:02.862681+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031986","sets":["1164:2592:2633:2637"]},"path":["2637"],"owner":"1","recid":"31986","title":["平坦なグラフに対するコンパクトルーティング"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-05-23"},"_buckets":{"deposit":"0430715c-e1a4-4cd7-99ed-b8f49c0ff3d4"},"_deposit":{"id":"31986","pid":{"type":"depid","value":"31986","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":"Compact Routing for Average - Case Networks","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2002-05-23","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京都大学情報学研究科"},{"subitem_text_value":"京都大学情報学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, 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/31986/files/IPSJ-AL02084009.pdf"},"date":[{"dateType":"Available","dateValue":"2004-05-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL02084009.pdf","filesize":[{"value":"551.0 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a49afa06-67f7-4306-b0b5-878574496c57","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"沖田, 正樹"},{"creatorName":"岩間, 一雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masaki, Okita","creatorNameLang":"en"},{"creatorName":"Kazuo, Iwama","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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":"近年，現実的なネットワークモデルを用いて伸張係数３で各頂点のルーティングテーブルサイズをO(n^2/3 log^4/3 n)に抑えるコンパクトルーティングアルゴリズムが提案されている[2]．この伸張係数３は一般的な下限[3]と一致し，同じモデルを用いて伸張係数３未満に制限するとテーブルサイズの上下限が(1 - o(1)) n log nまで増加してしまう具合の悪いネットワークが存在する[4]．それに対して，本稿では平均的なグラフが持つ望ましい条件として平坦性という概念を導入し，グラフが(α  s  γ  δ)-疑似平坦である時，伸張係数s (s < 3)でテーブルサイズO((n^1-αlog n + γ n^α) log n)のコンパクトルーティングアルゴリズムを示す．特にγ を定数に定めることができるとき，テーブルサイズはO(√log n)まで削減することができる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In [2], Cowen presented a universal compact routing algorithm with a stretch factor of three and a table-size of O(n^2/3 log^4/3 n), based on a simple and practical model. This stretch factor of three matches a general lower bound given in [3] and also matches a much tighter lower bound if we restrict the model [4].  This paper improves these worst-case bounds by using average-vase models. The notion of it flatness is introduced for average-case netowrks. If a given network is (α, s, γ, δ)-almost-flat, then our new algorithm achieves a stretch factor of s and a table-size of O(( n^1 - α log n + γ n^α) log n).","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"66","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"59","bibliographicIssueDates":{"bibliographicIssueDate":"2002-05-23","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"42(2002-AL-084)","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":31986,"links":{}}