Skip to main content
SpringerLink
Log in

On the Throughput of the Scheduler for Virtualization of Links

  • Chapter
Computational Problems in Science and Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 343))

  • 941 Accesses

Abstract

We deal with the scheduler for virtualization of links. The scheduler switches the service of the physical link between virtual links in constant time intervals, thus providing the isolation of the performance between virtual links. Most important characteristics of this scheduler are the throughput and delay of created virtual links. In this paper we demonstrate how the throughput of a virtual link can be controlled either by the virtual link buffer or the virtual link work phase.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Mosharaf Kabir Chowdhury, N.M., Boutaba, R.: A survey of network virtualization. Comput. Netw. 54(5), 862–876 (2010)

    Google Scholar 

  2. Anderson, T., Peterson, L., Shenker, S., Turner, J.: Overcoming the internet impasse through virtualization. Computer 38(4), 34–41 (2005)

    Article  Google Scholar 

  3. Galis, A., et al.: Management and Service-Aware Networking Architectures (MANA) for Future Internet. System Functions, Capabilities and Requirements, Position Paper, Version V6.0, 3 May 2009

    Google Scholar 

  4. Burakowski, W., Tarasiuk, H., Beben, A., Goralski, W., Wisniewski, P.: Ideal device supporting virtualization of network infrastructure in system IIP (in Polish). In: Proceedings of KSTiT ’11, Lodz, 14–16 September 2011, pp. 818–823

    Google Scholar 

  5. Burakowski, W., Tarasiuk, H., Beben, A., Danilewicz, G.: Virtualized network infrastructure supporting co-existence of parallel internets. In: Proceedings of SNPD ’12, Kyoto, 8–10 August 2012, pp. 679–684

    Google Scholar 

  6. Chydzinski, A., Rawski, M., Wisniewski, P., Adamczyk, B., Olszewski, I., Szotkowski, P., Chrost, L., Tomaszewicz, P., Parniewicz, D.: Virtualization devices for prototyping of Future Internet. In: Proceedings of SNPD ’12, Kyoto, 8–10 August 2012, pp. 672–678

    Google Scholar 

  7. Sosnowski, M., Burakowski, W.: Analysis of the system with vacations under Poissonian input stream and constant service times. In: Proceedings of Polish Teletraffic Symposium, Zakopane, 6–7 December 2012, pp. 9–13

    Google Scholar 

  8. Chydzinski, A., Adamczyk, B.: Analysis of a scheduler for virtualization of links with performance isolation. Appl. Math. Inf. Sci. 8(6), 2653–2666 (2014)

    Article  Google Scholar 

  9. Katayama, T.: Waiting time analysis for a queueing system with time-limited service and exponential timer. Nav. Res. Logist. 48(7), 638–651 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Takagi, H.: Queueing Analysis - Vacation and Priority Systems. North-Holland, Amsterdam (1991)

    Google Scholar 

  11. Tian, N., Zhang, Z.G.: Vacation Queueing Models - Theory and Applications. Springer, New York (2006)

    MATH  Google Scholar 

  12. Doshi, B.T.: Queueing systems with vacation: A survey. Queueing Syst. 1, 29–66 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ke, J.C., Wu, C.H., Zhang, Z.G.: Recent developments in vacations queueing models: A short survey. Int. J. Oper. Res. 7(4), 3–8 (2010)

    Google Scholar 

  14. Hur, S., Ahn, S.: Batch arrival queues with vacations and server setup. Appl. Math. Model. 29(12), 1164–1181 (2005)

    Article  MATH  Google Scholar 

  15. Gupta, U.C., Sikdar, K.: Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation. Appl. Math. Comput. 174, 1498–1525 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wu, J., Liu, Z., Peng, Y.: On the BMAP/G/1 G-queues with second optional service and multiple vacations. Appl. Math. Model. 33(12), 4314–4325 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  17. Chung, S.-P., Chen, V.: Performance of power efficient wake-up mechanisms for mobile multimedia communication with bursty traffic. In: Proceedings of the 5th WSEAS International Conference on Data Networks, Communications & Computers, Bucharest, pp. 51–56 (2006)

    Google Scholar 

  18. Ho, J.-H.: A carrier fragmentation aware CSMA/ID MAC protocol for IP over WDM ring networks. WSEAS Trans. Commun. 4(9), 271–280 (2010)

    Google Scholar 

  19. Liu, D., Xu, G., Mastorakis, N.E.: Reliability analysis of a deteriorating system with delayed vacation of repairman. WSEAS Trans. Syst. 12(10), 413–424 (2011)

    Google Scholar 

  20. Chydzinski, A.: Duration of the buffer overflow period in a batch arrival queue. Perform. Eval. 63(4–5), 493–508 (2006)

    Article  Google Scholar 

  21. Chydzinski, A.: Transient analysis of the MMPP/G/1/K queue. Telecommun. Syst. 32(4), 247–262 (2006)

    Article  Google Scholar 

  22. Chydzinski, A., Chrost, L.: Analysis of AQM queues with queue-size based packet dropping. Int. J. Appl. Math. Comput. Sci. 21(3), 567–577 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  23. Chydzinski, A.: Controlling the throughput of virtual links with performance isolation. In: Proceedings on International Conference on Applications of Computer Engineering (ACE ’14), Lisbon, October 2014, pp. 13–18

    Google Scholar 

Download references

Acknowledgements

This is an extended version of the paper [23] presented during International Conference on Applications of Computer Engineering in Lisbon, October 2014.

Author information

Authors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100, Gliwice, Poland

    Andrzej Chydzinski

Authors
  1. Andrzej Chydzinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Chydzinski .

Editor information

Editors and Affiliations

  1. Technical University of Sofia, Sofia, Bulgaria

    Nikos Mastorakis

  2. Departamentul de Inginerie Electrica, University of Craiova, Craiova, Romania

    Aida Bulucea

  3. Naval Academy, Piraeus, Greece

    George Tsekouras

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Chydzinski, A. (2015). On the Throughput of the Scheduler for Virtualization of Links. In: Mastorakis, N., Bulucea, A., Tsekouras, G. (eds) Computational Problems in Science and Engineering. Lecture Notes in Electrical Engineering, vol 343. Springer, Cham. https://doi.org/10.1007/978-3-319-15765-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15765-8_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15764-1

  • Online ISBN: 978-3-319-15765-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation