An optimal message routing algorithm for circulant networks

An optimal message routing algorithm for circulant networks

A k-circulant network G(n; h1, h2, ... ,hk) is an undirected graph. We present an optimal (i.e. using shortest paths) dynamic two-terminal message routing algorithm for k-circulant networks, k >/= 2. Instead of computing the shortest paths in advance or using routing tables, our algorithm uses on...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of systems architecture 2006-05, Vol.52 (2), p.298
Hauptverfasser: Dobravec, Tomaz, Zerovnik, Janez, Robic, Borut
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Computer networks
Graph theory
Graphs
Routing
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 2
container_start_page 298
container_title Journal of systems architecture
container_volume 52
creator Dobravec, Tomaz
Zerovnik, Janez
Robic, Borut
description A k-circulant network G(n; h1, h2, ... ,hk) is an undirected graph. We present an optimal (i.e. using shortest paths) dynamic two-terminal message routing algorithm for k-circulant networks, k >/= 2. Instead of computing the shortest paths in advance or using routing tables, our algorithm uses only the address of the final destination to determine the next node to which the message must be sent in order to stay on one of the shortest paths to its destination. We introduce the restricted shortest paths, which are used by our routing algorithm, and present an efficient algorithm for their construction in 2-circulant graphs.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_218895568</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1016573851</sourcerecordid><originalsourceid>FETCH-proquest_journals_2188955683</originalsourceid><addsrcrecordid>eNqNiksKwjAUAIMoWD93eLgvNAlJI65EFA_gvoSS1tQ0qXkJXt8uPICrGZhZkIKqmpeSSrGcnSte1pLRNdkgDlVVCUFZQU5nD2FKdtQORoOoewMx5GR9D9r1Idr0HKELEVob2-y0T-BN-oT4wh1Zddqh2f-4JYfb9XG5l1MM72wwNUPI0c-pYVSpoxBS8b-mL78xOMk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>218895568</pqid></control><display><type>article</type><title>An optimal message routing algorithm for circulant networks</title><source>Elsevier ScienceDirect Journals</source><creator>Dobravec, Tomaz ; Zerovnik, Janez ; Robic, Borut</creator><creatorcontrib>Dobravec, Tomaz ; Zerovnik, Janez ; Robic, Borut</creatorcontrib><description>A k-circulant network G(n; h1, h2, ... ,hk) is an undirected graph. We present an optimal (i.e. using shortest paths) dynamic two-terminal message routing algorithm for k-circulant networks, k &gt;/= 2. Instead of computing the shortest paths in advance or using routing tables, our algorithm uses only the address of the final destination to determine the next node to which the message must be sent in order to stay on one of the shortest paths to its destination. We introduce the restricted shortest paths, which are used by our routing algorithm, and present an efficient algorithm for their construction in 2-circulant graphs.</description><identifier>ISSN: 1383-7621</identifier><identifier>EISSN: 1873-6165</identifier><language>eng</language><publisher>Amsterdam: Elsevier Sequoia S.A</publisher><subject>Algorithms ; Computer networks ; Graph theory ; Graphs ; Routing ; Studies</subject><ispartof>Journal of systems architecture, 2006-05, Vol.52 (2), p.298</ispartof><rights>Copyright Elsevier Sequoia S.A. May 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781</link.rule.ids></links><search><creatorcontrib>Dobravec, Tomaz</creatorcontrib><creatorcontrib>Zerovnik, Janez</creatorcontrib><creatorcontrib>Robic, Borut</creatorcontrib><title>An optimal message routing algorithm for circulant networks</title><title>Journal of systems architecture</title><description>A k-circulant network G(n; h1, h2, ... ,hk) is an undirected graph. We present an optimal (i.e. using shortest paths) dynamic two-terminal message routing algorithm for k-circulant networks, k &gt;/= 2. Instead of computing the shortest paths in advance or using routing tables, our algorithm uses only the address of the final destination to determine the next node to which the message must be sent in order to stay on one of the shortest paths to its destination. We introduce the restricted shortest paths, which are used by our routing algorithm, and present an efficient algorithm for their construction in 2-circulant graphs.</description><subject>Algorithms</subject><subject>Computer networks</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Routing</subject><subject>Studies</subject><issn>1383-7621</issn><issn>1873-6165</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNqNiksKwjAUAIMoWD93eLgvNAlJI65EFA_gvoSS1tQ0qXkJXt8uPICrGZhZkIKqmpeSSrGcnSte1pLRNdkgDlVVCUFZQU5nD2FKdtQORoOoewMx5GR9D9r1Idr0HKELEVob2-y0T-BN-oT4wh1Zddqh2f-4JYfb9XG5l1MM72wwNUPI0c-pYVSpoxBS8b-mL78xOMk</recordid><startdate>20060501</startdate><enddate>20060501</enddate><creator>Dobravec, Tomaz</creator><creator>Zerovnik, Janez</creator><creator>Robic, Borut</creator><general>Elsevier Sequoia S.A</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20060501</creationdate><title>An optimal message routing algorithm for circulant networks</title><author>Dobravec, Tomaz ; Zerovnik, Janez ; Robic, Borut</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_2188955683</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Computer networks</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Routing</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dobravec, Tomaz</creatorcontrib><creatorcontrib>Zerovnik, Janez</creatorcontrib><creatorcontrib>Robic, Borut</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of systems architecture</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dobravec, Tomaz</au><au>Zerovnik, Janez</au><au>Robic, Borut</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An optimal message routing algorithm for circulant networks</atitle><jtitle>Journal of systems architecture</jtitle><date>2006-05-01</date><risdate>2006</risdate><volume>52</volume><issue>2</issue><spage>298</spage><pages>298-</pages><issn>1383-7621</issn><eissn>1873-6165</eissn><abstract>A k-circulant network G(n; h1, h2, ... ,hk) is an undirected graph. We present an optimal (i.e. using shortest paths) dynamic two-terminal message routing algorithm for k-circulant networks, k &gt;/= 2. Instead of computing the shortest paths in advance or using routing tables, our algorithm uses only the address of the final destination to determine the next node to which the message must be sent in order to stay on one of the shortest paths to its destination. We introduce the restricted shortest paths, which are used by our routing algorithm, and present an efficient algorithm for their construction in 2-circulant graphs.</abstract><cop>Amsterdam</cop><pub>Elsevier Sequoia S.A</pub></addata></record>
fulltext fulltext
identifier ISSN: 1383-7621
ispartof Journal of systems architecture, 2006-05, Vol.52 (2), p.298
issn 1383-7621
1873-6165
language eng
recordid cdi_proquest_journals_218895568
source Elsevier ScienceDirect Journals
subjects Algorithms
Computer networks
Graph theory
Graphs
Routing
Studies
title An optimal message routing algorithm for circulant networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T09%3A56%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20optimal%20message%20routing%20algorithm%20for%20circulant%20networks&rft.jtitle=Journal%20of%20systems%20architecture&rft.au=Dobravec,%20Tomaz&rft.date=2006-05-01&rft.volume=52&rft.issue=2&rft.spage=298&rft.pages=298-&rft.issn=1383-7621&rft.eissn=1873-6165&rft_id=info:doi/&rft_dat=%3Cproquest%3E1016573851%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=218895568&rft_id=info:pmid/&rfr_iscdi=true