Method for dynamically computing a switching schedule
Methods and systems for dynamically computing a schedule defining interconnections between ports in a switching system. In one embodiment, a switching core requests demand reports from the ingress ports. In response to this request, the ingress ports generate a series of suggested port schedules, be...
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 | BEST ROBERT E HU ROSE Q WATSON JEFF L CHANDRASEKARAN RAMASWAMY FABBRI ALESSANDRO RUDIN, III JOHN R TAMIL LAKSHMAN S |
description | Methods and systems for dynamically computing a schedule defining interconnections between ports in a switching system. In one embodiment, a switching core requests demand reports from the ingress ports. In response to this request, the ingress ports generate a series of suggested port schedules, beginning with a first choice, then a second choice, and so on. The schedules are transmitted to the switching core, beginning with the first choice. The switching core receives the first choice for each of the ports and determines whether the aggregate schedule defined by the first choices is valid. If the aggregate schedule is valid, then this schedule is implemented. If the aggregate schedule is not valid, portions of it are discarded and the next choice from each of the ports is examined to identify connections to replace the discarded portions. This process is repeated until a valid schedule is obtained. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US7106697B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US7106697B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US7106697B13</originalsourceid><addsrcrecordid>eNrjZDD1TS3JyE9RSMsvUkipzEvMzUxOzMmpVEjOzy0oLcnMS1dIVCguzyxJzgCxi5MzUlNKc1J5GFjTEnOKU3mhNDeDgptriLOHbmpBfnxqcUFicmpeakl8aLC5oYGZmaW5k6ExEUoAMpgtRw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method for dynamically computing a switching schedule</title><source>esp@cenet</source><creator>BEST ROBERT E ; HU ROSE Q ; WATSON JEFF L ; CHANDRASEKARAN RAMASWAMY ; FABBRI ALESSANDRO ; RUDIN, III JOHN R ; TAMIL LAKSHMAN S</creator><creatorcontrib>BEST ROBERT E ; HU ROSE Q ; WATSON JEFF L ; CHANDRASEKARAN RAMASWAMY ; FABBRI ALESSANDRO ; RUDIN, III JOHN R ; TAMIL LAKSHMAN S</creatorcontrib><description>Methods and systems for dynamically computing a schedule defining interconnections between ports in a switching system. In one embodiment, a switching core requests demand reports from the ingress ports. In response to this request, the ingress ports generate a series of suggested port schedules, beginning with a first choice, then a second choice, and so on. The schedules are transmitted to the switching core, beginning with the first choice. The switching core receives the first choice for each of the ports and determines whether the aggregate schedule defined by the first choices is valid. If the aggregate schedule is valid, then this schedule is implemented. If the aggregate schedule is not valid, portions of it are discarded and the next choice from each of the ports is examined to identify connections to replace the discarded portions. This process is repeated until a valid schedule is obtained.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; MULTIPLEX COMMUNICATION ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2006</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=20060912&DB=EPODOC&CC=US&NR=7106697B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20060912&DB=EPODOC&CC=US&NR=7106697B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>BEST ROBERT E</creatorcontrib><creatorcontrib>HU ROSE Q</creatorcontrib><creatorcontrib>WATSON JEFF L</creatorcontrib><creatorcontrib>CHANDRASEKARAN RAMASWAMY</creatorcontrib><creatorcontrib>FABBRI ALESSANDRO</creatorcontrib><creatorcontrib>RUDIN, III JOHN R</creatorcontrib><creatorcontrib>TAMIL LAKSHMAN S</creatorcontrib><title>Method for dynamically computing a switching schedule</title><description>Methods and systems for dynamically computing a schedule defining interconnections between ports in a switching system. In one embodiment, a switching core requests demand reports from the ingress ports. In response to this request, the ingress ports generate a series of suggested port schedules, beginning with a first choice, then a second choice, and so on. The schedules are transmitted to the switching core, beginning with the first choice. The switching core receives the first choice for each of the ports and determines whether the aggregate schedule defined by the first choices is valid. If the aggregate schedule is valid, then this schedule is implemented. If the aggregate schedule is not valid, portions of it are discarded and the next choice from each of the ports is examined to identify connections to replace the discarded portions. This process is repeated until a valid schedule is obtained.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>MULTIPLEX COMMUNICATION</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2006</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDD1TS3JyE9RSMsvUkipzEvMzUxOzMmpVEjOzy0oLcnMS1dIVCguzyxJzgCxi5MzUlNKc1J5GFjTEnOKU3mhNDeDgptriLOHbmpBfnxqcUFicmpeakl8aLC5oYGZmaW5k6ExEUoAMpgtRw</recordid><startdate>20060912</startdate><enddate>20060912</enddate><creator>BEST ROBERT E</creator><creator>HU ROSE Q</creator><creator>WATSON JEFF L</creator><creator>CHANDRASEKARAN RAMASWAMY</creator><creator>FABBRI ALESSANDRO</creator><creator>RUDIN, III JOHN R</creator><creator>TAMIL LAKSHMAN S</creator><scope>EVB</scope></search><sort><creationdate>20060912</creationdate><title>Method for dynamically computing a switching schedule</title><author>BEST ROBERT E ; HU ROSE Q ; WATSON JEFF L ; CHANDRASEKARAN RAMASWAMY ; FABBRI ALESSANDRO ; RUDIN, III JOHN R ; TAMIL LAKSHMAN S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US7106697B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2006</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>MULTIPLEX COMMUNICATION</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>BEST ROBERT E</creatorcontrib><creatorcontrib>HU ROSE Q</creatorcontrib><creatorcontrib>WATSON JEFF L</creatorcontrib><creatorcontrib>CHANDRASEKARAN RAMASWAMY</creatorcontrib><creatorcontrib>FABBRI ALESSANDRO</creatorcontrib><creatorcontrib>RUDIN, III JOHN R</creatorcontrib><creatorcontrib>TAMIL LAKSHMAN S</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>BEST ROBERT E</au><au>HU ROSE Q</au><au>WATSON JEFF L</au><au>CHANDRASEKARAN RAMASWAMY</au><au>FABBRI ALESSANDRO</au><au>RUDIN, III JOHN R</au><au>TAMIL LAKSHMAN S</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method for dynamically computing a switching schedule</title><date>2006-09-12</date><risdate>2006</risdate><abstract>Methods and systems for dynamically computing a schedule defining interconnections between ports in a switching system. In one embodiment, a switching core requests demand reports from the ingress ports. In response to this request, the ingress ports generate a series of suggested port schedules, beginning with a first choice, then a second choice, and so on. The schedules are transmitted to the switching core, beginning with the first choice. The switching core receives the first choice for each of the ports and determines whether the aggregate schedule defined by the first choices is valid. If the aggregate schedule is valid, then this schedule is implemented. If the aggregate schedule is not valid, portions of it are discarded and the next choice from each of the ports is examined to identify connections to replace the discarded portions. This process is repeated until a valid schedule is obtained.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_US7106697B1 |
source | esp@cenet |
subjects | ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY MULTIPLEX COMMUNICATION TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
title | Method for dynamically computing a switching schedule |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T06%3A07%3A45IST&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=BEST%20ROBERT%20E&rft.date=2006-09-12&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS7106697B1%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 |