CONTROL DEVICE, CONTROL SYSTEM, CONTROL METHOD, AND CONTROL PROGRAM
PROBLEM TO BE SOLVED: To solve the problem that traffic of a processing request is rejected by a processing site side to be allocated to another site, which applies a larger load to a network for connecting sites in the case that processing requests occur with an arrival rate that exceeds the capaci...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Patent |
| Sprache: | eng ; jpn |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | MIYAO YASUHIRO |
| description | PROBLEM TO BE SOLVED: To solve the problem that traffic of a processing request is rejected by a processing site side to be allocated to another site, which applies a larger load to a network for connecting sites in the case that processing requests occur with an arrival rate that exceeds the capacity of a system in capacity and flow allocation.SOLUTION: An arrival rate of processing requests received by each request site includes the number of uses of a server in each processing site and a constraint condition which does not exceed the total sum about all processing sites of the product of an effective design capacity in a prescribed period, and determines the number of uses of a server which solely processes processing requests from each request site in each processing site, a reception capacity for rejecting a processing request at the request site, and a flow rate from each request site to each processing site from the optimum solution of a mathematical programming problem for minimizing the sum between the total sum of expense about the number of uses of the server at each site and the total sum of earning which is lost due to the rejection of processing requests per unit time.SELECTED DRAWING: Figure 1
【課題】容量・フロー割当てにおいて、システムの容量を上回る到着率で処理要求が発生した場合、処理要求のトラヒックが処理サイト側で拒否されて他のサイトに割り振られ、サイト間を接続するネットワークにより大きな負荷が掛ってしまう。【解決手段】各要求サイトが受け入れた処理要求の到着率は、前記各処理サイトにおける前記サーバの使用数と前記所定周期での有効設計容量の積の全処理サイトに関する総和を上回らないという制約条件とを含み、単位時間当たりにおいて、各サイトでの前記サーバの使用数に関する費用の総和と処理要求の拒否により失われる収入の総和との和を最小化する数理計画問題の最適解から、各処理サイトにおいて各要求サイトからの処理要求を専用に処理するサーバの使用数と、要求サイトで処理要求の拒否を行うための受入れ容量と、各要求サイトから各処理サイトへのフロー比率とを決定する。【選択図】図１ |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JP2016158110A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JP2016158110A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JP2016158110A3</originalsourceid><addsrcrecordid>eNrjZHB29vcLCfL3UXBxDfN0dtVRgPGDI4NDXH0RfF_XEA9_Fx0FRz8XuFhAkL97kKMvDwNrWmJOcSovlOZmUHJzDXH20E0tyI9PLS5ITE7NSy2J9wowMjA0MzS1MDQ0cDQmShEAfw0r2Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>CONTROL DEVICE, CONTROL SYSTEM, CONTROL METHOD, AND CONTROL PROGRAM</title><source>esp@cenet</source><creator>MIYAO YASUHIRO</creator><creatorcontrib>MIYAO YASUHIRO</creatorcontrib><description>PROBLEM TO BE SOLVED: To solve the problem that traffic of a processing request is rejected by a processing site side to be allocated to another site, which applies a larger load to a network for connecting sites in the case that processing requests occur with an arrival rate that exceeds the capacity of a system in capacity and flow allocation.SOLUTION: An arrival rate of processing requests received by each request site includes the number of uses of a server in each processing site and a constraint condition which does not exceed the total sum about all processing sites of the product of an effective design capacity in a prescribed period, and determines the number of uses of a server which solely processes processing requests from each request site in each processing site, a reception capacity for rejecting a processing request at the request site, and a flow rate from each request site to each processing site from the optimum solution of a mathematical programming problem for minimizing the sum between the total sum of expense about the number of uses of the server at each site and the total sum of earning which is lost due to the rejection of processing requests per unit time.SELECTED DRAWING: Figure 1
【課題】容量・フロー割当てにおいて、システムの容量を上回る到着率で処理要求が発生した場合、処理要求のトラヒックが処理サイト側で拒否されて他のサイトに割り振られ、サイト間を接続するネットワークにより大きな負荷が掛ってしまう。【解決手段】各要求サイトが受け入れた処理要求の到着率は、前記各処理サイトにおける前記サーバの使用数と前記所定周期での有効設計容量の積の全処理サイトに関する総和を上回らないという制約条件とを含み、単位時間当たりにおいて、各サイトでの前記サーバの使用数に関する費用の総和と処理要求の拒否により失われる収入の総和との和を最小化する数理計画問題の最適解から、各処理サイトにおいて各要求サイトからの処理要求を専用に処理するサーバの使用数と、要求サイトで処理要求の拒否を行うための受入れ容量と、各要求サイトから各処理サイトへのフロー比率とを決定する。【選択図】図１</description><language>eng ; jpn</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20160901&DB=EPODOC&CC=JP&NR=2016158110A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20160901&DB=EPODOC&CC=JP&NR=2016158110A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>MIYAO YASUHIRO</creatorcontrib><title>CONTROL DEVICE, CONTROL SYSTEM, CONTROL METHOD, AND CONTROL PROGRAM</title><description>PROBLEM TO BE SOLVED: To solve the problem that traffic of a processing request is rejected by a processing site side to be allocated to another site, which applies a larger load to a network for connecting sites in the case that processing requests occur with an arrival rate that exceeds the capacity of a system in capacity and flow allocation.SOLUTION: An arrival rate of processing requests received by each request site includes the number of uses of a server in each processing site and a constraint condition which does not exceed the total sum about all processing sites of the product of an effective design capacity in a prescribed period, and determines the number of uses of a server which solely processes processing requests from each request site in each processing site, a reception capacity for rejecting a processing request at the request site, and a flow rate from each request site to each processing site from the optimum solution of a mathematical programming problem for minimizing the sum between the total sum of expense about the number of uses of the server at each site and the total sum of earning which is lost due to the rejection of processing requests per unit time.SELECTED DRAWING: Figure 1
【課題】容量・フロー割当てにおいて、システムの容量を上回る到着率で処理要求が発生した場合、処理要求のトラヒックが処理サイト側で拒否されて他のサイトに割り振られ、サイト間を接続するネットワークにより大きな負荷が掛ってしまう。【解決手段】各要求サイトが受け入れた処理要求の到着率は、前記各処理サイトにおける前記サーバの使用数と前記所定周期での有効設計容量の積の全処理サイトに関する総和を上回らないという制約条件とを含み、単位時間当たりにおいて、各サイトでの前記サーバの使用数に関する費用の総和と処理要求の拒否により失われる収入の総和との和を最小化する数理計画問題の最適解から、各処理サイトにおいて各要求サイトからの処理要求を専用に処理するサーバの使用数と、要求サイトで処理要求の拒否を行うための受入れ容量と、各要求サイトから各処理サイトへのフロー比率とを決定する。【選択図】図１</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHB29vcLCfL3UXBxDfN0dtVRgPGDI4NDXH0RfF_XEA9_Fx0FRz8XuFhAkL97kKMvDwNrWmJOcSovlOZmUHJzDXH20E0tyI9PLS5ITE7NSy2J9wowMjA0MzS1MDQ0cDQmShEAfw0r2Q</recordid><startdate>20160901</startdate><enddate>20160901</enddate><creator>MIYAO YASUHIRO</creator><scope>EVB</scope></search><sort><creationdate>20160901</creationdate><title>CONTROL DEVICE, CONTROL SYSTEM, CONTROL METHOD, AND CONTROL PROGRAM</title><author>MIYAO YASUHIRO</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JP2016158110A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; jpn</language><creationdate>2016</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>MIYAO YASUHIRO</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>MIYAO YASUHIRO</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>CONTROL DEVICE, CONTROL SYSTEM, CONTROL METHOD, AND CONTROL PROGRAM</title><date>2016-09-01</date><risdate>2016</risdate><abstract>PROBLEM TO BE SOLVED: To solve the problem that traffic of a processing request is rejected by a processing site side to be allocated to another site, which applies a larger load to a network for connecting sites in the case that processing requests occur with an arrival rate that exceeds the capacity of a system in capacity and flow allocation.SOLUTION: An arrival rate of processing requests received by each request site includes the number of uses of a server in each processing site and a constraint condition which does not exceed the total sum about all processing sites of the product of an effective design capacity in a prescribed period, and determines the number of uses of a server which solely processes processing requests from each request site in each processing site, a reception capacity for rejecting a processing request at the request site, and a flow rate from each request site to each processing site from the optimum solution of a mathematical programming problem for minimizing the sum between the total sum of expense about the number of uses of the server at each site and the total sum of earning which is lost due to the rejection of processing requests per unit time.SELECTED DRAWING: Figure 1
【課題】容量・フロー割当てにおいて、システムの容量を上回る到着率で処理要求が発生した場合、処理要求のトラヒックが処理サイト側で拒否されて他のサイトに割り振られ、サイト間を接続するネットワークにより大きな負荷が掛ってしまう。【解決手段】各要求サイトが受け入れた処理要求の到着率は、前記各処理サイトにおける前記サーバの使用数と前記所定周期での有効設計容量の積の全処理サイトに関する総和を上回らないという制約条件とを含み、単位時間当たりにおいて、各サイトでの前記サーバの使用数に関する費用の総和と処理要求の拒否により失われる収入の総和との和を最小化する数理計画問題の最適解から、各処理サイトにおいて各要求サイトからの処理要求を専用に処理するサーバの使用数と、要求サイトで処理要求の拒否を行うための受入れ容量と、各要求サイトから各処理サイトへのフロー比率とを決定する。【選択図】図１</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng ; jpn |
| recordid | cdi_epo_espacenet_JP2016158110A |
| source | esp@cenet |
| subjects | ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
| title | CONTROL DEVICE, CONTROL SYSTEM, CONTROL METHOD, AND CONTROL PROGRAM |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T01%3A17%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=MIYAO%20YASUHIRO&rft.date=2016-09-01&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJP2016158110A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |