Photonic Network Communications

, Volume 30, Issue 1, pp 108–130 | Cite as

On the rate-jitter performance of jitter-buffer in TDMoPSN: study using queueing models with a state-dependent service

  • Madhu Babu Sikha
  • R. Manivasakan


Time-division multiplexing over packet-switched network (TDMoPSN) is an intermediate phase of transition from current synchronous TDM to future all-optical converged network. TDMoPSN is exclusively used to transport interactive voice traffic transparently over a PSN (e.g., IP, MPLS or Ethernet). The goal of this paper is to reduce rate-jitter that is introduced into a stream of packets carrying TDM payload. We have proposed two online algorithms, algorithm-A and algorithm-B, to reduce the rate-jitter and shown analytically that the rate-jitter achieved by algorithm-A is strictly less than the rate-jitter of online algorithm proposed by Mansour et al. [1]. We have used three stochastic processes, namely Poisson, Markov-modulated Poisson process (MMPP) and an arrival process with Pareto-distributed inter-arrival times (see [2, 3, 4]) for modeling the arrival of TDM packets (say, IP packets with single or many TDM frames as payloads) at the destination. We undertook statistical analysis of the proposed algorithms by modeling the jitter-buffer as \(M/\widetilde{D}/1/\, B_{on}\) and \(MMPP/\widetilde{D}/1/B_{on}\) queues, to derive steady-state queue-length distribution, mean waiting time and distribution of inter-departure times. We also simulate the most realistic queueing model \(Pareto/\widetilde{D}/1/B_{on}\) of our study and evaluated its performance with respect to the metrics: rate-jitter, mean waiting time, packet loss probability and steady-state queue-length distribution. Simulation results show that our proposed algorithms far outperforms the scheme proposed in [1]. We also present simulation results to verify the correctness of analytical queueing models. The algorithms proposed here are more general (for TDMoPSNs) and can be used to study TDMoIP, pseudowire, CES over metro Ethernet network (MEN), etc.


Inter-departure times Jitter control PSN Queues with state-dependent service Rate-jitter TDMoPSN 


  1. 1.
    Mansour, Y., Patt-Shamir, B.: Jitter control in QoS networks. IEEE/ACM Trans. Netw. 9(4), 492–502 (2001)CrossRefGoogle Scholar
  2. 2.
    Fowler, T.B.: A short tutorial on fractals and internet traffic. Telecommun. Rev. 10, 1–14 (1999)Google Scholar
  3. 3.
    Fischer, M.J., Gross, D., Masi, D.M.B., Shortle, J.F.: Analyzing the waiting time process in internet queueing systems with the transform approximation method. Telecommun. Rev. 12, 21–32 (2001)Google Scholar
  4. 4.
    Paxson, V., Floyd, S.: Wide area traffic: the failure of poisson modeling. IEEE/ACM Trans. Netw. 3(3), 226–244 (1995)CrossRefGoogle Scholar
  5. 5.
    Parikh, K., Kim, J.: TDM services over IP networks. IEEE Military Communications Conference (MILCOM), pp. 1–10 (2007)Google Scholar
  6. 6.
    Stein, Y., Schwartz, E.: Circuit extension over IP: an evolutionary approach to transporting voice and legacy data over IP networks, White paper. RAD Data Communications Inc (2001)Google Scholar
  7. 7.
    Stein, Y., Stroehlein, B.: Taking an Inside Look at TDMoIP: a tutorial, last accessed on Dec 20, (2013)Google Scholar
  8. 8.
    Stein, Y., Shashoua, R., Insler, R., Anavi, M.: Time Division Multiplexing over IP (TDMoIP), RFC 5087 (2007).
  9. 9.
    Giacomazzi, P.: Pseudowire, Last accessed on Dec 20, (2014)
  10. 10.
    Stein, Y.J., Druker, I.: IETF: draft—the effect of packet loss on voice quality for TDM over pseudowires (2003).
  11. 11.
    Elbatt, T.A., El-Henaoui, S., Shaheen, S.: Jitter recovery strategies for multimedia traffic in ATM networks. In: Proceedings of GLOBECOM’96, 2, pp. 1202–1206, (1996)Google Scholar
  12. 12.
    Zhang, H., Keshav, S.: Comparison of rate-based services disciplines. In: Proceedings of ACM SIGCOMM, pp. 113–121, (1991)Google Scholar
  13. 13.
    Hay, D., Scalosub, G.: Jitter regulation for multiple streams. ACM Trans. Algorithms, 6(1), Article 12, 12.1–12.19, (2009). doi: 10.1145/1644015.1644027
  14. 14.
    Yan, Z., Yih-Chyun, J.: Performance analysis of adaptive timing method for voice over ATM using queuing models. In: Proceedings of Winter International Symposium on Information and Communication Technologies (WISICT’04), 1–8 (2004)Google Scholar
  15. 15.
    Sriram, K., Lucatoni, D.M.: Traffic smoothing effects of bit dropping in a packet voice multiplexer. IEEE Trans. Commun. 37(7), 703–712 (1989)CrossRefGoogle Scholar
  16. 16.
    Choi, B.D., Choi, D.I.: Queueing system with queue length dependent service times and its application to cell discarding scheme in ATM networks. In: Proceedings of IEE, 5–11 (1996)Google Scholar
  17. 17.
    Sikha, M., Manivasakan, R.: Novel rate-jitter control algorithms for TDMoIP. IEEE \(19^{th}\) National Conference on Communications (2013)Google Scholar
  18. 18.
    Sikha, M.B., Rathinam, M.: Novel rate-jitter control algorithms modeling and analysis, The Sixth International Conference on Communication Theory, Reliability, and Quality of Service, pp. 22–28 (2013)Google Scholar
  19. 19.
    Gupta, U.C., Samanta, S.K., Goswami, V.: Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process. J. Korean Stat. Soc. 43(4), 545–557 (2014)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Andersen, A.T., Nielsen, B.F.: A Markovian approach for modeling packet traffic with long-range dependence. IEEE J. Sel. Areas Commun. 16(5), 719–732 (1998)CrossRefGoogle Scholar
  21. 21.
    Muscariello, L., Mellia, M., Meo, M., Ajmone Marsan, M., Lo Cigno, R.: Markov models of Internet traffic and a new hierarchical MMPP model. J. Comput. Commun. 28(16), 1835–1851 (2005)CrossRefGoogle Scholar
  22. 22.
    Yoshihara, T., Kasahara, S., Takahashi, T.: Practical time-scale fitting of self-similar traffic with Markov-modulated Poisson process. Telecommun. Syst. 17(1–2), 185–211 (2001)CrossRefGoogle Scholar
  23. 23.
    Nogueira, A., Salvador, P., Valadas, R., Pacheco, A.: Modeling self-similar traffic through markov modulated poisson processes over multiple time scales. In: Proceedings of 6th IEEE International Conference on High Speed Networks and Multimedia Communications (HSNMC’03) (2003)Google Scholar
  24. 24.
    Fischer, W., Meier-Hellstern, K.: The Markov-modulated poisson process (MMPP) cookbook. Perform. Eval. 18(2), 149–171 (1993)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Yegenoglu, F., Jabbari, B.: Modeling of aggregated bursty traffic sources in ATM multiplexers. In: Proceedings of ICC’93, 1703–1707 (1993)Google Scholar
  26. 26.
    Yegenoglu, F., Jabbari, B.: Performance evaluation of MMPP/D/1/K queues for aggregate ATM traffic models. In: Proceedings of INFOCOM’93, 1314–1319 (1993)Google Scholar
  27. 27.
    Mirtchev, S., Goleva, R.: Evaluation of Pareto/D/1/K Queue by Simulation. \(6^{th}\) International Conference on Information Research and Applications-i.Tech 2008, Bulgaria, 45–52 (2008)Google Scholar
  28. 28.
    Fischer, M., Cart, H.: A method for analyzing congestion in pareto and related queues. Telecommun. Rev. 10, 15–28 (1999)Google Scholar
  29. 29.
    Koh, Y., Kim, K.: Loss probability behavior of pareto/M/1/K queue. IEEE Commun. Lett. 7(1), 39–41 (2003)CrossRefGoogle Scholar
  30. 30.
    Koh, Y., Kim, K.: Evaluation of steady-state probability of pareto/M/1/K experiencing tail-raising effect. Lecture Notes in Computer Science 2720, 561–570 (2003)Google Scholar
  31. 31.
    Bertsekas, D.P., Tsitsiklis, J.N.: Introduction to Probability, 2nd edn, p. 430. Athena Scientific (2002)Google Scholar
  32. 32.
    Narayan Bhat, U.: An Introduction to Queueing Theory: Modeling and Analysis in Applications. Springer, Boston (2008)CrossRefGoogle Scholar
  33. 33.
    Gross, D., Harris, C.M.: Fundamentals of Queueing Theory, 2nd edn. Wiley, New York (1985)Google Scholar
  34. 34.
    Blondia, C.: The N/G/l finite capacity queue. Commun. Stat. Stoch. Models 5(2), 273–294 (1989)MathSciNetCrossRefGoogle Scholar
  35. 35.
    Neuts, Marcel F.: A versatile Markovian point process. J. Appl. Probab. 16(4), 764–779 (1979)MathSciNetCrossRefGoogle Scholar
  36. 36.
    Heffes, H., Lucantoni, D.: A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. Sel. Areas Commun. IEEE J. 4(6), 856–868 (1986)CrossRefGoogle Scholar
  37. 37.
    Grassmann, W.K.: The GI/PH/1 queue: a method to find the transition matrix. Infor 20(2–3), 144–156 (1982)Google Scholar
  38. 38.
    Lucantoni, D.M., Ramaswami, V.: Efficient algorithms for solving the nonlinear matrix equations arising in phase type queues. Stoch. Models 1(1), 29–51 (1985)MathSciNetCrossRefGoogle Scholar
  39. 39.
    Nogueira, A., Salvador, P., Valadas, R.: Fitting algorithms for MMPP ATM traffic models. In: Proceedings of the Broadband access conference, Cracow, 167–174 (1999)Google Scholar
  40. 40.
    Gross, D., Shortle, J.F., Fischer, M.J., Masi, D.M.B.: Difficulties in simulating queues with pareto service. In: Proceedings of the Winter Simulation Conference 1, 407–415 (2002)Google Scholar
  41. 41.
    Jain, R.: The Art of Computer Systems Performance Analysis. Wiley (2008)Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of Electrical EngineeringIndian Institute of Technology MadrasChennaiIndia

Personalised recommendations