WEKO3
アイテム
{"_buckets": {"deposit": "d9523905-e11c-4ed8-83df-86c4ec2a641f"}, "_deposit": {"created_by": 3, "id": "197", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "197"}, "status": "published"}, "_oai": {"id": "oai:pu-toyama.repo.nii.ac.jp:00000197", "sets": []}, "author_link": ["356", "355", "357", "354"], "item_2_biblio_info_12": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2004-03-31", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "86", "bibliographicPageStart": "77", "bibliographicVolumeNumber": "14", "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": "日常生活で頻繁に発生する,有限個の資源を複数の利用者で使用するという状況では,利用者は誰しも自分が資源を利用できるまでの待ち時間を出来るだけ短くしたいという要求がある.このような状況を定量的に解析するのに,有効な手段として待ち行列理論が挙げられる.以前に解析したもっとも基本的なGI/G/1待ち行列システムでは,システム内利用者数がゼロで待機状態にある処理装置は,新たな利用者が到着した時点でサービスを開始し,利用者を待たせることはない.しかし,処理装置が利用者へのサービスの他にも作業を持つ待ち行列システムでは,到着した利用者に「待ち」が発生する.本稿では,直感的に理解可能なLevel-Crossing法を用いて,「バケーション」と総称される副次作業付きのGI/G/1待ち行列モデルにおける待ち時間分布を導出し,その留意点をまとめる.", "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 the checkout counter of supermarket. As one of these queueing systems, a GI/G/1 queueing model with vacations (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 with non-exhaustive service, and has a fundamental and an important role in evaluation of quality of service (QoS) of queuing systems. To analyze a M/G/1 (a special case of the GI/G/1 queueing model) with vacations, 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 with vacations 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": "KJ00004259884", "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_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "小林, 香"}, {"creatorName": "コバヤシ, カオリ", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "354", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "片山, 勁"}, {"creatorName": "カタヤマ, ツヨシ", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "355", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KOBAYASHI, Kaori", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "356", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KATAYAMA, Tsuyoshi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "357", "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": "KJ00004259884.pdf", "filesize": [{"value": "881.8 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 881800.0, "url": {"label": "KJ00004259884.pdf", "url": "https://pu-toyama.repo.nii.ac.jp/record/197/files/KJ00004259884.pdf"}, "version_id": "fe60bcdb-fb1e-4183-8636-f0217a98873d"}]}, "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 with Vacation by the Level-Crossing Method", "subitem_title_language": "en"}]}, "item_type_id": "2", "owner": "3", "path": ["53"], "permalink_uri": "https://pu-toyama.repo.nii.ac.jp/records/197", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-02-24"}, "publish_date": "2017-02-24", "publish_status": "0", "recid": "197", "relation": {}, "relation_version_is_last": true, "title": ["Level-Crossing法によるGI/G/1バケーション待ち行列モデルの解析"], "weko_shared_id": -1}
Level-Crossing法によるGI/G/1バケーション待ち行列モデルの解析
https://pu-toyama.repo.nii.ac.jp/records/197
https://pu-toyama.repo.nii.ac.jp/records/197e76f568a-3edf-4415-9301-305c15923986
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | [ELS]紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-02-24 | |||||
タイトル | ||||||
タイトル | Level-Crossing法によるGI/G/1バケーション待ち行列モデルの解析 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | An Analysis of GI/G/1 Queueing Model with Vacation by the Level-Crossing Method | |||||
言語 | ||||||
言語 | jpn | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Level-Crossing法 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | GI/G/1バケーション待ち行列モデル | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 残余仕事量 | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | 待ち時間分布 | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | the level-crossing method | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | GI/G/1 queueing model | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | virtual waiting time | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | distribution function of the waiting time | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
雑誌書誌ID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AN10358595 | |||||
著者 |
小林, 香
× 小林, 香× 片山, 勁× KOBAYASHI, Kaori× KATAYAMA, Tsuyoshi |
|||||
著者所属(日) | ||||||
値 | 工学部電子情報工学科 | |||||
著者所属(日) | ||||||
値 | 工学部電子情報工学科 | |||||
著者所属(英) | ||||||
言語 | en | |||||
値 | Department of Electronics and Informatics, Faculty of Engineering | |||||
著者所属(英) | ||||||
言語 | en | |||||
値 | Department of Electronics and Informatics, Faculty of Engineering | |||||
抄録(日) | ||||||
内容記述タイプ | Other | |||||
内容記述 | 日常生活で頻繁に発生する,有限個の資源を複数の利用者で使用するという状況では,利用者は誰しも自分が資源を利用できるまでの待ち時間を出来るだけ短くしたいという要求がある.このような状況を定量的に解析するのに,有効な手段として待ち行列理論が挙げられる.以前に解析したもっとも基本的なGI/G/1待ち行列システムでは,システム内利用者数がゼロで待機状態にある処理装置は,新たな利用者が到着した時点でサービスを開始し,利用者を待たせることはない.しかし,処理装置が利用者へのサービスの他にも作業を持つ待ち行列システムでは,到着した利用者に「待ち」が発生する.本稿では,直感的に理解可能なLevel-Crossing法を用いて,「バケーション」と総称される副次作業付きのGI/G/1待ち行列モデルにおける待ち時間分布を導出し,その留意点をまとめる. | |||||
抄録(英) | ||||||
内容記述タイプ | Other | |||||
内容記述 | 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 the checkout counter of supermarket. As one of these queueing systems, a GI/G/1 queueing model with vacations (denoted by Kendall's 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 with non-exhaustive service, and has a fundamental and an important role in evaluation of quality of service (QoS) of queuing systems. To analyze a M/G/1 (a special case of the GI/G/1 queueing model) with vacations, 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 with vacations more intuitively than using the generating function of the distribution of the number of users, and discuss this method's validity. | |||||
書誌情報 |
富山県立大学紀要 en : Bulletin of Toyama Prefectural University 巻 14, p. 77-86, 発行日 2004-03-31 |
|||||
表示順 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 7 | |||||
アクセション番号 | ||||||
内容記述タイプ | Other | |||||
内容記述 | KJ00004259884 | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 09167633 |