Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level

Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level

A method and apparatus for determining a circuit path between a source node and a destination node within a network comprising a plurality of nodes by iteratively selecting appropriate next nodes using a shortest path algorithm and accepting or rejecting the selected next node based upon the bandwid...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: LEE TED CHONGPI, LE CHINH Q, RAI ARUN K, CHI CHIN-YEH
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
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 LEE TED CHONGPI
LE CHINH Q
RAI ARUN K
CHI CHIN-YEH
description A method and apparatus for determining a circuit path between a source node and a destination node within a network comprising a plurality of nodes by iteratively selecting appropriate next nodes using a shortest path algorithm and accepting or rejecting the selected next node based upon the bandwidth utilization level of the communications link to the next node. In the case of a lack of acceptable communication links or a determined circuit path exceeding an ideal circuit path by a predetermined amount, the threshold levels defining acceptable links are adjusted.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US6963927B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US6963927B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US6963927B13</originalsourceid><addsrcrecordid>eNqNjDEOwjAQBNNQIOAP9wEKiBSUFgSioQLq6BIv2MLYp_hCJF6PhXgAxWqKnd1pISeojYY45IhwzzokusWeuviUQV24k1pQsrFXJCVhtdRCRyBQiAaJWk4wFMNXbPPT6EyW8ti7N6vLjXfhQR4v-HkxubFPWPw4K-iwv-yOS0hskIQ7BGhzPVd1VdbrzXZV_qF8APmsQ34</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level</title><source>esp@cenet</source><creator>LEE TED CHONGPI ; LE CHINH Q ; RAI ARUN K ; CHI CHIN-YEH</creator><creatorcontrib>LEE TED CHONGPI ; LE CHINH Q ; RAI ARUN K ; CHI CHIN-YEH</creatorcontrib><description>A method and apparatus for determining a circuit path between a source node and a destination node within a network comprising a plurality of nodes by iteratively selecting appropriate next nodes using a shortest path algorithm and accepting or rejecting the selected next node based upon the bandwidth utilization level of the communications link to the next node. In the case of a lack of acceptable communication links or a determined circuit path exceeding an ideal circuit path by a predetermined amount, the threshold levels defining acceptable links are adjusted.</description><edition>7</edition><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>2005</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&amp;date=20051108&amp;DB=EPODOC&amp;CC=US&amp;NR=6963927B1$$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&amp;date=20051108&amp;DB=EPODOC&amp;CC=US&amp;NR=6963927B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LEE TED CHONGPI</creatorcontrib><creatorcontrib>LE CHINH Q</creatorcontrib><creatorcontrib>RAI ARUN K</creatorcontrib><creatorcontrib>CHI CHIN-YEH</creatorcontrib><title>Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level</title><description>A method and apparatus for determining a circuit path between a source node and a destination node within a network comprising a plurality of nodes by iteratively selecting appropriate next nodes using a shortest path algorithm and accepting or rejecting the selected next node based upon the bandwidth utilization level of the communications link to the next node. In the case of a lack of acceptable communication links or a determined circuit path exceeding an ideal circuit path by a predetermined amount, the threshold levels defining acceptable links are adjusted.</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>2005</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjDEOwjAQBNNQIOAP9wEKiBSUFgSioQLq6BIv2MLYp_hCJF6PhXgAxWqKnd1pISeojYY45IhwzzokusWeuviUQV24k1pQsrFXJCVhtdRCRyBQiAaJWk4wFMNXbPPT6EyW8ti7N6vLjXfhQR4v-HkxubFPWPw4K-iwv-yOS0hskIQ7BGhzPVd1VdbrzXZV_qF8APmsQ34</recordid><startdate>20051108</startdate><enddate>20051108</enddate><creator>LEE TED CHONGPI</creator><creator>LE CHINH Q</creator><creator>RAI ARUN K</creator><creator>CHI CHIN-YEH</creator><scope>EVB</scope></search><sort><creationdate>20051108</creationdate><title>Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level</title><author>LEE TED CHONGPI ; LE CHINH Q ; RAI ARUN K ; CHI CHIN-YEH</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US6963927B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2005</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>LEE TED CHONGPI</creatorcontrib><creatorcontrib>LE CHINH Q</creatorcontrib><creatorcontrib>RAI ARUN K</creatorcontrib><creatorcontrib>CHI CHIN-YEH</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LEE TED CHONGPI</au><au>LE CHINH Q</au><au>RAI ARUN K</au><au>CHI CHIN-YEH</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level</title><date>2005-11-08</date><risdate>2005</risdate><abstract>A method and apparatus for determining a circuit path between a source node and a destination node within a network comprising a plurality of nodes by iteratively selecting appropriate next nodes using a shortest path algorithm and accepting or rejecting the selected next node based upon the bandwidth utilization level of the communications link to the next node. In the case of a lack of acceptable communication links or a determined circuit path exceeding an ideal circuit path by a predetermined amount, the threshold levels defining acceptable links are adjusted.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US6963927B1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T12%3A10%3A35IST&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=LEE%20TED%20CHONGPI&rft.date=2005-11-08&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS6963927B1%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