Parameterized Pulsed Transaction Injection Computation Model And Performance Optimizer For IOTA-Tango

  • Bruno Andriamanalimanana
  • Chen-Fu ChiangEmail author
  • Jorge Novillo
  • Sam Sengupta
  • Ali Tekeoglu
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 24)


To keep a cryptocurrency system at its optimal performance, it is necessary to utilize the resources and avoid latency in its network. To achieve this goal, dynamically and efficiently injecting the unverified transactions to enable synchronicity based on the current system configuration and the traffic of the network is crucial. To meet this need, we design the pulsed transaction injection parameterization (PTIP) protocol to provide a preliminary dynamic injection mechanism. To further assist the network to achieve its subgoals based on various house policies (such as maximal revenue to the network or maximum throughput of the system), we turn the house policy based optimization into a 0/1 knapsack problem. To efficiently solve these NP-hard problems, we adapt and improve a fully polynomial time approximation scheme (FPTAS) and dynamic programming as components in our approximate optimization algorithm.



The authors gratefully acknowledge support from the State University of New York Polytechnic Institute.


  1. 1.
  2. 2.
    Andriamanalimanana, B., Chiang, C., Novillo, J., Sengupta, S., Tekeoglu, A.: Semi-Synchronocity Enabling Protocol and Pulsed Injection Protocol For A Distributed Ledger System. Submitted to 3PGCIC-2018Google Scholar
  3. 3.
    Andriamanalimanana, B., Chiang, C., Novillo, J., Sengupta, S., Tekeoglu, A.: A Probabilistic Model of Periodic Pulsed Transaction Injection. To appear at CSNet 2018: 2nd Cyber Security In Networking Conference. France, Paris (2018)Google Scholar
  4. 4.
    Steinbauer, M., Anderst-Kotsis, G.: Dynamograph: extending the pregel paradigm for large-scale temporal graph processing. Int. J. Grid Util. Comput. 7(2), 141–151 (2016)CrossRefGoogle Scholar
  5. 5.
    Vazirani, V.: Approximation Algorithms. Springer Science & Business Media (2003)Google Scholar
  6. 6.
    Andonov, Rumen, Poirriez, Vincent, Rajopadhye, Sanjay: Unbounded knapsack problem: dynamic programming revisited. Eur. J. Oper. Res. 123(2), 394–407 (2000)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Silvano, M.: Knapsack Problems: Algorithms and Computer Implementations. Wiley-Interscience Series in Discrete Mathematics and Optimization (1990)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Bruno Andriamanalimanana
    • 1
  • Chen-Fu Chiang
    • 1
    Email author
  • Jorge Novillo
    • 1
  • Sam Sengupta
    • 1
  • Ali Tekeoglu
    • 1
  1. 1.State University of New York Polytechnic InstituteUticaUSA

Personalised recommendations