Proceedings of the Institute for System Programming of the RAS
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Proceedings of ISP RAS:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Proceedings of the Institute for System Programming of the RAS, 2015, Volume 27, Issue 1, Pages 69–96
DOI: https://doi.org/10.15514/ISPRAS-2015-27(1)-5
(Mi tisp114)
 

This article is cited in 3 scientific papers (total in 3 papers)

Monitoring of dynamically changed graph

Igor Burdonov, Alexander Kossatchev

Institute for System Programming of the Russian Academy of Sciences
Full-text PDF (320 kB) Citations (3)
References:
Abstract: Monitoring of oriented graphs is a key task in many applications. Such monitoring is very specific when the graph models a communication network including Internet and GRID. A node of the network has local information about the network: if "knows" only about the arcs outgoing from this node, but does not "know" where (to which nodes) these arcs go. The nodes of the network exchange messages through the network links represented as arcs of the graph and act as message transfer channels. The graph monitoring is based on its traversal when message passes each arc in the graph. While there is an untraversed arc, we cannot be certain that it goes to still unmonitored part of the graph. Usually, the graph traversal is performed with a single message circulating in the network. Traversal can be done faster if performed in parallel: multiple messages simultaneously circulate in the network. In this paper we consider the parallel monitoring of a graph aimed at not just the graph traversal, but also collection of complete information about the graph in each its node. Another feature of this work is monitoring of a dynamically changing graph: its arcs can disappear, appear or change their destination nodes. An algorithm is proposed, which provides the collection of full information on the graph in each its node.
Keywords: directed graphs, graph exploration, graph traversal, communicating automata, parallel processing, dynamically changed graphs.
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: Igor Burdonov, Alexander Kossatchev, “Monitoring of dynamically changed graph”, Proceedings of ISP RAS, 27:1 (2015), 69–96
Citation in format AMSBIB
\Bibitem{BurKos15}
\by Igor~Burdonov, Alexander~Kossatchev
\paper Monitoring of dynamically changed graph
\jour Proceedings of ISP RAS
\yr 2015
\vol 27
\issue 1
\pages 69--96
\mathnet{http://mi.mathnet.ru/tisp114}
\crossref{https://doi.org/10.15514/ISPRAS-2015-27(1)-5}
\elib{https://elibrary.ru/item.asp?id=23420342}
Linking options:
  • https://www.mathnet.ru/eng/tisp114
  • https://www.mathnet.ru/eng/tisp/v27/i1/p69
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Proceedings of the Institute for System Programming of the RAS
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024