Theoretical Analysis of Routing Latency in Special Types of Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A00119297" target="_blank" >RIV/68407700:21230/06:00119297 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Theoretical Analysis of Routing Latency in Special Types of Networks
Original language description
The number of routing decisions is obtained from the degree distribution of the networks. From the perspective of the number and complexity of routing decisions along the routing path, the scale-free networks are more effective than the random regular networks.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of Workshop 2006
ISBN
80-01-03439-9
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
—
Publisher name
ČVUT
Place of publication
Praha
Event location
Praha
Event date
Feb 20, 2006
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—