{"_buckets": {"deposit": "430a6b5c-1256-4a23-9272-6f145c5cd211"}, "_deposit": {"created_by": 3, "id": "168", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "168"}, "status": "published"}, "_oai": {"id": "oai:pu-toyama.repo.nii.ac.jp:00000168", "sets": []}, "author_link": ["305", "303", "304", "306"], "item_2_biblio_info_12": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2002-03-29", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "53", "bibliographicPageStart": "47", "bibliographicVolumeNumber": "12", "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機を例に挙げると, 以前はATM機毎に個別に客の行列が出来る, 単一処理装置+単一待ち行列を構成単位とするシステムが複数並列するものであったが, 複数処理装置+単一待ち行列というフォーク型のシステムに変化してきたことは, 誰しも思い当たることであろう。様々な待ち行列システムの中で最も一般的なGI/G/1待ち行列モデルは, 利用者のシステム到着間隔が独立でかつ同一の一般分布に従う到着過程, 処理時間分布が一般分布, 単一処理装置という構成単位を持っている。この中でも, 利用者の到着過程がポアソン分布に従うM/G/1待ち行列モデルについては, 任意時刻における系内利用者数の母関数を解析することで, 細かい部分まで既に解明されている。しかし, 本来待ち行列システムを解析する大きな目的となっている, 待ち時間分布を求めるには, 母関数による解法は間接的であり, その理解が難しいものとなっている。そこで, 本稿では, 系内に存在する残余仕事量に着目しLevel Crossing法を導入することで, より直感的にGI/G/1待ち行列モデルにおける待ち時間分布を求め, この手法の有効性を論議する。", "subitem_description_type": "Other"}]}, "item_2_description_11": {"attribute_name": "抄録(英)", "attribute_value_mlt": [{"subitem_description": "In everyday life, a situation is frequently happened that some users commonly share some limited resources and wait while the resources are busy; e.g. automated teller machines in a bank. As one of these queueing systems, a GI/G/1 queueing model (denoted by Kendall\u0027s notation; GI specifies the arrival process is a renewal arrival process, G specifies the service time distribution is general distribution, and 1 denotes a single server) is a basic queueing system, and has a fundamental and an important role in evaluation of quality of service (QoS) of queuing systems. To analyze the M/G/1 (a special case of the GI/G/1 queueing model), the method of the imbedded Markov chain is commonly used for finding the distribution of the number of users (or clients, customers, messages, e.t.c.) in the system, though an obtained generating function of the distribution of the number of users is expressed in mathematical form and is not easily understandable. In this paper, taking the Level Crossing method, we have obtained the probability density function of waiting time in the GI/G/1 queueing model more intuitively than using the generating function of the distribution of the number of users, and discuss this method\u0027s 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": "KJ00000190563", "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 Electronics and Informatics, Faculty of Engineering"}, {"subitem_text_language": "en", "subitem_text_value": "Department of Electronics and Informatics, Faculty of Engineering"}]}, "item_2_title_3": {"attribute_name": "論文名よみ", "attribute_value_mlt": [{"subitem_title": "〓"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "小林, 香"}, {"creatorName": "コバヤシ, カオリ", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "303", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "片山, 勁"}, {"creatorName": "カタヤマ, ツヨシ", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "304", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KOBAYASHI, Kaori", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "305", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KATAYAMA, Tsuyoshi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "306", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-02-24"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "KJ00000190563.pdf", "filesize": [{"value": "353.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 353500.0, "url": {"label": "KJ00000190563.pdf", "url": "https://pu-toyama.repo.nii.ac.jp/record/168/files/KJ00000190563.pdf"}, "version_id": "4ee00762-a292-4475-947a-2e00bba36a0e"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Level-Crossing法", "subitem_subject_scheme": "Other"}, {"subitem_subject": "GI/G/1待ち行列モデル", "subitem_subject_scheme": "Other"}, {"subitem_subject": "残余仕事量", "subitem_subject_scheme": "Other"}, {"subitem_subject": "待ち時間分布", "subitem_subject_scheme": "Other"}, {"subitem_subject": "the level-crossing method", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "GI/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"}]}, "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": "Level Crossing 法による GI/G/1 待ち行列モデルの解析", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Level Crossing 法による GI/G/1 待ち行列モデルの解析"}, {"subitem_title": "An Analysis of GI/G/1 Queueing Model by the Level Crossing Method", "subitem_title_language": "en"}]}, "item_type_id": "2", "owner": "3", "path": ["51"], "permalink_uri": "https://pu-toyama.repo.nii.ac.jp/records/168", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-02-24"}, "publish_date": "2017-02-24", "publish_status": "0", "recid": "168", "relation": {}, "relation_version_is_last": true, "title": ["Level Crossing 法による GI/G/1 待ち行列モデルの解析"], "weko_shared_id": -1}