Skip to main content
SpringerLink
Log in

More Just Measure of Fairness for Sharing Network Resources

  • Conference paper
  • First Online:
Computer Networks (CN 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 608))

Included in the following conference series:

Abstract

A more just measure of resource distribution in computer networks is proposed. Classic functions evaluate fairness only “on average”. The proposed new fairness score function ensures that no node is left without resources while on average everything looks good. It is compared with well-known and widely adopted function proposed by Jain, Chiu and Hawe and another one recently proposed fairness function by Chen and Zhang. The function proposed in this paper meets most of the properties both earlier proposed functions and at the same time is more restricted and has additional nonzero assignment property.

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 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. Wu, W., Cai, Y., Guizani, M.: Auction-based relay power allocation: Pareto optimality, fairness, and convergence. IEEE Trans. Commun. 62(7), 2249–2259 (2014). doi:10.1109/TCOMM.2014.2331072

    Article  Google Scholar 

  2. Yuan, P., Gambiroza, V., Knightly, E.: The IEEE 802.17 media access protocol for high-speed metropolitan-area resilient packet rings. IEEE Netw. 18(3), 8–15 (2004). doi:10.1109/MNET.2004.1301017

    Article  Google Scholar 

  3. Mayer, A., Ofek, Y., Yung, M.: Local and congestion-driven fairness algorithm in arbitrary topology networks. IEEE/ACM Trans. Networking 8(3), 362–372 (2000). doi:10.1109/90.851982

    Article  Google Scholar 

  4. Durvy, M., Dousse, O., Thiran, P.: On the fairness of large CSMA networks. IEEE J. Sel. Areas Commun. 27(7), 1093–1104 (2009). doi:10.1109/JSAC.2009.090907

    Article  Google Scholar 

  5. Avi-Itzhak, B., Levy, H., Raz, D.: A resource allocation queueing fairness measure: properties and bounds. Quing Syst. 56(2), 65–71 (2007). doi:10.1007/s11134-007-9025-x

    MathSciNet  MATH  Google Scholar 

  6. She, H., Prasad, R.V., Onur, E., Niemegeers, I.G.M.M.: Fairness in wireless networks: issues, measures and challenges. IEEE Commun. Surv. Tutorials 16(1), 5–24 (2014). doi:10.1109/SURV.2013.050113.00015

    Article  Google Scholar 

  7. Jain, R., Chiu, D., Hawe, W.: A quantitative measure of fairness and discrimination for re-source allocation in shared computer systems. DEC research report TR-301 (1984). http://www1.cse.wustl.edu/jain/papers/ftp/fairness.pdf

  8. Google Scholar. Accessed 18 July 2014

    Google Scholar 

  9. Chen, Z., Zhang, C.: A new measurement for network sharing fairness. Comput. Math. Appl. 50(5–6), 803–808 (2005). doi:10.1016/j.camwa.2005.03.015

    Article  MathSciNet  MATH  Google Scholar 

  10. Bharath-Kumar, K., Jaffe, J.M.: A new approach to performance - oriented flow control. IEEE Trans. Commun. 29, 427–435 (1981). doi:10.1109/TCOM.1981.1095007

    Article  Google Scholar 

  11. Su, H., Atiquzzaman, M.: ItswTCM: a new aggregate marker to improve fairness in DiffServ. In: Proceedings of IEEE Global Telecommunications Conference, vol. 3, pp. 1841–1846 (2001). doi:10.1109/GLOCOM.2001.965893

Download references

Author information

Authors and Affiliations

  1. Gdansk University of Technology, 80-233, Gdansk, Poland

    Krzysztof Nowicki

  2. Bradley University, Peoria, IL, 61625, USA

    Aleksander Malinowski

  3. CUBE.ITG, Gdansk, Poland

    Marcin Sikorski

Authors
  1. Krzysztof Nowicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aleksander Malinowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcin Sikorski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aleksander Malinowski .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

  3. Silesian University of Technology, Gliwice, Poland

    Piotr Stera

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Nowicki, K., Malinowski, A., Sikorski, M. (2016). More Just Measure of Fairness for Sharing Network Resources. In: Gaj, P., Kwiecień, A., Stera, P. (eds) Computer Networks. CN 2016. Communications in Computer and Information Science, vol 608. Springer, Cham. https://doi.org/10.1007/978-3-319-39207-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39207-3_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39206-6

  • Online ISBN: 978-3-319-39207-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation