A new approach to ensure fairness over the internet
Authors: 
Salahuddin Muhammad Salim Zabir, Ahmed Ashir, Gen Kitagata, Norio ShiratoriAuthors Info & Claims
Pages 241 - 255
Abstract
Congestion signaling is an essential issue for ensuring a high network performance. Explicit congestion notification (ECN) has been proved to provide a faster indication of congestion and thus improve the QoS of a TCP/IP network. In this paper, we present a new scheme for ECN named fair in-time marking (FIM), which employs a mechanism that as well as providing an indication of incipient congestion, assures a fair service to all the connections. To facilitate such services using FIM, we propose inclusion of some simple yet effective functionalities in the routers. This is important as the client base of the Internet is increasing rapidly and the demand for a reasonably fair service is getting stronger. Experiments show that FIM offers the best fairness, sometimes better by around 20% or more without affecting efficiency, compared with other proposed schemes for ECN.
References
[1]
1. Stevens W. TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms. RFC-2001, 1997.]]
[2]
2. Floyd S. TCP and explicit congestion notification. ACM Computer Communication Review, 24(5): 10-23, Oct. 1994.]]
[3]
3. Floyd S, Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4): 397-413, Aug. 1993.]]
[4]
4. Salim JH, Ahmed U. Performance Evaluation of Explicit Congestion Notification (ECN) in IP Networks. RFC-2884, 2000.]]
[5]
5. Liu C, Jain R. Improving explicit congestion notification with the mark-front strategy. Computer Networks, 35(2-3): 285-201, Jan. 2001.]]
[6]
6. Huston G. Internet Performance Survival Guide. John Wiley & Sons, New York, NY, 2000.]]
[7]
7. Hasegawa G, Matsuo T, Murata M, Miyahara H. Comparisons of packet scheduling algorithms for fair service among connections on the Internet. In Proceedings of IEEE INFOCOM (Tel Aviv, Israel, Mar. 26-30), 2000.]]
[8]
8. Lakshman TV, Neidhardt A, Ot TJ. The drop from front strategy in TCP and in TCP over ATM. In Proceedings of IEEE INFOCOM (San Francisco, USA, Mar.), 1996.]]
[9]
9. Chen C, Krishnan H, Leung S, Tang N. Implementing Explicit Congestion Notification (ECN) in TCP for IPv6. available at http://www.cs.ucla.edu/tang/papers/ ECN_paper.ps, 1997.]]
[10]
10. Ramakrishnan K, Floyd S. A proposal to add Explicit Congestion Notification (ECN) to IP. RFC-2481, 1999.]]
[11]
11. Nichols K. Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers. RFC-2474, 1998.]]
[12]
12. Gibbens RJ, Kelly FP. Resource pricing and the evolution of congestion control. Automatica, 35: 1969-1985, 1999.]]
[13]
13. Floyd S, Fall K. Promoting the Use of End-to-End Congestion Control in the Internet. IEEE/ACM Transactions on Networking, 7(4): 458-472, Aug. 1999.]]
[14]
14. Sun W, Bhaniramka P, Jain R. Quality of service using traffic engineering over MPLS: an analysis. In Proc. of the 25th Annual IEEE Conference on Local Computer Networks (Florida USA, Nov. 8-10), pages 238-241, 2000.]]
[15]
15. Shreedhar M, Varghese G. Efficient fair queueing using deficit round robin. IEEE/ACM Transaction on Networking, 1(4): 375-385, June 1996.]]
[16]
16. Nagle J. On Packet Switches with Infinite Storage. IEEE Trans. on Comm., 35(4), 1987.]]
[17]
17. Kurata K, Hasegawa G, Murata M. Fairness comparisons between TCP Reno and TCP Vegas for future deployment of TCP Vegas. In Proceedings of INET 2000, available at http://www.isoc.org/inet2000/ cdproceedings/2d/2d_2.htm (Yokohama, Japan, July 18-21), 2000.]]
[18]
18. Ashir A, Zabir SMS, Suganuma T, Shiratori N. An evaluation of performance improvement of different TCP congestion control schemes using ECN. In Proceedings of SNPD'01 (Nagoya, Japan, Aug. 20-22), 2001.]]
[19]
19. Zabir SMS, Ashir A, Shiratori N. Providing fair service over the Internet: An approach based on packet marking. In Proceedings of International Conference on Internet Computing, IC'01 (Las Vegas, USA, June 25-28), 2001.]]
[20]
20. Zabir SMS, Ashir A, Shiratori N. An efficient approach to performance improvement of different TCP enhancements using ECN. IEICE Transaction on Information and Systems, 85-D(8): 1250-1257, August 2002.]]
[21]
21. NS-2. UCB/LBNL/VINT Network Simulator. available at http://www.isi.edu/nsnam/ns/, 2000.]]
[22]
22. Bagal P, Kalyanaraman S, Packer B. Comparative Study of RED, ECN and TCP Rate Control. available at http://www.packeteer.com/technology/pdf/ packeteer-final.pdf, 2000.]]
[23]
23. Jain R. The Art of Computer System Performance Analysis . John Wiley and Sons, USA, 1991.]]
[24]
24. Karandikar S, Kalyanaraman S, Bagal P. TCP Rate Control, Proc. ACM SIGCOMM, Sweden, Aug.-Sept. 2000.]]
[25]
25. Floyd S, Handley M, Padhye J, Widmer J. Equation-based congestion control for unicast applications, Proc. ACM SIGCOMM, Sweden, pp. 43-56, Aug.-Sept. 2000.]]
[26]
26. Braden B. Recommendations on Queue Management and Congestion Avoidance in the Internet. RFC-2309, 1998.]]
[27]
27. Blake S. An Architecture for Differentiated Services. RFC-2475, 1998.]]
Index Terms
- A new approach to ensure fairness over the internet
Recommendations
Achieving bounded fairness for multicast and TCP traffic in the Internet
There is an urgent need for effective multicast congestion control algorithms which enable reasonably fair share of network resources between multicast and unicast TCP traffic under the current Internet infrastructure. In this paper, we propose a ...
A New Schema Congestion Control to Promote Fairness in the Internet Traffic
AICT-ICIW '06: Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and ServicesThis paper describes and evaluates a new schema to reduce the network congestion and the unfair bandwidth allocation for competing flows. These two problems can be caused by unresponsive flows or not TCP-friendly flows. Unresponsive flows don't have ...
A new algorithm to promote fairness and congestion control in the internet
ACST'06: Proceedings of the 2nd IASTED international conference on Advances in computer science and technologyThis paper describes and evaluates a new algorithm to reduce the network congestion and the unfair bandwidth allocation for competing flows. These two problems can be caused by unresponsive flows or not TCP-friendly flows. Unresponsive flows don't have ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
John Wiley & Sons, Inc.
United States
Publication History
Published: 01 July 2004
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 300Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in