Skip to main content

Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node

  • Conference paper
  • First Online:
Modelling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2020)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 12527))

Abstract

Today’s telecommunication network infrastructure and services are dramatically changing due partially to the rapid increase in the amount of traffic generation and its transportation. This rapid change is also caused by the increased demand for a high quality of services and the recent interest in green networking strengthened by cutting down carbon emission and operation cost. Access networks generate short electronic packets of different sizes, which are aggregated into larger optical packets at the ingress edge nodes of the optical backbone network. It is transported transparently in the optical domain, reconverted into the electronic domain at the egress edge nodes, and delivered to the destination access networks. Packet aggregation provides many benefits at the level of MAN, and core networks such as, increased spectral efficiency, energy efficiency, optimal resource utilisation, simplified traffic management which significantly reduces protocol and signalling overhead. However, packet aggregation introduces performance bottleneck at the edge node as the packets from the access networks are temporarily stored in the aggregation buffers during the packet aggregation process. In this article, we apply the diffusion approximation model and other stochastic modelling methods to analytically evaluate the performance of a new packet aggregation mechanism which was developed specifically for an N-GREEN (Next Generation of Routers for Energy Efficiency) metro network. We obtain the distribution of the packets’ queue in the aggregation buffer, which influences the distribution of the waiting time (delay) experienced by packets in the aggregation buffer. We then, demonstrate the influence of the probability p of successfully inserting the packet data units from the aggregation queue to the optical ring within a defined timeslot \(\varDelta \). We also discuss the performance evaluation of the complete ring by deriving the utilisation of each link.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akyurek, A.S., Rosing, T.S.: Optimal packet aggregation scheduling in wireless networks. IEEE Trans. Mob. Comput. 17(12), 2835–2852 (2018)

    Article  Google Scholar 

  2. Lin, Y., Wang, S., Huang, C., Wu, C.: The SDN approach for the aggregation/disaggregation of sensor data. Sensors 18(7), 2025 (2018)

    Article  Google Scholar 

  3. Hermandéz, J.A., Aracil, J., López, V., de Vergara, J.L.: On the analysis of burst-assembly delay in obs networks and applications in delay-based service differentiation. Photon Netw. Commun. 14, 49–62 (2007)

    Article  Google Scholar 

  4. Gravey, A., Amar, D., Gravey, P., Morvan, M., Uscumlic, B., Chiaroni, D.: Modeling packet insertion on a wsadm ring. In: Proceedings of the 22nd International Conference on Optical Network Design and Modeling (ONDM), (Dublin), pp. 82–87. IEEE (2018)

    Google Scholar 

  5. Choi, J.Y., Le Vu, H., Cameron, C.W., Zukerman, M., Kang, M.: The effect of burst assembly on performance of optical burst switched networks. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 729–739. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-25978-7_73

    Chapter  Google Scholar 

  6. Suila, K.G., Czachórski, T., Rataj, A.: A queueing model of the edge node in IP over all-optical networks. In: Gaj, P., Sawicki, M., Suchacka, G., Kwiecień, A. (eds.) CN 2018. CCIS, vol. 860, pp. 258–271. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92459-5_21

    Chapter  Google Scholar 

  7. Kuaban, G.S., Anyam, E., Czachórski, T., Rataj, A.: Performance of a buffer between electronic and all-optical networks, diffusion approximation model. In: Czachórski, T., Gelenbe, E., Grochla, K., Lent, R. (eds.) ISCIS 2018. CCIS, vol. 935, pp. 68–75. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00840-6_8

    Chapter  Google Scholar 

  8. Kamli, X., Atmaca, T., Lepers, C., Rataj, A., Amar, D.: Performance improvement of colored optical packet switching thanks to time slot sharing. In: Proceedings of the 14th Advanced International Conference on Telecommunications, Barcelona, Spain, pp. 12–31, IARIA (2018)

    Google Scholar 

  9. Kamli, A.: Analysis and Optimisation of a new futuristic optical network architecture. PhD thesis, Ecole doctorale n = 580 Sciences et technologies de l’information et del communication (STIC), Université Paris-Saclay, France (2020)

    Google Scholar 

  10. Chiaroni, D., Uscumlic, B.: Potential of WDM packets.: In: Proceedings of the 2017 International Conference on Optical Network Design and Modeling (ONDM), (Budapest), pp. 1–6. IEEE (2018)

    Google Scholar 

  11. Triki, A. Gravey, A., Gravey, P., Morvan, M.: Long-term capex evolution for slotted optical packet switching in a metropolitan network. In: Proceedings of the 2017 International Conference on Optical Network Design and Modeling (ONDM), (Budapest), pp. 1–6, IEEE (2018)

    Google Scholar 

  12. Gelenbe, E.: On approximate computer systems models. J. ACM 22(2), 261–269 (1975)

    Article  MathSciNet  Google Scholar 

  13. Kobayashi, H.: Modeling and Analysis: An Introduction to System Performance Evaluation Methodology. Addison-Wesley, Reading, Massachusetts (1978)

    MATH  Google Scholar 

  14. Gelenbe, E.: Probabilistic models of computer systems part ii: diffusion approximations, waiting times and batch arrivals. Acta Informatica 12(4), 285–303 (1979)

    Article  MathSciNet  Google Scholar 

  15. Gelenbe, E., Mang, X., Onvural, R.O.: Diffusion based statistical call admission control in ATM. Perform. Eval. 27(12), 411–436 (1996)

    Article  Google Scholar 

  16. Czachórski, T., Pekergin, F.: Diffusion approximation as a modelling tool. In: Kouvatsos, D.D. (ed.) Network Performance Engineering. LNCS, vol. 5233, pp. 447–476. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-02742-0_20

    Chapter  Google Scholar 

  17. Abdelrahman, O., Gelenbe, E.: Diffusion model for energy harvesting sensor nodes. In: Proceedings of 24th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), pp. 154–158, IEEE (2016)

    Google Scholar 

  18. Czachorski, T., Grochla, K.: Diffusion approximation models for cloud computations with task migrations. In: Proceedings of the 2019 IEEE International Conference on Fog Computing (ICFC), Prague. IEEE (2019)

    Google Scholar 

  19. Czachorski, T., Gelenbe, E., Kuaban, S.G., Marek, D.: Transient behaviour of a network router. In: Proceedings of the 43th International Conference on Telecommunications and Signal Processing. Milano, Italy. IEEE (2020)

    Google Scholar 

  20. Cox, R.P., Miller, H.D.: The Theory of Stochastic Processes. Chapman and Hall, London, UK (1965)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tadeusz Czachórski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Atmaca, T., Kamli, A., Kuaban, G.S., Czachórski, T. (2021). Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node. In: Calzarossa, M.C., Gelenbe, E., Grochla, K., Lent, R., Czachórski, T. (eds) Modelling, Analysis, and Simulation of Computer and Telecommunication Systems. MASCOTS 2020. Lecture Notes in Computer Science(), vol 12527. Springer, Cham. https://doi.org/10.1007/978-3-030-68110-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68110-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68109-8

  • Online ISBN: 978-3-030-68110-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics