Survey on Router Policies Providing Fairness and Service Differentiation Favoring Real-Time Data Transfers in Internet

  • Jyothish K. John
  • R.V. Siva Balan
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 324)


Internet has IP-based routing mechanism. Forwarding and delivering in Internet is not guaranteed, and it is only a best-effort service. Situations of congestion make Internet difficult for real-time data transfers. Real-time data which have deadlines on quality may suffer from severe problems on throughput and delay. The term ‘fairness’ can be used to indicate a scenario where all flows get QOS approximately proportional to the data rate they contribute to the Internet. This can be achieved by regulating the high bandwidth consuming flows. But the real-time data flows which contribute only small data rate at regular intervals need service differentiation for achieving the deadlines on various QOS parameters. In modern Internet, which has more real-time data transfers, overall fairness can be ensured only if it has mechanisms to differentiate and support real-time transfers. The additional treatment they receive can be justified by such flows’ lower resource consumption. This paper is an extensive survey on router policies to ensure fairness to data flows and service differentiation that favors real-time traffic.


UDP protocol Random early detection RSVP Per hop behavior NCQ scheme 


  1. 1.
    S. Dimitriou, V. Tsaoussidis, A new service differentiation scheme: size based treatment, in Proceedings of ICT 2008 (2008)Google Scholar
  2. 2.
    S. Floyd, V. Jacobson, Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Netw. 1(4), 397–413 (1993)CrossRefGoogle Scholar
  3. 3.
    S. Floyd, K. Fall, Router Mechanisms to support end-to-end congestion control in the Internet. IEEE/ACM Trans. Netw. 7(4), 458–472 (1999)CrossRefGoogle Scholar
  4. 4.
    R. Pan, B. Prabhakar, K. Psounis, CHOKe: a stateless AQM scheme for approximating fair bandwidth allocation, in Proceedings of INFOCOM 2000 (2000)Google Scholar
  5. 5.
    A. Rangarajan, Early Regulation of Unresponsive Flows. Technical Report TRCS99-26 (1999)Google Scholar
  6. 6.
    R. Mahajan, S. Floyd, Controlling high bandwidth flows at the congested router, in Proceedings of ICNP 2001 (2001)Google Scholar
  7. 7.
    W. Feng, D. Kandlur, D. Saha, K.G. Shin, BLUE: A New Class of Active Queue Management Algorithms. Technical Report CSE-TR-387-99, University of Michigan (1999)Google Scholar
  8. 8.
    R. Braden, D. Clark, S. Shankar, RFC1633—integrated services in the internet architecture: an overview (1994)Google Scholar
  9. 9.
    S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, RFC2475—an architecture for differentiated services (1998)Google Scholar
  10. 10.
    D. Clark, W. Fang, Explicit allocation of best-effort packet delivery service. IEEE/ACM Trans. Netw. 6(4), 362–373 (1998)CrossRefGoogle Scholar
  11. 11.
  12. 12.
    D. Lin, R. Morris, Dynamics of random early detection, in Proceedings of SIGCOMM 1997 (1997)Google Scholar
  13. 13.
    L. Mamatas, V. Tsaoussidis, Differentiating services with non-congestive queuing (NCQ). IEEE Trans. Computers. 58(4), 591–604 (2009)Google Scholar
  14. 14.
    L. Mamatas, V. Tsaoussidis, Differentiating services for sensor internetworking, in Proceedings of IFIP Fifth Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net ’07) (2007)Google Scholar
  15. 15.
    L. Mamatas, V. Tsaoussidis, Less Impact Better Service (LIBS): A Service Paradigm for Internet Telephony. Technical Report TR-DUTH-EE-2007-16, Democritus Univ. of Thrace (2007)Google Scholar
  16. 16.
    G. Papastergiou, C. Georgiou, L. Mamatas, V Tsaoussidis, On short packets first: a delay-oriented prioritization policy. Technical Report TR: DUTH-EE-2008-8 (2009)Google Scholar
  17. 17.
    S. Dimitriou, V. Tsaoussidis, A new service differentiation scheme: size based treatment, in Proceedings of ICT 2008 (2008)Google Scholar
  18. 18.
    S. Dimitriou, V. Tsaoussidis, Introducing size-oriented dropping policies as QoS-supportive functions. IEEE Trans. Network Serv. Manage. 7(1), 14–27 (2010)Google Scholar
  19. 19.
    S. Dimitriou, V. Tsaoussidis, Promoting effective service differentiation with size-oriented Queue management. Int. J. Comp. Telecommun. Netw. 54(18), 3360–3372 (2010)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringNoorul Islam UniversityKumaracoilIndia

Personalised recommendations