{"created":"2025-01-18T22:51:32.550684+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018945","sets":["1164:1165:1174:1175"]},"path":["1175"],"owner":"1","recid":"18945","title":["選択型コンテンツの放送型配信における遷移確率を考慮したスケジューリング手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-07-14"},"_buckets":{"deposit":"cfd2f946-041b-4b36-ab33-d2b11006c7db"},"_deposit":{"id":"18945","pid":{"type":"depid","value":"18945","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":"A Scheduling Method on Selective Contents Broadcasting Considering Transition Probability","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2006-07-14","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京都大学学術情報メディアセンター"},{"subitem_text_value":"京都大学大学院情報学研究科"},{"subitem_text_value":"京都大学学術情報メディアセンター"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Academic Center for Computing and Media Studies, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Academic Center of Computing and Media Studies, 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/18945/files/IPSJ-DBS06140092.pdf"},"date":[{"dateType":"Available","dateValue":"2008-07-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS06140092.pdf","filesize":[{"value":"467.3 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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3ae85f03-2cf9-447a-9e34-af02213634bd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 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":"Tomoki, Yoshihisa","creatorNameLang":"en"},{"creatorName":"Yusuke, Gotoh","creatorNameLang":"en"},{"creatorName":"Masanori, Kanazawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","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":"近年のデジタル放送の普及にともない，ユーザがコンテンツを選択して視聴する選択型コンテンツに対する注目が高まっている．例えば，2 択クイズ番組で，ユーザが回答を選択し，その回答に対する映像を視聴するといった選択型コンテンツが考えられる．サーバは，ユーザの嗜好に応じた番組を提供できるが，クライアントは，選択したコンテンツが再生されるまで待つ必要がある．これまでの手法では，各コンテンツの再生終了と同時に受信完了できるようにスケジューリングして放送することで待ち時間を短縮しているが，各コンテンツの遷移確率を考慮することで，効率的に待ち時間を短縮できる．そこで本稿では，選択型コンテンツの放送配信において，遷移確率を考慮したうえで待ち時間を短縮する手法を提案する．提案手法では，コンテンツの再生レートと等しい帯域幅の放送チャネルを多く確保し，遷移確率の高い順にスケジューリングして待ち時間を短縮する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watch their selected contents, have attracted attention. For example, in a quiz program, a user selects his answer and watch the video content for the answer. Although the server can deliver programs according to users' preference, clients have to wait until their selected contents are played. Conventional methods reduce the waiting time by producing an effective broadcast schedule. However, by considering transition probability of selective contents, the waiting time can be reduced further. In this paper, we propose a scheduling method on selective contents broadcasting considering transition probability. Our proposed method reduces the waiting time by allocating broadcast channels that have same bandwidth as the contents consumption rate and scheduling contents according totransition probability.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"482","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"475","bibliographicIssueDates":{"bibliographicIssueDate":"2006-07-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"78(2006-DBS-140)","bibliographicVolumeNumber":"2006"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":18945,"updated":"2025-01-22T22:30:46.879014+00:00","links":{}}