Utilizarea algoritmului Dijkstra pentru determinarea rutelor de valoare minimă &icirc;n rețele de comunicații

Nistiriuc Ana; Ababii Victor; Chihai Andrei; Ţurcanu Dinu; Nistiriuc Ion; Sharma Popovici Natalia; Nistiriuc Pavel

Articolul precedent

Articolul urmator

322

SM ISO690:2012

NISTIRIUC, Ana, ABABII, Victor, CHIHAI, Andrei, ŢURCANU, Dinu, NISTIRIUC, Ion, SHARMA POPOVICI, Natalia, NISTIRIUC, Pavel. Utilizarea algoritmului Dijkstra pentru determinarea rutelor de valoare minimă în rețele de comunicații. In: Inovaţia: factor al dezvoltării social-economice, 22 decembrie 2017, Cahul. Cahul, Republica Moldova: Universitatea de Stat „Bogdan Petriceicu Hasdeu” din C, 2017, pp. 131-139. ISBN 978-9975-88-025-1.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Inovaţia: factor al dezvoltării social-economice 2017

Conferința "Inovaţia: factor al dezvoltării social-economice"
Cahul, Moldova, 22 decembrie 2017

Utilizarea algoritmului Dijkstra pentru determinarea rutelor de valoare minimă în rețele de comunicații

Pag. 131-139

Nistiriuc Ana, Ababii Victor, Chihai Andrei, Ţurcanu Dinu, Nistiriuc Ion, Sharma Popovici Natalia, Nistiriuc Pavel

Universitatea Tehnică a Moldovei

Disponibil în IBN: 22 martie 2021

Descarcă PDF

Rezumat

In this paper is analyzed the use of the Dijkstra algorithm for determining the minimum length routes in the communication networks.

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-124950</cfResPublId>
<cfResPublDate>2017</cfResPublDate>
<cfStartPage>131</cfStartPage>
<cfISBN>978-9975-88-026-8</cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/124950</cfURI>
<cfTitle cfLangCode='RO' cfTrans='o'>Utilizarea algoritmului Dijkstra pentru determinarea rutelor de valoare minimă &icirc;n rețele de comunicații</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>In this paper is analyzed the use of the Dijkstra algorithm for determining the minimum length routes in the communication networks.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-52138</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-751</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-26928</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-20126</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-20134</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-57185</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-20139</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-52138</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-52138-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
<cfFamilyNames>Nistiriuc</cfFamilyNames>
<cfFirstNames>Ana</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-751</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-751-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
<cfFamilyNames>Абабий</cfFamilyNames>
<cfFirstNames>Виктор</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-26928</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-26928-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
<cfFamilyNames>Chihai</cfFamilyNames>
<cfFirstNames>Andrei</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-20126</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-20126-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
<cfFamilyNames>Ţurcanu</cfFamilyNames>
<cfFirstNames>Dinu</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-20134</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-20134-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
<cfFamilyNames>Nistiriuc</cfFamilyNames>
<cfFirstNames>Ion</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-57185</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-57185-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
<cfFamilyNames>Sharma Popovici</cfFamilyNames>
<cfFirstNames>Natalia</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-20139</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-20139-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
<cfFamilyNames>Nistiriuk</cfFamilyNames>
<cfFirstNames>P.</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>