IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v75y2020i3d10.1007_s11235-020-00689-3.html
   My bibliography  Save this article

Modeling of OpenFlow-related handover messages in mobile networks

Author

Listed:
  • Strahil Panev

    (Ss. Cyril and Methodius University)

  • Pero Latkoski

    (Ss. Cyril and Methodius University)

Abstract

Software defined networking (SDN) and its most popular southbound implementation OpenFlow (OF) are already greatly exploited in the existing mobile cellular networks as part of data centers and mobile core networks. Due to user’s mobility, it is of upmost importance for the operators to provide the shortest possible interruption when the mobile users are performing the procedure of handover. In this work, we proposed a novel analytical approach to model the OF-related handover messages exchanged between the OF-switches and the SDN controller. We modeled two different OF-switch implementations and we compared the results: (1) single shared buffer used for the control and data plane; (2) two priority buffers, where the data plane packets are served only when there are no packets to be processed in the control plane. We numerically evaluated the two systems and we validated the model by using simulations. The obtained results clearly point that although the priority buffering increased the complexity, it effectively provided the shortest handover delay. Therefore, the priority buffering should be the preferred mechanism for mobile networks.

Suggested Citation

  • Strahil Panev & Pero Latkoski, 2020. "Modeling of OpenFlow-related handover messages in mobile networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 75(3), pages 307-318, November.
    • Handle: RePEc:spr:telsys:v:75:y:2020:i:3:d:10.1007_s11235-020-00689-3
    DOI: 10.1007/s11235-020-00689-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-020-00689-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-020-00689-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Paul J. Burke, 1956. "The Output of a Queuing System," Operations Research, INFORMS, vol. 4(6), pages 699-704, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hao Zhang, 2022. "Online platform construction of SOA architecture and streaming media technology under edge computing," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(3), pages 1154-1163, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Glynn, Peter W. & Wang, Rob J., 2023. "A heavy-traffic perspective on departure process variability," Stochastic Processes and their Applications, Elsevier, vol. 166(C).
    2. B. Krishna Kumar & S. Pavai Madheswari & S. Anantha Lakshmi, 2011. "Queuing system with state-dependent controlled batch arrivals and server under maintenance," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 351-379, December.
    3. Perez Becker, Nicole & Arts, Joachim & Reichardt, Sven & Lange, Anne, 2024. "Managing inventories of reusable containers for food take-away at a restaurant," International Journal of Production Economics, Elsevier, vol. 267(C).
    4. repec:fgv:epgrbe:v:68:n:1:a:6 is not listed on IDEAS
    5. Opher Baron & Oded Berman & Dmitry Krass & Jianfu Wang, 2014. "Using Strategic Idleness to Improve Customer Service Experience in Service Networks," Operations Research, INFORMS, vol. 62(1), pages 123-140, February.
    6. Chaithanya Bandi & Dimitris Bertsimas & Nataly Youssef, 2015. "Robust Queueing Theory," Operations Research, INFORMS, vol. 63(3), pages 676-700, June.
    7. Hideaki Takagi & Yuta Kanai & Kazuo Misue, 2017. "Queueing network model for obstetric patient flow in a hospital," Health Care Management Science, Springer, vol. 20(3), pages 433-451, September.
    8. Betea, D. & Ferrari, P.L. & Occelli, A., 2022. "The half-space Airy stat process," Stochastic Processes and their Applications, Elsevier, vol. 146(C), pages 207-263.
    9. Takis Konstantopoulos, 2016. "A review of Burke’s theorem for Brownian motion," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 1-12, June.
    10. Cree S. Dawson & Charles J. McCallum & R. Bradford Murphy & Eric Wolman, 2000. "Operations Research at Bell Laboratories Through the 1970s: Part I," Operations Research, INFORMS, vol. 48(2), pages 205-215, April.
    11. Maury Bramson & Bernardo D’Auria & Neil Walton, 2017. "Proportional Switching in First-in, First-out Networks," Operations Research, INFORMS, vol. 65(2), pages 496-513, April.
    12. Wu, Kan & Zhao, Ning, 2015. "Dependence among single stations in series and its applications in productivity improvement," European Journal of Operational Research, Elsevier, vol. 247(1), pages 245-258.
    13. Sarat Babu Moka & Yoni Nazarathy & Werner Scheinhardt, 2023. "Diffusion parameters of flows in stable multi-class queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 313-346, April.
    14. Gautier, Pieter A., 2002. "Non-sequential search, screening externalities and the public good role of recruitment offices," Economic Modelling, Elsevier, vol. 19(2), pages 179-196, March.
    15. Moura, Fabio Rodrigues de & Paes, Nelson Leitão & Farias, Tácito Augusto, 2014. "O Impacto do Tempo de Pendência das Patentes na Trajetória de Crescimento: Uma Análise com Base no Modelo Schumpeteriano de Crescimento Endógeno com Avanço de Qualidade," Revista Brasileira de Economia - RBE, EPGE Brazilian School of Economics and Finance - FGV EPGE (Brazil), vol. 68(1), April.
    16. Hum, Sin-Hoon & Parlar, Mahmut & Zhou, Yun, 2018. "Measurement and optimization of responsiveness in supply chain networks with queueing structures," European Journal of Operational Research, Elsevier, vol. 264(1), pages 106-118.
    17. Kevin D. Glazebrook & José Niño-Mora, 2001. "Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance," Operations Research, INFORMS, vol. 49(4), pages 609-623, August.
    18. Xenophon Papaconstantinou & Dimitris Bertsimas, 1990. "Relations between the prearrival and postdeparture state probabilities and the fcfs waiting time distribution in the Ek/G/s queue," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 135-149, February.
    19. Simonetta Balsamo & Gian-Luca Dei Rossi & Andrea Marin, 2016. "Lumping and reversed processes in cooperating automata," Annals of Operations Research, Springer, vol. 239(2), pages 695-722, April.
    20. Zhang, Changzhen & Yang, Jun & Wang, Ning, 2023. "Timely reliability modeling and evaluation of wireless sensor networks with adaptive N-policy sleep scheduling," Reliability Engineering and System Safety, Elsevier, vol. 235(C).
    21. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 331-361, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:75:y:2020:i:3:d:10.1007_s11235-020-00689-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.