{"created":"2023-05-15T09:24:07.086444+00:00","id":272,"links":{},"metadata":{"_buckets":{"deposit":"ec4e9420-fc24-4087-8b77-63235439e65a"},"_deposit":{"created_by":3,"id":"272","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"272"},"status":"published"},"_oai":{"id":"oai:pu-toyama.repo.nii.ac.jp:00000272","sets":["12:57"]},"author_link":["579","576","577","578"],"item_2_biblio_info_12":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-03-01","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"49","bibliographicPageStart":"42","bibliographicVolumeNumber":"18","bibliographic_titles":[{"bibliographic_title":"富山県立大学紀要"},{"bibliographic_title":"Bulletin of Toyama Prefectural University","bibliographic_titleLang":"en"}]}]},"item_2_description_10":{"attribute_name":"抄録(日)","attribute_value_mlt":[{"subitem_description":"限られた資源を,任意のタイミングでやってくる複数の利用者が利用するシステム-銀行のATMやスーパーマーケットのレジなどが誰にでも分かりやすい例である-を考える.利用者がやってきたときに直ちに利用できる(空いている)資源の数がゼロであれば,当然のことであるが利用できない利用者が出てくる.待ち行列(バッファ)があり,資源に空きが出るまで利用者が待つことが可能であれば,このシステム全体を,資源が利用できるまでの平均待ち時間で定量的に評価することができる.バッファが空になると,休暇(バケーション)で総称される副次的作業に資源を使う場合,利用者の平均到着間隔が資源1つの平均利用時間に近づくに従って,システム内に滞留する利用者数が増え,副次的作業が後回しにされる.必要なタイミングで副次作業を行うことができるように,今回は,本来の待ち行列の前にもう一つ待ち行列を準備し,2つの待ち行列の間にゲートを設ける.このようなゲートを導入したM/G/1+vacationシステムについての諸量を,Level-Crossing法を用いて解析をする.","subitem_description_type":"Other"}]},"item_2_description_11":{"attribute_name":"抄録(英)","attribute_value_mlt":[{"subitem_description":"A situation is frequently happened in our daily life that a user commonly shares some limited resources with other users or waits until he can use these resources; e.g. at an automated teller machine (ATM) in a bank. As one of these queueing systems, a M/G/1 queueing model (denoted by Kendall's notation; \"M\" specifies the arraival process is a renewal arrival process, \"G\" specifies the service time distribution is a general distribution, and \"1\" denotes a single server) is a basic queueing system with non-exhaustive service, and has a fundamental and an important role in evaluation of quality if service (QoS) of queueing systems. To analyze a queueing system, the method of the imbedded Markov chain is commonly used for finding a distribution function of the number of users in the system, though an obtained generating function of the number of users is expressed in mathmatical form and is not easily understandable. In this paper, a M/G/1 queueing system with gated vacations is considered. In this queueing system, as soon as all of the users within the gate have been served, the server goes on a vacation, and users outside of the gate have to wait for the next server's service. Taking the level-crossing method, we have obtained the probability density function of waiting time in the M/G/1 queueing model with vacations and gated service disipline, more intuitively than using the generating function of the distribution of th users, and discuss this method's validity.","subitem_description_type":"Other"}]},"item_2_description_15":{"attribute_name":"表示順","attribute_value_mlt":[{"subitem_description":"7","subitem_description_type":"Other"}]},"item_2_description_16":{"attribute_name":"アクセション番号","attribute_value_mlt":[{"subitem_description":"KJ00005113476","subitem_description_type":"Other"}]},"item_2_source_id_1":{"attribute_name":"雑誌書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AN10358595","subitem_source_identifier_type":"NCID"}]},"item_2_source_id_19":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"09167633","subitem_source_identifier_type":"ISSN"}]},"item_2_text_6":{"attribute_name":"著者所属(日)","attribute_value_mlt":[{"subitem_text_value":"富山県立大学工学部情報システム工学科"},{"subitem_text_value":"富山県立大学工学部情報システム工学科"}]},"item_2_text_7":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Department of Information Systems Engineering, Faculty of Engineering, Toyama Prefectural University"},{"subitem_text_language":"en","subitem_text_value":"Department of Information Systems Engineering, Faculty of Engineering, Toyama Prefectural University"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小林, 香"},{"creatorName":"コバヤシ, カオリ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"576","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"片山, 勁"},{"creatorName":"カタヤマ, ツヨシ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"577","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"KOBAYASHI, Kaori","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"578","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"KATAYAMA, Tsuyoshi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"579","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-02-24"}],"displaytype":"detail","filename":"KJ00005113476.pdf","filesize":[{"value":"755.0 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KJ00005113476.pdf","url":"https://pu-toyama.repo.nii.ac.jp/record/272/files/KJ00005113476.pdf"},"version_id":"efe5a093-42dd-42c1-ae4c-cbc10a129332"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Level-Crossing法","subitem_subject_scheme":"Other"},{"subitem_subject":"M/G/1vacationモデル","subitem_subject_scheme":"Other"},{"subitem_subject":"ゲート","subitem_subject_scheme":"Other"},{"subitem_subject":"残余仕事量","subitem_subject_scheme":"Other"},{"subitem_subject":"待ち時間分布","subitem_subject_scheme":"Other"},{"subitem_subject":"level-crossing method","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"M/G/1 queueing model","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"virtual waiting time","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"distribution function of the waiting time","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"gated vacations","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"ゲートを導入したM/G/1+vacationモデルの解析 : Level-Crossing法による解析","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ゲートを導入したM/G/1+vacationモデルの解析 : Level-Crossing法による解析"},{"subitem_title":"An Analysis of M/G/1 Queueing Model with Gated Vacations by the Level-Crossing Method","subitem_title_language":"en"}]},"item_type_id":"2","owner":"3","path":["57"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-02-24"},"publish_date":"2017-02-24","publish_status":"0","recid":"272","relation_version_is_last":true,"title":["ゲートを導入したM/G/1+vacationモデルの解析 : Level-Crossing法による解析"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-15T09:40:19.094844+00:00"}