Advertisement

Fairness in Flow-Aware Networks

  • Jerzy DomżałEmail author
  • Robert Wójcik
  • Andrzej Jajszczyk
Chapter
  • 428 Downloads
Part of the Computer Communications and Networks book series (CCN)

Abstract

This chapter shows that fairness per flow may not be the best solution. Therefore, a new concept of fairness for Flow-Aware Networks is proposed. The concept is based on the assumption that similar end users get equal bandwidth in the outgoing link. In contrast to the original solution proposed for Flow-Aware Networks, where fair bandwidth is ensured for each flow, it implements the concept of equal bandwidth for the end users.

Keywords

Source Node Destination Node Admission Control Smoothing Parameter Outgoing Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    J. Domzal, R. Wojcik, A. Jajszczyk, “Per user fairness in flow-aware networks”, in Proc. IEEE International Conference on Communications ICC 2012, Ottawa, Canada, June 2012.Google Scholar
  2. 2.
    J. Domzal, R. Wojcik, A. Jajszczyk, “Reliable Transmission in Flow-Aware Networks’, in Proc. IEEE Global Communications Conference GLOBECOM 2009, Honolulu, USA, December 2009, pp. 1–6.Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Jerzy Domżał
    • 1
    Email author
  • Robert Wójcik
    • 1
  • Andrzej Jajszczyk
    • 1
  1. 1.Department of TelecommunicationsAGH University of Science and TechnologyKrakowPoland

Personalised recommendations