Skip to main content

Fairness in FAN

  • Chapter
  • First Online:
Guide to Flow-Aware Networking

Abstract

Fairness may be perceived in many ways. For example, best effort transmission is fair because each packet has the same chance of being transmitted. In FAN, each flow is assigned the same rate, which is also fair. However, in current networks we need more sophisticated fairness. Multi-flow applications (e.g., P2P) may overload access networks and result in bandwidth per flow being very low. Such P2P flows may consume almost all bandwidth and the quality of transmission of the remaining traffic may be drastically deteriorated. This brief discussion shows that fairness per flow may not be the best solution. In this chapter, we demonstrate a new approach to assuring fairness in Flow-Aware Networking. We show and evaluate two approaches to improve fairness in FAN. One, already known from the literature, which is based on altering the admission control routine. The other, presented in this chapter, with a redesigned scheduling mechanism. Evaluation shows that a new concept of fairness provides utterly fair resource distribution regardless of the behaviour of users.

Auditur et altera pars. (The other side shall be heard as well.)

— Lucius Annaeus Seneca, Medea

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
Hardcover Book
USD 54.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. J. Domzal, R. Wojcik, A. Jajszczyk, Implicit service differentiation using deficit round robin, in Proceedings of the 19th International Teletraffic Congress, ITC 2005, Beijing (2005)

    Google Scholar 

  2. J. Domzal, R. Wojcik, A. Jajszczyk, Reliable transmission in flow-aware networks, in Proceedings of the IEEE Global Communications Conference GLOBECOM 2009, Honolulu (2009), pp. 1 –6

    Google Scholar 

  3. J. Domzal, R. Wojcik, A. Jajszczyk, Per user fairness in flow-aware networks, in Proceeding of the IEEE International Conference on Communications ICC 2012, Ottawa (2012)

    Google Scholar 

  4. R. Wojcik, J. Domzal, A. Jajszczyk, Fair rate degradation in flow-aware networks, in Proceedings of the IEEE International Conference on Communications ICC 2010 (2010), pp. 1 –5

    Google Scholar 

  5. R. Wojcik, J. Domzal, P. Gawlowicz, A new concept of fairness in flow-aware networking. Int. J. Commun. Syst. 30(18), e3362 (2017) [Online]. https://onlinelibrary.wiley.com/doi/abs/10.1002/dac.3362

  6. L. Xue, S. Kumar, C. Cui, S.-J. Park, A study of fairness among heterogeneous TCP variants over 10 Gbps high-speed optical networks. Opt. Switch. Netw. 13(0), 124–134 (2014)

    Google Scholar 

Download references

Acknowledgement

The authors would like to thank Piotr Gawłowicz for his support, valuable comments and suggestions on improving the quality of this chapter.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Domżał, J., Wójcik, R., Jajszczyk, A. (2020). Fairness in FAN. In: Guide to Flow-Aware Networking. Computer Communications and Networks. Springer, Cham. https://doi.org/10.1007/978-3-030-57153-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57153-5_5

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-030-57153-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics