Shortest path routing optimised for network utilisation

Shortest path routing optimised for network utilisation

The shortest path routing method has an optimal routing path (Pi(Z)) within the communications network initially determined in dependence on the communications link costs (LK(L)), with evaluation of a communications traffic loading parameter (V(L)) for each of the communications links (L) and increa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: SCHOLLMEIER GERO,WINKLER CHRISTIAN
Format: Patent
Sprache:eng
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 SCHOLLMEIER GERO,WINKLER CHRISTIAN
description The shortest path routing method has an optimal routing path (Pi(Z)) within the communications network initially determined in dependence on the communications link costs (LK(L)), with evaluation of a communications traffic loading parameter (V(L)) for each of the communications links (L) and increasing of the communications link cost in dependence on a high traffic loading parameter value, with subsequent updating of the optimal routing path.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN1910875A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN1910875A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN1910875A3</originalsourceid><addsrcrecordid>eNrjZDAPzsgvKkktLlEoSCzJUCjKLy3JzEtXyC8oyczNLE5NUUjLL1LISy0pzy_KVgDK5WQWJ5Zk5ufxMLCmJeYUp_JCaW4GeTfXEGcP3dSC_PjU4oLE5FSgrnhnP0NLQwMLc1NHY8IqAH5WLf0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Shortest path routing optimised for network utilisation</title><source>esp@cenet</source><creator>SCHOLLMEIER GERO,WINKLER CHRISTIAN</creator><creatorcontrib>SCHOLLMEIER GERO,WINKLER CHRISTIAN</creatorcontrib><description>The shortest path routing method has an optimal routing path (Pi(Z)) within the communications network initially determined in dependence on the communications link costs (LK(L)), with evaluation of a communications traffic loading parameter (V(L)) for each of the communications links (L) and increasing of the communications link cost in dependence on a high traffic loading parameter value, with subsequent updating of the optimal routing path.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2007</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=20070207&amp;DB=EPODOC&amp;CC=CN&amp;NR=1910875A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20070207&amp;DB=EPODOC&amp;CC=CN&amp;NR=1910875A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SCHOLLMEIER GERO,WINKLER CHRISTIAN</creatorcontrib><title>Shortest path routing optimised for network utilisation</title><description>The shortest path routing method has an optimal routing path (Pi(Z)) within the communications network initially determined in dependence on the communications link costs (LK(L)), with evaluation of a communications traffic loading parameter (V(L)) for each of the communications links (L) and increasing of the communications link cost in dependence on a high traffic loading parameter value, with subsequent updating of the optimal routing 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>2007</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDAPzsgvKkktLlEoSCzJUCjKLy3JzEtXyC8oyczNLE5NUUjLL1LISy0pzy_KVgDK5WQWJ5Zk5ufxMLCmJeYUp_JCaW4GeTfXEGcP3dSC_PjU4oLE5FSgrnhnP0NLQwMLc1NHY8IqAH5WLf0</recordid><startdate>20070207</startdate><enddate>20070207</enddate><creator>SCHOLLMEIER GERO,WINKLER CHRISTIAN</creator><scope>EVB</scope></search><sort><creationdate>20070207</creationdate><title>Shortest path routing optimised for network utilisation</title><author>SCHOLLMEIER GERO,WINKLER CHRISTIAN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN1910875A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2007</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>SCHOLLMEIER GERO,WINKLER CHRISTIAN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SCHOLLMEIER GERO,WINKLER CHRISTIAN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Shortest path routing optimised for network utilisation</title><date>2007-02-07</date><risdate>2007</risdate><abstract>The shortest path routing method has an optimal routing path (Pi(Z)) within the communications network initially determined in dependence on the communications link costs (LK(L)), with evaluation of a communications traffic loading parameter (V(L)) for each of the communications links (L) and increasing of the communications link cost in dependence on a high traffic loading parameter value, with subsequent updating of the optimal routing path.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_CN1910875A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Shortest path routing optimised for network utilisation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T15%3A17%3A13IST&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=SCHOLLMEIER%20GERO,WINKLER%20CHRISTIAN&rft.date=2007-02-07&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN1910875A%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