{"created":"2023-05-15T08:20:19.281793+00:00","id":266,"links":{},"metadata":{"_buckets":{"deposit":"2b97ff91-eac2-4798-a0aa-dcdf5045964c"},"_deposit":{"created_by":3,"id":"266","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"266"},"status":"published"},"_oai":{"id":"oai:shobi-u.repo.nii.ac.jp:00000266","sets":["10:1:46"]},"author_link":["462","463","464"],"control_number":"266","item_3_biblio_info_12":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2006-11-30","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"10","bibliographicPageStart":"1","bibliographicVolumeNumber":"10","bibliographic_titles":[{"bibliographic_title":"尚美学園大学芸術情報学部紀要","bibliographic_titleLang":"ja"},{"bibliographic_title":"Bulletin of the Faculty of Informatics for Arts, Shobi University","bibliographic_titleLang":"en"}]}]},"item_3_description_11":{"attribute_name":"抄録(英)","attribute_value_mlt":[{"subitem_description":"In a telecommunication network system, a branching Poisson input finite-capacity BPP/GI/1/m queue is often appeared. We have evaluated the queue overflow rate and the waiting overtime rate of these schemes. We started with BPP/M/1/m queue with the distribution of number of children following their parents. We have also evaluated the queue overflow rate and the waiting overtime rate of priority queuing system which consists of BPP/M/1/m queue with the distribution of number of children and Poisson input queue.","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_3_description_15":{"attribute_name":"表示順","attribute_value_mlt":[{"subitem_description":"1","subitem_description_type":"Other"}]},"item_3_description_16":{"attribute_name":"アクセション番号","attribute_value_mlt":[{"subitem_description":"KJ00004920321","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"記事種別(日)","attribute_value_mlt":[{"subitem_description":"論文","subitem_description_language":"ja","subitem_description_type":"Other"}]},"item_3_description_9":{"attribute_name":"記事種別(英)","attribute_value_mlt":[{"subitem_description":"Article","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_3_publisher_22":{"attribute_name":"出版社","attribute_value_mlt":[{"subitem_publisher":"尚美学園大学芸術情報学部","subitem_publisher_language":"ja"}]},"item_3_source_id_1":{"attribute_name":"雑誌書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AA11624171","subitem_source_identifier_type":"NCID"}]},"item_3_source_id_19":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"13471023","subitem_source_identifier_type":"PISSN"}]},"item_3_text_6":{"attribute_name":"著者所属(日)","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"尚美学園大学芸術情報学部情報表現学科"},{"subitem_text_language":"ja","subitem_text_value":"早稲田大学商学学術院"},{"subitem_text_language":"ja","subitem_text_value":"尚美学園大学芸術情報学部情報表現学科"}]},"item_3_text_7":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Shobi University"},{"subitem_text_language":"en","subitem_text_value":"Waseda University"},{"subitem_text_language":"en","subitem_text_value":"Shobi University"}]},"item_3_title_3":{"attribute_name":"論文名よみ","attribute_value_mlt":[{"subitem_title":"Traffic characteristics of a branching Poisson input finite-capacity Queue","subitem_title_language":"en"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"四方, 義昭","creatorNameLang":"ja"},{"creatorName":"シカタ, ヨシアキ","creatorNameLang":"ja-Kana"},{"creatorName":"SHIKATA, Yoshiaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"高橋, 敬隆","creatorNameLang":"ja"},{"creatorName":"タカハシ, ヨシタカ","creatorNameLang":"ja-Kana"},{"creatorName":"TAKAHASHI, Yoshitaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"華山, 宣胤","creatorNameLang":"ja"},{"creatorName":"ハナヤマ, ノブタネ","creatorNameLang":"ja-Kana"},{"creatorName":"HANAYAMA, Nobutane","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-04-21"}],"displaytype":"detail","filename":"KJ00004920321.pdf","filesize":[{"value":"80.0 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"KJ00004920321.pdf","url":"https://shobi-u.repo.nii.ac.jp/record/266/files/KJ00004920321.pdf"},"version_id":"ac2365e9-6576-44f0-a1cd-79590556cee1"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"communication network","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"queue overflow rate","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"waiting overtime rate","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"BPP/M/1/m model","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"distribution of number of children","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"priority queuing system","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Traffic characteristics of a branching Poisson input finite-capacity Queue","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Traffic characteristics of a branching Poisson input finite-capacity Queue","subitem_title_language":"en"}]},"item_type_id":"3","owner":"3","path":["46"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2017-04-21"},"publish_date":"2017-04-21","publish_status":"0","recid":"266","relation_version_is_last":true,"title":["Traffic characteristics of a branching Poisson input finite-capacity Queue"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-09-21T02:42:55.620776+00:00"}