A method of controlling a communications link

A method of controlling a communications link

In the preferred embodiment, the invention provides a modified Shortest Path First routing algorithm for use in a heterogeneous network. The routing algorithm is modified to include predetermined heterogeneous characteristics of the network nodes and to take these characteristics into account when c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: GILMORE, DEREK, HOUSTON, ALLEN, CANNING, TERRENCE
Format: Patent
Sprache:eng ; fre ; ger
Schlagworte:
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
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 GILMORE, DEREK
HOUSTON, ALLEN
CANNING, TERRENCE
description In the preferred embodiment, the invention provides a modified Shortest Path First routing algorithm for use in a heterogeneous network. The routing algorithm is modified to include predetermined heterogeneous characteristics of the network nodes and to take these characteristics into account when calculating the shortest paths. For example, information may be included in the algorithm which identifies heterogeneous network nodes as it calculates shortest paths. Once a node has been identified as heterogeneous, i.e., capable of supporting at least two protocol sets, this information is carried over into subsequent path entries created by the routing algorithm. The algorithm then uses the encapsulation capability identifier in the calculation of the shortest paths by including the cost of auto-tunnelling between heterogeneous nodes to be taken into account when determining the short path.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP1392026A2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP1392026A2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP1392026A23</originalsourceid><addsrcrecordid>eNrjZNB1VMhNLcnIT1HIT1NIzs8rKcrPycnMS1dIBPJyc0vzMpMTSzLz84oVgKLZPAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7Uk3jXA0NjSyMDIzNHImAglAGDmKaY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>A method of controlling a communications link</title><source>esp@cenet</source><creator>GILMORE, DEREK ; HOUSTON, ALLEN ; CANNING, TERRENCE</creator><creatorcontrib>GILMORE, DEREK ; HOUSTON, ALLEN ; CANNING, TERRENCE</creatorcontrib><description>In the preferred embodiment, the invention provides a modified Shortest Path First routing algorithm for use in a heterogeneous network. The routing algorithm is modified to include predetermined heterogeneous characteristics of the network nodes and to take these characteristics into account when calculating the shortest paths. For example, information may be included in the algorithm which identifies heterogeneous network nodes as it calculates shortest paths. Once a node has been identified as heterogeneous, i.e., capable of supporting at least two protocol sets, this information is carried over into subsequent path entries created by the routing algorithm. The algorithm then uses the encapsulation capability identifier in the calculation of the shortest paths by including the cost of auto-tunnelling between heterogeneous nodes to be taken into account when determining the short path.</description><edition>7</edition><language>eng ; fre ; ger</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2004</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=20040225&amp;DB=EPODOC&amp;CC=EP&amp;NR=1392026A2$$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=20040225&amp;DB=EPODOC&amp;CC=EP&amp;NR=1392026A2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GILMORE, DEREK</creatorcontrib><creatorcontrib>HOUSTON, ALLEN</creatorcontrib><creatorcontrib>CANNING, TERRENCE</creatorcontrib><title>A method of controlling a communications link</title><description>In the preferred embodiment, the invention provides a modified Shortest Path First routing algorithm for use in a heterogeneous network. The routing algorithm is modified to include predetermined heterogeneous characteristics of the network nodes and to take these characteristics into account when calculating the shortest paths. For example, information may be included in the algorithm which identifies heterogeneous network nodes as it calculates shortest paths. Once a node has been identified as heterogeneous, i.e., capable of supporting at least two protocol sets, this information is carried over into subsequent path entries created by the routing algorithm. The algorithm then uses the encapsulation capability identifier in the calculation of the shortest paths by including the cost of auto-tunnelling between heterogeneous nodes to be taken into account when determining the short path.</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>2004</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNB1VMhNLcnIT1HIT1NIzs8rKcrPycnMS1dIBPJyc0vzMpMTSzLz84oVgKLZPAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7Uk3jXA0NjSyMDIzNHImAglAGDmKaY</recordid><startdate>20040225</startdate><enddate>20040225</enddate><creator>GILMORE, DEREK</creator><creator>HOUSTON, ALLEN</creator><creator>CANNING, TERRENCE</creator><scope>EVB</scope></search><sort><creationdate>20040225</creationdate><title>A method of controlling a communications link</title><author>GILMORE, DEREK ; HOUSTON, ALLEN ; CANNING, TERRENCE</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP1392026A23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2004</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>GILMORE, DEREK</creatorcontrib><creatorcontrib>HOUSTON, ALLEN</creatorcontrib><creatorcontrib>CANNING, TERRENCE</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GILMORE, DEREK</au><au>HOUSTON, ALLEN</au><au>CANNING, TERRENCE</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>A method of controlling a communications link</title><date>2004-02-25</date><risdate>2004</risdate><abstract>In the preferred embodiment, the invention provides a modified Shortest Path First routing algorithm for use in a heterogeneous network. The routing algorithm is modified to include predetermined heterogeneous characteristics of the network nodes and to take these characteristics into account when calculating the shortest paths. For example, information may be included in the algorithm which identifies heterogeneous network nodes as it calculates shortest paths. Once a node has been identified as heterogeneous, i.e., capable of supporting at least two protocol sets, this information is carried over into subsequent path entries created by the routing algorithm. The algorithm then uses the encapsulation capability identifier in the calculation of the shortest paths by including the cost of auto-tunnelling between heterogeneous nodes to be taken into account when determining the short path.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; fre ; ger
recordid cdi_epo_espacenet_EP1392026A2
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title A method of controlling a communications link
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T16%3A20%3A54IST&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=GILMORE,%20DEREK&rft.date=2004-02-25&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP1392026A2%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