Network Protocol Performance Bounding Exploiting Properties of Infinite Dimensional Linear Equations

  • Ioannis Stavrakakis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6821)


This paper presents a quite versatile and widely applicable performance analysis methodology that has been applied for the study of network resource allocation protocols in the past. It is based on the identification of renewal cycles of the operation of the system and the setting up of recursive equations with respect to quantities-indices defined over the renewal cycles and sessions that appear within. Application of the expectation operator on these equations leads to infinite dimensional systems of linear equations which are shown to posses certain properties leading to rigorous and almost arbitrarily tight bounds on various performance metrics of interest. The special case of a random access protocol is used as an example in order to illustrate the derivation of the recursive equations capturing the protocol dynamics and system inputs. Finally, some other examples of application of the methodology are briefly discussed, illustrating the versatility and powerfulness of the approach. This analysis methodology can be quite useful for understanding the behavior of current complex and large scale networking environments, as well as assessing their scalability, stability and performance.


System Delay Recursive Equation Equation Capture Idle Slot Message Delay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    INFOCOM Network Science Wkshp (NetSciCom 2010), San Diego, USA (2010)Google Scholar
  2. 2.
    Stavrakakis, I.: The Internet of the Future, presentation in session ”WP Objective 1.1, WP 2009-2010: Network of the Future”. In: ICT 2008, Lyon (2008)Google Scholar
  3. 3.
    Stavrakakis, I.: Random Access Multi-user Communication Networks and Approximation of their Output Processes, Ph.D. dissertation, University of Virginia, UMI order No. 8913912, Ann Arbor Michigan (1988)Google Scholar
  4. 4.
    Stavrakakis, I., Kazakos, D.: A Limited Sensing Protocol for Multiuser Packet Radio Systems. IEEE Transactions on Communications 37(4), 353–359 (1989)CrossRefGoogle Scholar
  5. 5.
    Tsybakov, B.S., Vvedenskaya, N.D.: Random Multiple Access Stack Algorithm. Translated from Problemy Peredachi Informatsii 16(3), 80–94 (1980)zbMATHGoogle Scholar
  6. 6.
    Vvedenskaya, N.D., Tsybakov, B.S.: Random Multiple Access of Packets to a Channel with Errors. Translated from Problemy Peredachi Informatsii 19(2), 52–68 (1983)MathSciNetGoogle Scholar
  7. 7.
    Georgiadis, L., Papantoni-Kazakos, P.: Limited Feedback Sensing Algorithms for the Packet Broadcast Channel, Special Issue on Random Access Communications. IEEE Trans. Inform. Theory IT.31, 280–294 (1985)Google Scholar
  8. 8.
    Capetanakis, J.: Tree Algorithm for Packet Broadcast Channel. IEEE Trans. Inform. Theory IT.25, 505–515 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Chung, G.L.: A Course in Probability Theory. Academic, New York (1974)Google Scholar
  10. 10.
    Kantorovich, L.V., Krylov, V.I.: Approximate Methods of Higher Analysis. Interscience, New York (1958)Google Scholar
  11. 11.
    Stavrakakis, I., Kazakos, D.: A Multi-user Random Access Communication System for Users with Different Priorities. IEE Transactions on Communications 39(11) (1991)Google Scholar
  12. 12.
    Stavrakakis, I., Kazakos, D.: On the Approximation of the Output Process of Multi-user Random Access Communication Networks. IEEE Transactions on Communications 38(2) (1990)Google Scholar
  13. 13.
    Stavrakakis, I., Kazakos, D.: Performance Analysis of a Star Topology of Interconnected Networks under 2nd -order Markov Network Output Processes. IEEE Transactions on Communications 38(10) (1990)Google Scholar
  14. 14.
    Stavrakakis, I.: Delay Bounds on a Queuing System with Consistent Priorities. IEEE Transactions on Communications 42(2) (1994)Google Scholar
  15. 15.
    Landry, R., Stavrakakis, I.: Queuing Study of a 3-Priority Policy with Distinct Service Strategies. IEEE/ACM Transactions on Networking 1(5) (1993)Google Scholar
  16. 16.

Copyright information

© IFIP International Federation for Information Processing 2011

Authors and Affiliations

  • Ioannis Stavrakakis
    • 1
  1. 1.Department of Informatics and TelecommunicationsNational and Kapodistrian University of AthensIlissiaGreece

Personalised recommendations