ЗАСТОСУВАННЯ ТЕОРІЇ МЕРЕЖЕВОГО ОБЧИСЛЕННЯ ДЛЯ МОДЕЛЮВАННЯ ПРОГРАМНО-КОНФІГУРОВАНИХ МЕРЕЖ
Ключові слова:
програмно-конфігуровані мережі, теорія мережевого розрахунку, затримка, продуктивність, OpenFlow комутатор
Анотація
Запропоновано новий підхід до моделювання програмно-конфігурованих мереж, що дозволяє оцінити зміну мережевих характеристик, які впливають на показники якості обслуговування. Запропоновано модель фрагменту програмно-конфігурованої мережі, що відображає взаємозв'язок «контролер-комутатор».
Завантаження
Дані про завантаження поки що недоступні.
Посилання
1. Haleplidis E. Software-Defined Networking: Experimenting with the Control to Forwarding Plane Interface // European Workshop on Software Defined Networks (EWSDN), Darmstadt, Germany, 25–26 Oct. 2012., P. 91–96.
2. Lawrence S. Software Engineering: Theory and Practice (2nd ed.). NJ: Prentice Hall, 2001. 630 p. 3.
3. Infonetics Research, Inc. SDN and NFV Strategies: Global Service Provider Survey, 2014, 39 c. http://alu.us.neolane.net/res/img/286758382c7e061c52883e873cee02e6.pdf.
4. Boudec J.-Y. Le, Thiran P. Network calculus. A Theory of Deterministic Queuing Systems for the Internet // Springer Verlag, 2012. 263 p.
5. Cruz R. L. A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory, Vol 37(1), 1991. pp. 132–141.
6. Ciucu F., Burchard A., Liebeherr J. A network service curve approach for the stochastic analysis of networks // ACM SIGMETRICS, 2005, P. 279–290.
7. Chang C.-S. On deterministic traffic regulation and service guarantees: A systematic approach by filtering // IEEE Transactions on Information Theory, Vol 44(3), 1998, P. 1097–1110.
8. Chang C.-S. Performance Guarantees in Communication Networks. Telecommunication Networks and Computer Systems. Springer-Verlag, 2000. 365 p.
9. Schmitt J., Roedig U. Sensor network calculus - a framework for worst case analysis // Distributed Computing on Sensor Systems, 2006. P. 141–154.
10. Skeie T., Johannessen S., Holmeide O. Timeliness of real-time IP communication in switched industrial ethernet networks // IEEE Transactions on Industrial Informatics, Vol 2(1), 2006. P. 25–39.
11. Cruz R. L. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, Vol 13(6), 2007, P.1048–1056.
12. Shang Z., Wolter K. Delay Evaluation of OpenFlow Network Based on Queueing Model: https://www.researchgate.net/publication/306397961_Delay_Evaluation_of_OpenFlow_Network_Based_on_Queueing_Model.
13. Bing Xiong, Kun Yangb, Jinyuan Zhaoc, Wei Lia, Keqin Lid. Performance evaluation of OpenFlow-based software-defined networks based on queueing model // Computer Networks, Vol. (102), 2016, P. 172–185.
14. Issam S. Mathematical models for analysis Software-defined network // International Journal "Information Technologies & Knowledge". Vol. 9 (2). 2015. Р.111 – 123.
15. Jiang Y. Relationship between guaranteed rate server and latency rate server // IEEE Global Telecommunications Conference (GLOBECOM ’02). Vol. 3.,2002. P. 2415–2419.
16. The ATM Forum. Technical Committee. // Traffic Management Specification. Version 4.1 AF-TM-0121.000.
17. Bianco A., Birke R., Giraudo L. Openflow switching: Data plane performance // Communications (ICC), 2010 IEEE International Conference on. IEEE, 2010, pp. 1–5.
18. Zhang H., Ferrari D. Rate controlled service disciplines // Journal of High Speed Networks, Vol 4, 1994, P. 389–412.
19. Zhang Z.-L., Duan Z. Fundamental trade-offs in aggregate packet scheduling // In SPIE Vol. 4526, 2001.
20. Fidler M.,Schmitt J. On the way to a distributed systems calculus: An end-to-end network calculus with data scaling // ACM SIGMETRICS/Performance, 2006, Р. 287–298.
2. Lawrence S. Software Engineering: Theory and Practice (2nd ed.). NJ: Prentice Hall, 2001. 630 p. 3.
3. Infonetics Research, Inc. SDN and NFV Strategies: Global Service Provider Survey, 2014, 39 c. http://alu.us.neolane.net/res/img/286758382c7e061c52883e873cee02e6.pdf.
4. Boudec J.-Y. Le, Thiran P. Network calculus. A Theory of Deterministic Queuing Systems for the Internet // Springer Verlag, 2012. 263 p.
5. Cruz R. L. A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory, Vol 37(1), 1991. pp. 132–141.
6. Ciucu F., Burchard A., Liebeherr J. A network service curve approach for the stochastic analysis of networks // ACM SIGMETRICS, 2005, P. 279–290.
7. Chang C.-S. On deterministic traffic regulation and service guarantees: A systematic approach by filtering // IEEE Transactions on Information Theory, Vol 44(3), 1998, P. 1097–1110.
8. Chang C.-S. Performance Guarantees in Communication Networks. Telecommunication Networks and Computer Systems. Springer-Verlag, 2000. 365 p.
9. Schmitt J., Roedig U. Sensor network calculus - a framework for worst case analysis // Distributed Computing on Sensor Systems, 2006. P. 141–154.
10. Skeie T., Johannessen S., Holmeide O. Timeliness of real-time IP communication in switched industrial ethernet networks // IEEE Transactions on Industrial Informatics, Vol 2(1), 2006. P. 25–39.
11. Cruz R. L. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, Vol 13(6), 2007, P.1048–1056.
12. Shang Z., Wolter K. Delay Evaluation of OpenFlow Network Based on Queueing Model: https://www.researchgate.net/publication/306397961_Delay_Evaluation_of_OpenFlow_Network_Based_on_Queueing_Model.
13. Bing Xiong, Kun Yangb, Jinyuan Zhaoc, Wei Lia, Keqin Lid. Performance evaluation of OpenFlow-based software-defined networks based on queueing model // Computer Networks, Vol. (102), 2016, P. 172–185.
14. Issam S. Mathematical models for analysis Software-defined network // International Journal "Information Technologies & Knowledge". Vol. 9 (2). 2015. Р.111 – 123.
15. Jiang Y. Relationship between guaranteed rate server and latency rate server // IEEE Global Telecommunications Conference (GLOBECOM ’02). Vol. 3.,2002. P. 2415–2419.
16. The ATM Forum. Technical Committee. // Traffic Management Specification. Version 4.1 AF-TM-0121.000.
17. Bianco A., Birke R., Giraudo L. Openflow switching: Data plane performance // Communications (ICC), 2010 IEEE International Conference on. IEEE, 2010, pp. 1–5.
18. Zhang H., Ferrari D. Rate controlled service disciplines // Journal of High Speed Networks, Vol 4, 1994, P. 389–412.
19. Zhang Z.-L., Duan Z. Fundamental trade-offs in aggregate packet scheduling // In SPIE Vol. 4526, 2001.
20. Fidler M.,Schmitt J. On the way to a distributed systems calculus: An end-to-end network calculus with data scaling // ACM SIGMETRICS/Performance, 2006, Р. 287–298.
Опубліковано
2017-12-30
Як цитувати
DurаvkinYe.V. Застосування теорії мережевого обчислення для моделювання програмно-конфігурованих мереж / DurаvkinYe.V., O.B. Tkacheva, Kh.M. Muhi-Aldin // Системи управління, навігації та зв’язку. Збірник наукових праць. – Полтава: ПНТУ, 2017. – Т. 6 (46). – С. 136-140. – Режим доступу: https://journals.nupp.edu.ua/sunz/article/view/732 (дата звернення: 24.11.2024).
Розділ
Статті
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
