Routing in Unidirectional (n,k)-star graphs

The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Eddie Cheng [verfasserIn] Serge Kruk [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2006

Schlagwörter:	graphs routing distributed Networks star Interconnection

Übergeordnetes Werk:	In: Journal of Systemics, Cybernetics and Informatics - International Institute of Informatics and Cybernetics, 2011, 4(2006), 3, Seite 74-78
Übergeordnetes Werk:	volume:4 ; year:2006 ; number:3 ; pages:74-78

Links:	Link aufrufen Link aufrufen Journal toc

Katalog-ID:	DOAJ012903337

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ012903337
003	DE-627
005	20230501182223.0
007	cr uuu---uuuuu
008	230225s2006 xx \|\|\|\|\|o 00\| \|\|eng c
035			\|a (DE-627)DOAJ012903337
035			\|a (DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a T58.5-58.64
050		0	\|a P87-96
100	0		\|a Eddie Cheng \|e verfasserin \|4 aut
245	1	0	\|a Routing in Unidirectional (n,k)-star graphs
264		1	\|c 2006
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour.
650		4	\|a graphs
650		4	\|a routing
650		4	\|a distributed
650		4	\|a Networks
650		4	\|a star
650		4	\|a Interconnection
653		0	\|a Information technology
653		0	\|a Communication. Mass media
700	0		\|a Serge Kruk \|e verfasserin \|4 aut
773	0	8	\|i In \|t Journal of Systemics, Cybernetics and Informatics \|d International Institute of Informatics and Cybernetics, 2011 \|g 4(2006), 3, Seite 74-78 \|w (DE-627)505952289 \|w (DE-600)2216824-2 \|x 16904524 \|7 nnns
773	1	8	\|g volume:4 \|g year:2006 \|g number:3 \|g pages:74-78
856	4	0	\|u https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef \|z kostenfrei
856	4	0	\|u http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1690-4524 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a SSG-OLC-PHA
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_74
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_206
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 4 \|j 2006 \|e 3 \|h 74-78

Indexfelder

author_variant	e c ec s k sk
matchkey_str	article:16904524:2006----::otniuiietoan
hierarchy_sort_str	2006
callnumber-subject-code	T
publishDate	2006
allfields	(DE-627)DOAJ012903337 (DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef DE-627 ger DE-627 rakwb eng T58.5-58.64 P87-96 Eddie Cheng verfasserin aut Routing in Unidirectional (n,k)-star graphs 2006 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour. graphs routing distributed Networks star Interconnection Information technology Communication. Mass media Serge Kruk verfasserin aut In Journal of Systemics, Cybernetics and Informatics International Institute of Informatics and Cybernetics, 2011 4(2006), 3, Seite 74-78 (DE-627)505952289 (DE-600)2216824-2 16904524 nnns volume:4 year:2006 number:3 pages:74-78 https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef kostenfrei http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf kostenfrei https://doaj.org/toc/1690-4524 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2006 3 74-78
spelling	(DE-627)DOAJ012903337 (DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef DE-627 ger DE-627 rakwb eng T58.5-58.64 P87-96 Eddie Cheng verfasserin aut Routing in Unidirectional (n,k)-star graphs 2006 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour. graphs routing distributed Networks star Interconnection Information technology Communication. Mass media Serge Kruk verfasserin aut In Journal of Systemics, Cybernetics and Informatics International Institute of Informatics and Cybernetics, 2011 4(2006), 3, Seite 74-78 (DE-627)505952289 (DE-600)2216824-2 16904524 nnns volume:4 year:2006 number:3 pages:74-78 https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef kostenfrei http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf kostenfrei https://doaj.org/toc/1690-4524 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2006 3 74-78
allfields_unstemmed	(DE-627)DOAJ012903337 (DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef DE-627 ger DE-627 rakwb eng T58.5-58.64 P87-96 Eddie Cheng verfasserin aut Routing in Unidirectional (n,k)-star graphs 2006 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour. graphs routing distributed Networks star Interconnection Information technology Communication. Mass media Serge Kruk verfasserin aut In Journal of Systemics, Cybernetics and Informatics International Institute of Informatics and Cybernetics, 2011 4(2006), 3, Seite 74-78 (DE-627)505952289 (DE-600)2216824-2 16904524 nnns volume:4 year:2006 number:3 pages:74-78 https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef kostenfrei http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf kostenfrei https://doaj.org/toc/1690-4524 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2006 3 74-78
allfieldsGer	(DE-627)DOAJ012903337 (DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef DE-627 ger DE-627 rakwb eng T58.5-58.64 P87-96 Eddie Cheng verfasserin aut Routing in Unidirectional (n,k)-star graphs 2006 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour. graphs routing distributed Networks star Interconnection Information technology Communication. Mass media Serge Kruk verfasserin aut In Journal of Systemics, Cybernetics and Informatics International Institute of Informatics and Cybernetics, 2011 4(2006), 3, Seite 74-78 (DE-627)505952289 (DE-600)2216824-2 16904524 nnns volume:4 year:2006 number:3 pages:74-78 https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef kostenfrei http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf kostenfrei https://doaj.org/toc/1690-4524 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2006 3 74-78
allfieldsSound	(DE-627)DOAJ012903337 (DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef DE-627 ger DE-627 rakwb eng T58.5-58.64 P87-96 Eddie Cheng verfasserin aut Routing in Unidirectional (n,k)-star graphs 2006 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour. graphs routing distributed Networks star Interconnection Information technology Communication. Mass media Serge Kruk verfasserin aut In Journal of Systemics, Cybernetics and Informatics International Institute of Informatics and Cybernetics, 2011 4(2006), 3, Seite 74-78 (DE-627)505952289 (DE-600)2216824-2 16904524 nnns volume:4 year:2006 number:3 pages:74-78 https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef kostenfrei http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf kostenfrei https://doaj.org/toc/1690-4524 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2006 3 74-78
language	English
source	In Journal of Systemics, Cybernetics and Informatics 4(2006), 3, Seite 74-78 volume:4 year:2006 number:3 pages:74-78
sourceStr	In Journal of Systemics, Cybernetics and Informatics 4(2006), 3, Seite 74-78 volume:4 year:2006 number:3 pages:74-78
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	graphs routing distributed Networks star Interconnection Information technology Communication. Mass media
isfreeaccess_bool	true
container_title	Journal of Systemics, Cybernetics and Informatics
authorswithroles_txt_mv	Eddie Cheng @@aut@@ Serge Kruk @@aut@@
publishDateDaySort_date	2006-01-01T00:00:00Z
hierarchy_top_id	505952289
id	DOAJ012903337
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ012903337</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230501182223.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2006 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ012903337</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">P87-96</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Eddie Cheng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Routing in Unidirectional (n,k)-star graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">graphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">distributed</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">star</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Interconnection</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Communication. Mass media</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Serge Kruk</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Systemics, Cybernetics and Informatics</subfield><subfield code="d">International Institute of Informatics and Cybernetics, 2011</subfield><subfield code="g">4(2006), 3, Seite 74-78</subfield><subfield code="w">(DE-627)505952289</subfield><subfield code="w">(DE-600)2216824-2</subfield><subfield code="x">16904524</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:74-78</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1690-4524</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="h">74-78</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Eddie Cheng
spellingShingle	Eddie Cheng misc T58.5-58.64 misc P87-96 misc graphs misc routing misc distributed misc Networks misc star misc Interconnection misc Information technology misc Communication. Mass media Routing in Unidirectional (n,k)-star graphs
authorStr	Eddie Cheng
ppnlink_with_tag_str_mv	@@773@@(DE-627)505952289
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	T58
illustrated	Not Illustrated
issn	16904524
topic_title	T58.5-58.64 P87-96 Routing in Unidirectional (n,k)-star graphs graphs routing distributed Networks star Interconnection
topic	misc T58.5-58.64 misc P87-96 misc graphs misc routing misc distributed misc Networks misc star misc Interconnection misc Information technology misc Communication. Mass media
topic_unstemmed	misc T58.5-58.64 misc P87-96 misc graphs misc routing misc distributed misc Networks misc star misc Interconnection misc Information technology misc Communication. Mass media
topic_browse	misc T58.5-58.64 misc P87-96 misc graphs misc routing misc distributed misc Networks misc star misc Interconnection misc Information technology misc Communication. Mass media
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of Systemics, Cybernetics and Informatics
hierarchy_parent_id	505952289
hierarchy_top_title	Journal of Systemics, Cybernetics and Informatics
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)505952289 (DE-600)2216824-2
title	Routing in Unidirectional (n,k)-star graphs
ctrlnum	(DE-627)DOAJ012903337 (DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef
title_full	Routing in Unidirectional (n,k)-star graphs
author_sort	Eddie Cheng
journal	Journal of Systemics, Cybernetics and Informatics
journalStr	Journal of Systemics, Cybernetics and Informatics
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2006
contenttype_str_mv	txt
container_start_page	74
author_browse	Eddie Cheng Serge Kruk
container_volume	4
class	T58.5-58.64 P87-96
format_se	Elektronische Aufsätze
author-letter	Eddie Cheng
author2-role	verfasserin
title_sort	routing in unidirectional (n,k)-star graphs
callnumber	T58.5-58.64
title_auth	Routing in Unidirectional (n,k)-star graphs
abstract	The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour.
abstractGer	The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour.
abstract_unstemmed	The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	3
title_short	Routing in Unidirectional (n,k)-star graphs
url	https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf https://doaj.org/toc/1690-4524
remote_bool	true
author2	Serge Kruk
author2Str	Serge Kruk
ppnlink	505952289
callnumber-subject	T - General Technology
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
callnumber-a	T58.5-58.64
up_date	2024-07-03T14:40:56.635Z
_version_	1803569234332090368
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ012903337</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230501182223.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2006 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ012903337</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ1f909801392848a89a3f9b2b1cf26cef</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">P87-96</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Eddie Cheng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Routing in Unidirectional (n,k)-star graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n,k)-star graphs. The previous bound was 10k-5 for small k and 5k+5[(n-1)/2] for large k; the new bound is 7(k-3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">graphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">distributed</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">star</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Interconnection</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Communication. Mass media</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Serge Kruk</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Systemics, Cybernetics and Informatics</subfield><subfield code="d">International Institute of Informatics and Cybernetics, 2011</subfield><subfield code="g">4(2006), 3, Seite 74-78</subfield><subfield code="w">(DE-627)505952289</subfield><subfield code="w">(DE-600)2216824-2</subfield><subfield code="x">16904524</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:74-78</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.iiisci.org/Journal/CV$/sci/pdfs/P980038.pdf</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1690-4524</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="h">74-78</subfield></datafield></record></collection>
score	7.399913

Nicht das Richtige dabei?

Schreiben Sie uns!

Routing in Unidirectional (n,k)-star graphs

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?