Effective service node traffic routing
The present describes a traffic routing system to establish a connection with a primary service location, receive a list of service location peers from the primary service location, execute a performance test of the primary service location and each of the service location peers, identify a best per...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| 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 | Gordon Stefan K Veit Darrin Maddux Denver |
| description | The present describes a traffic routing system to establish a connection with a primary service location, receive a list of service location peers from the primary service location, execute a performance test of the primary service location and each of the service location peers, identify a best performing service location based at least in part on the performance test, and update a database with results of the performance test of the primary service location and each of the service location peers. The traffic routing system may use business rules to expand the criteria to identify the best performing service location. The business rules may include weights that prioritize certain performance characteristics of corresponding service locations including bandwidth cost, energy cost, or idle capacity. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9787560B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9787560B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9787560B23</originalsourceid><addsrcrecordid>eNrjZFBzTUtLTS7JLEtVKE4tKstMTlXIy09JVSgpSkxLy0xWKMovLcnMS-dhYE1LzClO5YXS3AwKbq4hzh66qQX58anFBYnJqXmpJfGhwZbmFuamZgZORsZEKAEAMj0ngg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Effective service node traffic routing</title><source>esp@cenet</source><creator>Gordon Stefan K ; Veit Darrin ; Maddux Denver</creator><creatorcontrib>Gordon Stefan K ; Veit Darrin ; Maddux Denver</creatorcontrib><description>The present describes a traffic routing system to establish a connection with a primary service location, receive a list of service location peers from the primary service location, execute a performance test of the primary service location and each of the service location peers, identify a best performing service location based at least in part on the performance test, and update a database with results of the performance test of the primary service location and each of the service location peers. The traffic routing system may use business rules to expand the criteria to identify the best performing service location. The business rules may include weights that prioritize certain performance characteristics of corresponding service locations including bandwidth cost, energy cost, or idle capacity.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2017</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=20171010&DB=EPODOC&CC=US&NR=9787560B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76294</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20171010&DB=EPODOC&CC=US&NR=9787560B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Gordon Stefan K</creatorcontrib><creatorcontrib>Veit Darrin</creatorcontrib><creatorcontrib>Maddux Denver</creatorcontrib><title>Effective service node traffic routing</title><description>The present describes a traffic routing system to establish a connection with a primary service location, receive a list of service location peers from the primary service location, execute a performance test of the primary service location and each of the service location peers, identify a best performing service location based at least in part on the performance test, and update a database with results of the performance test of the primary service location and each of the service location peers. The traffic routing system may use business rules to expand the criteria to identify the best performing service location. The business rules may include weights that prioritize certain performance characteristics of corresponding service locations including bandwidth cost, energy cost, or idle capacity.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2017</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFBzTUtLTS7JLEtVKE4tKstMTlXIy09JVSgpSkxLy0xWKMovLcnMS-dhYE1LzClO5YXS3AwKbq4hzh66qQX58anFBYnJqXmpJfGhwZbmFuamZgZORsZEKAEAMj0ngg</recordid><startdate>20171010</startdate><enddate>20171010</enddate><creator>Gordon Stefan K</creator><creator>Veit Darrin</creator><creator>Maddux Denver</creator><scope>EVB</scope></search><sort><creationdate>20171010</creationdate><title>Effective service node traffic routing</title><author>Gordon Stefan K ; Veit Darrin ; Maddux Denver</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9787560B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2017</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>Gordon Stefan K</creatorcontrib><creatorcontrib>Veit Darrin</creatorcontrib><creatorcontrib>Maddux Denver</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gordon Stefan K</au><au>Veit Darrin</au><au>Maddux Denver</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Effective service node traffic routing</title><date>2017-10-10</date><risdate>2017</risdate><abstract>The present describes a traffic routing system to establish a connection with a primary service location, receive a list of service location peers from the primary service location, execute a performance test of the primary service location and each of the service location peers, identify a best performing service location based at least in part on the performance test, and update a database with results of the performance test of the primary service location and each of the service location peers. The traffic routing system may use business rules to expand the criteria to identify the best performing service location. The business rules may include weights that prioritize certain performance characteristics of corresponding service locations including bandwidth cost, energy cost, or idle capacity.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US9787560B2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC COMMUNICATION TECHNIQUE ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
| title | Effective service node traffic routing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T14%3A07%3A11IST&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=Gordon%20Stefan%20K&rft.date=2017-10-10&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9787560B2%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 |