Now showing items 1-3 of 3

    • EFFICIENCY ESTIMATION OF COMPUTING GRIDS WITH VARIOUS TRAFFIC TYPES 

      Shmeleva, T.R.; Шмельова, Т.Р.; Шмелёва, Т.Р. (ОНАЗ ім. О.С. Попова, 2017)
      For the efficiency evaluation of computing grids with different types of traffic, reenterable colored Petri nets are suggested. The principles of constructing models in the form of reenterable colored Petri nets are ...
    • SECURITY OF GRID STRUCTURES WITH CUT-THROUGH SWITCHING NODES 

      Shmeleva, T.R.; Шмельова, Т.Р.; Шмелёва, Т.Р. (Институт систем информатики им. А.П. Ершова, 2017)
      Store-and-forward buffering of packets is traditionally used in modern network devices such as switches and routers. But sometimes it is a significant obstacle to the quality of service improvement because the minimal ...
    • VERIFICATION OF SQUARE COMMUNICATION GRID PROTOCOLS VIA INFINITE PETRI NETS 

      Shmeleva, T.R.; Шмельова, Т.Р.; Шмелёва, Т.Р.; Zaitsev, D.A.; Зайцев, Д.А.; Зайцев, Д.А.; Zaitsev, I.D.; Зайцев, І.Д.; Зайцев, И.Д. (European Technology Institute, 2009)
      A technique of the linear invariants calculation for infinite Petri nets with the regular structure is presented and studied on the example of square communication grids of an arbitrary size. It is proven that the compulsory ...