A method and computer program products for routing a data unit

A method and computer program products for routing a data unit

For routing a data unit through a chain of nodes (101, 102, 103, 104, 105, 106, 10i,..., 10N), the nodes are assigned addresses (1, 2, 3, 4, 5, 6, i, N) that are increasing in one direction of appearance of the nodes in the chain. For routing the data unit, the receiving node (103) first verifies if...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: LI ZHENG, KOZICKI BARTLOMIEJ, HOOGHE KOEN, BORGHS ERIC
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 LI ZHENG
KOZICKI BARTLOMIEJ
HOOGHE KOEN
BORGHS ERIC
description For routing a data unit through a chain of nodes (101, 102, 103, 104, 105, 106, 10i,..., 10N), the nodes are assigned addresses (1, 2, 3, 4, 5, 6, i, N) that are increasing in one direction of appearance of the nodes in the chain. For routing the data unit, the receiving node (103) first verifies if the destination address of the data unit corresponds with the address (2, 4, 1, 5) of its first hop neighbour (102, 104) or its second hop neighbour (101, 105), and the node (103) routes the data unit directly to its first hop neighbour (102, 104) or its second hop neighbour (101, 105) if this is the case. Otherwise, the node (103) determines the difference between the destination address of the data unit and its own address (3) or the difference between the source and destination address of the data unit, selects a routing direction depending on the sign of this difference, and selects a first hop link (132, 134) when the difference is in magnitude below a threshold value or a second hop link (131, 135) when the difference is above the threshold value.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN104285412A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN104285412A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN104285412A3</originalsourceid><addsrcrecordid>eNrjZLBzVMhNLcnIT1FIzEtRSM7PLSgtSS1SKCjKTy9KzAXRKaXJJcUKaflFCkX5pSWZeekKiQopiSWJCqV5mSU8DKxpiTnFqbxQmptB0c01xNlDN7UgPz61uCAxOTUvtSTe2c_QwMTIwtTE0MjRmBg1ADDjMDU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>A method and computer program products for routing a data unit</title><source>esp@cenet</source><creator>LI ZHENG ; KOZICKI BARTLOMIEJ ; HOOGHE KOEN ; BORGHS ERIC</creator><creatorcontrib>LI ZHENG ; KOZICKI BARTLOMIEJ ; HOOGHE KOEN ; BORGHS ERIC</creatorcontrib><description>For routing a data unit through a chain of nodes (101, 102, 103, 104, 105, 106, 10i,..., 10N), the nodes are assigned addresses (1, 2, 3, 4, 5, 6, i, N) that are increasing in one direction of appearance of the nodes in the chain. For routing the data unit, the receiving node (103) first verifies if the destination address of the data unit corresponds with the address (2, 4, 1, 5) of its first hop neighbour (102, 104) or its second hop neighbour (101, 105), and the node (103) routes the data unit directly to its first hop neighbour (102, 104) or its second hop neighbour (101, 105) if this is the case. Otherwise, the node (103) determines the difference between the destination address of the data unit and its own address (3) or the difference between the source and destination address of the data unit, selects a routing direction depending on the sign of this difference, and selects a first hop link (132, 134) when the difference is in magnitude below a threshold value or a second hop link (131, 135) when the difference is above the threshold value.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2015</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=20150114&amp;DB=EPODOC&amp;CC=CN&amp;NR=104285412A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20150114&amp;DB=EPODOC&amp;CC=CN&amp;NR=104285412A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LI ZHENG</creatorcontrib><creatorcontrib>KOZICKI BARTLOMIEJ</creatorcontrib><creatorcontrib>HOOGHE KOEN</creatorcontrib><creatorcontrib>BORGHS ERIC</creatorcontrib><title>A method and computer program products for routing a data unit</title><description>For routing a data unit through a chain of nodes (101, 102, 103, 104, 105, 106, 10i,..., 10N), the nodes are assigned addresses (1, 2, 3, 4, 5, 6, i, N) that are increasing in one direction of appearance of the nodes in the chain. For routing the data unit, the receiving node (103) first verifies if the destination address of the data unit corresponds with the address (2, 4, 1, 5) of its first hop neighbour (102, 104) or its second hop neighbour (101, 105), and the node (103) routes the data unit directly to its first hop neighbour (102, 104) or its second hop neighbour (101, 105) if this is the case. Otherwise, the node (103) determines the difference between the destination address of the data unit and its own address (3) or the difference between the source and destination address of the data unit, selects a routing direction depending on the sign of this difference, and selects a first hop link (132, 134) when the difference is in magnitude below a threshold value or a second hop link (131, 135) when the difference is above the threshold value.</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>2015</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLBzVMhNLcnIT1FIzEtRSM7PLSgtSS1SKCjKTy9KzAXRKaXJJcUKaflFCkX5pSWZeekKiQopiSWJCqV5mSU8DKxpiTnFqbxQmptB0c01xNlDN7UgPz61uCAxOTUvtSTe2c_QwMTIwtTE0MjRmBg1ADDjMDU</recordid><startdate>20150114</startdate><enddate>20150114</enddate><creator>LI ZHENG</creator><creator>KOZICKI BARTLOMIEJ</creator><creator>HOOGHE KOEN</creator><creator>BORGHS ERIC</creator><scope>EVB</scope></search><sort><creationdate>20150114</creationdate><title>A method and computer program products for routing a data unit</title><author>LI ZHENG ; KOZICKI BARTLOMIEJ ; HOOGHE KOEN ; BORGHS ERIC</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN104285412A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2015</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>LI ZHENG</creatorcontrib><creatorcontrib>KOZICKI BARTLOMIEJ</creatorcontrib><creatorcontrib>HOOGHE KOEN</creatorcontrib><creatorcontrib>BORGHS ERIC</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LI ZHENG</au><au>KOZICKI BARTLOMIEJ</au><au>HOOGHE KOEN</au><au>BORGHS ERIC</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>A method and computer program products for routing a data unit</title><date>2015-01-14</date><risdate>2015</risdate><abstract>For routing a data unit through a chain of nodes (101, 102, 103, 104, 105, 106, 10i,..., 10N), the nodes are assigned addresses (1, 2, 3, 4, 5, 6, i, N) that are increasing in one direction of appearance of the nodes in the chain. For routing the data unit, the receiving node (103) first verifies if the destination address of the data unit corresponds with the address (2, 4, 1, 5) of its first hop neighbour (102, 104) or its second hop neighbour (101, 105), and the node (103) routes the data unit directly to its first hop neighbour (102, 104) or its second hop neighbour (101, 105) if this is the case. Otherwise, the node (103) determines the difference between the destination address of the data unit and its own address (3) or the difference between the source and destination address of the data unit, selects a routing direction depending on the sign of this difference, and selects a first hop link (132, 134) when the difference is in magnitude below a threshold value or a second hop link (131, 135) when the difference is above the threshold value.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_CN104285412A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title A method and computer program products for routing a data unit
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T17%3A43%3A40IST&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=LI%20ZHENG&rft.date=2015-01-14&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN104285412A%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